2008
DOI: 10.1137/070707956
|View full text |Cite
|
Sign up to set email alerts
|

New Formulations for Optimization under Stochastic Dominance Constraints

Abstract: Stochastic dominance constraints allow a decision-maker to manage risk in an optimization setting by requiring their decision to yield a random outcome which stochastically dominates a reference random outcome. We present new integer and linear programming formulations for optimization under first and second-order stochastic dominance constraints, respectively. These formulations are more compact than existing formulations, and relaxing integrality in the first-order formulation yields a second-order formulati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
56
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 80 publications
(57 citation statements)
references
References 20 publications
1
56
0
Order By: Relevance
“…A linear formulation for the second-order stochastic dominance constrained optimization problem is introduced by Luedtke (26). Following Theorem 3.2 of Luedtke's work, the authors obtain the formulation in Equations 12 through 15 for the dominance constraint in Equation 7:…”
Section: Second-order Stochastic Dominance Constraintsmentioning
confidence: 99%
“…A linear formulation for the second-order stochastic dominance constrained optimization problem is introduced by Luedtke (26). Following Theorem 3.2 of Luedtke's work, the authors obtain the formulation in Equations 12 through 15 for the dominance constraint in Equation 7:…”
Section: Second-order Stochastic Dominance Constraintsmentioning
confidence: 99%
“…Based on the general theoretical result in Strassen (1965), Luedtke (2008) recently developed the majorization test (9) further by explicitly including the probabilities of the states (which are assumed equal in (9)) and suggested a branching heuristic for solving the method. His linear programming formulation, however, closely resembles (9), particularly in terms of the computational complexity.…”
Section: Majorization Approachmentioning
confidence: 99%
“…Much of the work on optimization with stochastic dominance has focused on the case where the underlying random quantities being compared are unidimensional [5,6,18,21]. More recently, Dentcheva and Ruszczyński [7] proposed the concept of positive linear second order stochastic dominance which is a special case of multivariate stochastic dominance and obtained necessary conditions of optimality for non-convex problems.…”
Section: Introductionmentioning
confidence: 99%