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

@article{Wang2020SecondOrderCP,
title={Second-Order Conic Programming Approach for Wasserstein Distributionally Robust Two-Stage Linear Programs},
author={Zhuolin Wang and Keyou You and Shiji Song and Yuli Zhang},
journal={IEEE Transactions on Automation Science and Engineering},
year={2020},
volume={19},
pages={946-958}
}
• Published 17 February 2020
• Mathematics
• IEEE Transactions on Automation Science and Engineering
This article proposes a second-order conic programming (SOCP) approach to solve distributionally robust two-stage linear programs over 1-Wasserstein balls. We start from the case with distribution uncertainty only in the objective function and then explore the case with distribution uncertainty only in constraints. The former program is exactly reformulated as a tractable SOCP problem, whereas the latter one is proved to be generally NP-hard as it involves a norm maximization problem over a…
3 Citations

## Figures and Tables from this paper

• Mathematics
ArXiv
• 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
• Engineering
• 2022
We study a pessimistic stochastic bilevel program in the context of sequential two-player games, where the leader makes a binary here-and-now decision, and the follower responds a continuous
• Mathematics
2021 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

## References

SHOWING 1-10 OF 45 REFERENCES

• Mathematics
Oper. Res.
• 2018
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.
• Computer Science
Math. 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.
• Mathematics
Math. 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.
• Mathematics
Comput. 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.
The main tractable reformulations in this paper are projected into the original decision space and thus can be interpreted as conventional two-stage stochastic programs under discrete support with extra penalty terms enforcing the robustness.