Corpus ID: 238252980

A Decision Rule Approach for Two-Stage Data-Driven Distributionally Robust Optimization Problems with Random Recourse

  title={A Decision Rule Approach for Two-Stage Data-Driven Distributionally Robust Optimization Problems with Random Recourse},
  author={Xiangyi Fan and Grani Adiwena Hanasusanto},
We study two-stage stochastic optimization problems with random recourse, where the adaptive decisions are multiplied with the uncertain parameters in both the objective function and the constraints. To mitigate the computational intractability of infinite-dimensional optimization, we propose a scalable approximation scheme via piecewise linear and piecewise quadratic decision rules. We then develop a data-driven distributionally robust framework with two layers of robustness to address… Expand

Figures and Tables from this paper


Improved Decision Rule Approximations for Multi-Stage Robust Optimization via Copositive Programming
We study decision rule approximations for generic multi-stage robust linear optimization problems. We consider linear decision rules for the case when the objective coefficients, the recourseExpand
Primal and dual linear decision rules in stochastic and robust optimization
This paper proposes an efficient method to estimate the approximation error introduced by this rather drastic means of complexity reduction: it applies the linear decision rule restriction not only to the primal but also to a dual version of the stochastic program. Expand
A Linear Decision-Based Approximation Approach to Stochastic Programming
This paper proposes tractable methods of addressing a general class of multistage stochastic optimization problems, which assume only limited information of the distributions of the underlying uncertainties, such as known mean, support, and covariance, and proposes several new decision rules that improve upon linear decision rules, while keeping the approximate models computationally tractable. Expand
Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
It is shown that two-stage robust and distributionally robust linear programs can often be reformulated exactly as conic programs that scale polynomially with the problem dimensions. Expand
Two-stage sample robust optimization
This work proposes an approximation algorithm that combines the asymptotic optimality and scalability of the sample average approximation while simultaneously offering improved out-of-sample performance guarantees for sample robust optimization problems. Expand
Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization
This work first derives the structure for optimal decision rules involving continuous and binary variables as piecewise linear and piecewise constant functions, respectively, and proposes a methodology for the optimal design of such decision rules that have a finite number of pieces and solve the problem robustly using mixed-integer optimization. Expand
Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
It is demonstrated that the distributionally robust optimization problems over Wasserstein balls can in fact be reformulated as finite convex programs—in many interesting cases even as tractable linear programs. Expand
Scenario-free stochastic programming with polynomial decision rules
  • Dimitra Bampou, D. Kuhn
  • Computer Science, Mathematics
  • IEEE Conference on Decision and Control and European Control Conference
  • 2011
It is shown that the suboptimality of the best polynomial decision rule can be estimated efficiently by solving a dual version of the stochastic program in polynometric decision rules. Expand
Generalized decision rule approximations for stochastic programming via liftings
It is proved that solving the lifted problem in primal and duallinear decision rules provides tighter bounds than those obtained from applying linear decision rules to the original problem. Expand
Distributionally robust optimization in context of data-driven problems
A decision maker is often confronted with situations where he has incomplete knowledge about some of the parameters of the problem that he is addressing, and a simple approach that lets these parameters take their most likely values might lead to good solutions, but can easily lead to unexpected results in general. Expand