Data-Driven Chance Constrained Programs over Wasserstein Balls

Abstract

We provide an exact deterministic reformulation for data-driven chance constrained programs over Wasserstein balls. For individual chance constraints as well as joint chance constraints with right-hand side uncertainty, our reformulation amounts to a mixed-integer conic program. In the special case of a Wasserstein ball with the $1$-norm or the $\infty$-norm, the cone is the nonnegative orthant, and the chance constrained program can be reformulated as a mixed-integer linear program. Our reformulation compares favourably to several state-of-the-art data-driven optimization schemes in our numerical experiments.

arXiv comment25 pages, 9 figures

Cited by in corpus (4)

• Optimization under Uncertainty in the Era of Big Data and Deep Learning: When Machine Learning Meets Mathematical Programming
• Distributionally Robust Optimization: A Review
• Sample Out-Of-Sample Inference Based on Wasserstein Distance
• Sensitivity analysis of Wasserstein distributionally robust optimization problems