A model of distributionally robust two-stage stochastic convex programming with linear recourse
MetadataShow full item record
Funding and Sponsorship
We consider distributionally robust two-stage stochastic convex programming problems, in which the recourse problem is linear. Other than analyzing these new models case by case for different ambiguity sets, we adopt a unified form of ambiguity sets proposed by Wiesemann, Kuhn and Sim, and extend their analysis from a single stochastic constraint to the two-stage stochastic programming setting. It is shown that under a standard set of regularity conditions, this class of problems can be converted to a conic optimization problem. Numerical results are presented to show the efficiency of the distributionally robust approach.
Showing items related by title, author, creator and subject.
Liu, Chunmin (2008)The optimization problems involving stochastic systems are often encountered in financial systems, networks design and routing, supply-chain management, actuarial science, telecommunications systems, statistical pattern ...
Design exploration with stochastic models of variation: Comparing two examples from facade subdivisionDatta, Sambit (2013)The imitation of natural processes in architectural design is a long-standing area of research in computational design. The approach of “directed randomness” permits the stochastic exploration of a vast space of design ...
Stochastic Optimization over a Pareto Set Associated with a Stochastic Multi-Objective Optimization ProblemBonnel, Henri; Collonge, J. (2014)We deal with the problem of minimizing the expectation of a real valued random function over the weakly Pareto or Pareto set associated with a Stochastic Multi-objective Optimization Problem, whose objectives are expectations ...