Distributionally Robust Joint Chance-Constrained Programming with Wasserstein Metric
Preprint
Abstract
In this paper, we develop an exact reformulation and a deterministic approximation for distributionally robust joint chance-constrained programmings (DRCCPs) with a general class of convex uncertain constraints under data-driven Wasserstein ambiguity sets. It is known that robust chance constraints can be conservatively approximated by worst-case conditional value-at-risk (CVaR) constraints. It is shown that the proposed worst-case CVaR approximation model can be reformulated as an optimization problem involving biconvex constraints for joint DRCCP. We then derive a convex relaxation of this approximation model by constructing new decision variables which allows us to eliminate biconvex terms. Specifically, when the constraint function is affine in both the decision variable and the uncertainty, then the resulting approximation model is equivalent to a tractable mixed-integer convex reformulation for joint binary DRCCP. Numerical results illustrate the computational effectiveness and superiority of the proposed formulations.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguityMathematical Programming, 2021
- On distributionally robust chance constrained programs with Wasserstein distanceMathematical Programming, 2019
- Optimized Bonferroni approximations of distributionally robust joint chance constraintsMathematical Programming, 2019
- Quantitative stability analysis for minimax distributionally robust risk optimizationMathematical Programming, 2018
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulationsMathematical Programming, 2017
- Data-driven chance constrained stochastic programMathematical Programming, 2015
- A distributionally robust perspective on uncertainty quantification and chance constrained programmingMathematical Programming, 2015
- Distributionally robust joint chance constraints with second-order moment informationMathematical Programming, 2011
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedraMathematical Programming, 2002
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problemsMathematical Programming, 1976