# Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls

@article{Hanasusanto2016ConicPR, title={Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls}, author={Grani Adiwena Hanasusanto and Daniel Kuhn}, journal={Oper. Res.}, year={2016}, volume={66}, pages={849-869} }

Adaptive robust optimization problems are usually solved approximately by restricting the adaptive decisions to simple parametric decision rules. However, the corresponding approximation error can be substantial. In this paper we show that two-stage robust and distributionally robust linear programs can often be reformulated exactly as conic programs that scale polynomially with the problem dimensions. Specifically, when the ambiguity set constitutes a 2-Wasserstein ball centered at a discrete…

## 145 Citations

### Using affine policies to reformulate two-stage Wasserstein distributionally robust linear programs to be independent of sample size

- MathematicsArXiv
- 2023

Intensively studied in theory as a promising data-driven tool for decision-making under ambiguity, two-stage distributionally robust optimization (DRO) problems over Wasserstein balls are not…

### Second-Order Conic Programming Approach for Wasserstein Distributionally Robust Two-Stage Linear Programs

- MathematicsIEEE Transactions on Automation Science and Engineering
- 2022

A second-order conic programming (SOCP) approach to solve distributionally robust two-stage stochastic linear programs over 1-Wasserstein balls is proposed and it is shown that such a robust program is generally NP-hard as it involves a norm maximization problem over a polyhedron.

### Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls

- Mathematics
- 2022

This paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the…

### On distributionally robust chance constrained programs with Wasserstein distance

- Computer ScienceMathematical Programming
- 2019

It is shown that a DRCCP can be reformulated as a conditional value-at-risk constrained optimization problem, and thus admits tight inner and outer approximations and a big-M free formulation.

### Distributionally Robust Two-Stage Stochastic Programming

- MathematicsSIAM J. Optim.
- 2022

Distributionally robust optimization is a popular modeling paradigm in which the underlying distribution of the random parameters in a stochastic optimization model is unknown. Therefore, hedging…

### Tractable reformulations of two-stage distributionally robust linear programs over the type-∞ Wasserstein ball

- EngineeringOper. Res. Lett.
- 2020

### On solving two-stage distributionally robust disjunctive programs with a general ambiguity set

- Computer ScienceEur. J. Oper. Res.
- 2019

### Conic reformulations for Kullback-Leibler divergence constrained distributionally robust optimization and applications

- Computer ScienceAn International Journal of Optimization and Control: Theories & Applications (IJOCTA)
- 2021

The computational study in an out-of-sample analysis shows that the solutions obtained via the distributionally robust optimization approach yield significantly better performance in terms of the dispersion of the cost realizations while the central tendency deteriorates only slightly compared to the solutions obtaining by stochastic programming.

### Solving Wasserstein Robust Two-stage Stochastic Linear Programs via Second-order Conic Programming

- Mathematics2021 40th Chinese Control Conference (CCC)
- 2021

This paper proposes a novel data-driven distributionally robust (DR) two-stage linear program over the 1-Wasserstein ball to handle the stochastic uncertainty with unknown distribution. We study the…

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

- Computer Science
- 2021

This work proposes a scalable approximation scheme via piecewise linear and piecewise quadratic decision rules, and develops a data-driven distributionally robust framework with two layers of robustness to address distributionally uncertainty.

## 70 References

### Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations

- Computer ScienceMath. Program.
- 2018

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.

### Distributionally Robust Optimization and Its Tractable Approximations

- MathematicsOper. Res.
- 2010

A modular framework is presented to obtain an approximate solution to the problem that is distributionally robust and more flexible than the standard technique of using linear rules.

### Distributionally Robust Convex Optimization

- Computer ScienceOper. Res.
- 2014

A unifying framework for modeling and solving distributionally robust optimization problems and introduces standardized ambiguity sets that contain all distributions with prescribed conic representable confidence sets and with mean values residing on an affine manifold.

### A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides

- MathematicsComput. Optim. Appl.
- 2018

It is proved that under standard and simple conditions, the two-stage problem can be reformulated as a copositive optimization problem, which leads to a class of tractable, semidefinite-based approximations that are at least as strong as the affine policy.

### Distributionally Robust Logistic Regression

- Computer Science, MathematicsNIPS
- 2015

This paper uses the Wasserstein distance to construct a ball in the space of probability distributions centered at the uniform distribution on the training samples, and proposes a distributionally robust logistic regression model that minimizes a worst-case expected logloss function.

### Generalized decision rule approximations for stochastic programming via liftings

- Computer ScienceMath. Program.
- 2015

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.

### Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems

- Computer ScienceOper. Res.
- 2010

This paper proposes a model that describes uncertainty in both the distribution form (discrete, Gaussian, exponential, etc.) and moments (mean and covariance matrix) and demonstrates that for a wide range of cost functions the associated distributionally robust stochastic program can be solved efficiently.

### Risk-Averse Two-Stage Stochastic Program with Distributional Ambiguity

- BusinessOper. Res.
- 2018

This paper derives an equivalent reformulation for RTSP that indicates that each worst-case expectation over an L1-norm-based ambiguity set reduces to a convex combination of a conditional value-at-risk and an essential supremum.

### Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion

- MathematicsMath. Oper. Res.
- 2010

The minimax solutions guarantee to hedge against these worst possible distributions and provide a natural distribution to stress test stochastic optimization problems under distributional ambiguity and closer to that of data-driven solutions under the multivariate normal distribution and better under extremal distributions.

### Distributionally Robust Mixed Integer Linear Programs: Persistency Models with Applications

- Computer ScienceEur. J. Oper. Res.
- 2014