Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints

Stochastic dominance relations are well studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into stochastic optimization problems as constraints. In the discrete case, stochastic optimization models involving second order stochastic dominance constraints can be solved by linear programming. However, problems involving first order stochastic dominance constraints are potentially hard due to the non-convexity of the associated feasible regions. In this paper we consider a mixed 0–1 linear programming formulation of a discrete first order constrained optimization model and present a relaxation based on second order constraints. We derive some valid inequalities and restrictions by employing the probabilistic structure of the problem. We also generate cuts that are valid inequalities for the disjunctive relaxations arising from the underlying combinatorial structure of the problem by applying the lift-and-project procedure. We describe three heuristic algorithms to construct feasible solutions, based on conditional second order constraints, variable fixing, and conditional value at risk. Finally, we present numerical results for several instances of a real world portfolio optimization problem.

[1]  Gábor Rudolf,et al.  Relaxations of linear programming problems with first order stochastic dominance constraints , 2006, Oper. Res. Lett..

[2]  A. Ruszczynski,et al.  Semi-infinite probabilistic optimization: first-order stochastic dominance constrain , 2004 .

[3]  H. Levy,et al.  Efficiency analysis of choices involving risk , 1969 .

[4]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[5]  M. Rothschild,et al.  Increasing risk: I. A definition , 1970 .

[6]  Egon Balas,et al.  Facets of the knapsack polytope , 1975, Math. Program..

[7]  Josef Hadar,et al.  Rules for Ordering Uncertain Prospects , 1969 .

[8]  S. Ceria,et al.  Disjunctive Cut Generation for Mixed 0-1 Programs: Duality and Lifting , 1997 .

[9]  W. K. Haneveld.  Duality in Stochastic Linear and Dynamic Programming , 1986 .

[10]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[11]  Wlodzimierz Ogryczak,et al.  Dual Stochastic Dominance and Related Mean-Risk Models , 2002, SIAM J. Optim..

[12]  A. Ruszczynski,et al.  Frontiers of Stochastically Nondominated Portfolios , 2003 .

[13]  Egon Balas,et al.  Solving mixed 0-1programs by a lift-and-project method , 1993, SODA '93.

[14]  R. Rockafellar,et al.  Optimization of conditional value-at risk , 2000 .

[15]  Michael Perregaard.  Generating Disjunctive Cuts for Mixed Integer Programs , 2003 .

[16]  H. B. Mann,et al.  On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other , 1947 .

[17]  J. Buckley,et al.  Stochastic dominance: an approach to decision making under risk. , 1986, Risk analysis : an official publication of the Society for Risk Analysis.

[18]  Hanif D. Sherali,et al.  Disjunctive Programming , 2009, Encyclopedia of Optimization.

[19]  Peter L. Hammer,et al.  Facet of regular 0–1 polytopes , 1975, Math. Program..

[20]  A. Ruszczynski,et al.  Portfolio optimization with stochastic dominance constraints , 2006 .

[21]  Darinka Dentcheva,et al.  Optimization with Stochastic Dominance Constraints , 2003, SIAM J. Optim..

[22]  Wlodzimierz Ogryczak,et al.  From stochastic dominance to mean-risk models: Semideviations as risk measures , 1999, Eur. J. Oper. Res..

[23]  Maarten H. van der Vlerk,et al.  Integrated Chance Constraints: Reduced Forms and an Algorithm , 2006, Comput. Manag. Sci..

[24]  René Henrion,et al.  Regularity and Stability in Nonlinear Semi-Infinite Optimization , 1998 .

[25]  J. Quirk,et al.  Admissibility and Measurable Utility Functions , 1962 .

[26]  Mark A. McComb.  Comparison Methods for Stochastic Models and Risks , 2003, Technometrics.

[27]  H. Levy.  Stochastic dominance and expected utility: survey and analysis , 1992 .

[28]  A. Ruszczynski,et al.  Convexification of Stochastic Ordering , 2004 .

[29]  Egon Balas,et al.  Generating Cuts from Multiple-Term Disjunctions , 2001, IPCO.

[30]  E. Lehmann.  Ordered Families of Distributions , 1955 .

[31]  Darinka Dentcheva,et al.  Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints , 2004, Math. Program..

[32]  Egon Balas,et al.  programming: Properties of the convex hull of feasible points * , 1998 .

[33]  R. M. Adelson,et al.  Utility Theory for Decision Making , 1971 .

[34]  András Prékopa,et al.  Contributions to the theory of stochastic programming , 1973, Math. Program..

[35]  Laurence A. Wolsey,et al.  Faces for a linear inequality in 0–1 variables , 1975, Math. Program..

[36]  E. Balas,et al.  Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

[37]  E. Balas.  DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS , 1975 .

[38]  Charles E. Blair,et al.  A converse for disjunctive constraints , 1978 .

[39]  Alain Pietrus,et al.  An iterative method for perturbed generalized equations , 2004 .

[40]  M. Chapman Findlay,et al.  Stochastic dominance : an approach to decision-making under risk , 1978 .