A Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints

Abstract

In this paper we study linear optimization problems with a newly introduced concept of multidimensional polyhedral linear second-order stochastic dominance constraints. By using the polyhedral properties of this dominance condition, we present a cutting-surface algorithm and show its finite convergence. The cut generation problem is a difference of convex functions (DC) optimization problem. We exploit the polyhedral structure of this problem to present a novel branch-and-cut algorithm that incorporates concepts from concave minimization and binary integer programming. A linear programming problem is formulated for generating concavity cuts in our case, where the polyhedra are unbounded. We also present duality results for this problem relating the dual multipliers to utility functions, without the need to impose constraint qualifications, which again is possible because of the polyhedral nature of the problem. Numerical examples are presented showing the nature of solutions of our model. (A corrected PDF has been appended to the original.)

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 57 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.