Abstract
Linear stochastic programming problems with first order stochastic dominance (FSD) constraints are non-convex. For their mixed 0–1 linear programming formulation we present two convex relaxations based on second order stochastic dominance (SSD). We develop necessary and sufficient conditions for FSD, used to obtain a disjunctive programming formulation and to strengthen one of the SSD-based relaxations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have