On approximations of data-driven chance constrained programs over Wasserstein balls
From MaRDI portal
Abstract: Distributionally robust chance constrained programs minimize a deterministic cost function subject to the satisfaction of one or more safety conditions with high probability, given that the probability distribution of the uncertain problem parameters affecting the safety condition(s) is only known to belong to some ambiguity set. We study three popular approximation schemes for distributionally robust chance constrained programs over Wasserstein balls, where the ambiguity set contains all probability distributions within a certain Wasserstein distance to a reference distribution. The first approximation replaces the chance constraint with a bound on the conditional value-at-risk, the second approximation decouples different safety conditions via Bonferroni's inequality, and the third approximation restricts the expected violation of the safety condition(s) so that the chance constraint is satisfied. We show that the conditional value-at-risk approximation can be characterized as a tight convex approximation, which complements earlier findings on classical (non-robust) chance constraints, and we offer a novel interpretation in terms of transportation savings. We also show that the three approximations can perform arbitrarily poorly in data-driven settings, and that they are generally incomparable with each other.
Recommendations
- On distributionally robust chance constrained programs with Wasserstein distance
- Technical Note—Data-Driven Chance Constrained Programs over Wasserstein Balls
- Distributionally robust joint chance-constrained programming with Wasserstein metric
- Data-driven distributionally robust chance-constrained optimization with Wasserstein metric
- Wasserstein distributionally robust chance-constrained program with moment information
Cites work
- A Robust Optimization Perspective on Stochastic Programming
- A distributionally robust perspective on uncertainty quantification and chance constrained programming
- ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs
- Adversarial classification via distributional robustness with Wasserstein ambiguity
- Bicriteria approximation of chance-constrained covering problems
- Chance-constrained set covering with Wasserstein ambiguity
- Data-driven distributionally robust chance-constrained optimization with Wasserstein metric
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Distributionally robust chance constraints for non-linear uncertainties
- Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity
- Distributionally robust joint chance constraints with second-order moment information
- Energy and reserve dispatch with distributionally robust joint chance constraints
- From CVaR to uncertainty set: implications in joint chance-constrained optimization
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- On distributionally robust chance constrained programs with Wasserstein distance
- On safe tractable approximations of chance constraints
- Optimized Bonferroni approximations of distributionally robust joint chance constraints
- Robust Wasserstein profile inference and applications to machine learning
Cited in
(12)- Integer programming approaches for distributionally robust chance constraints with adjustable risks
- Distributionally robust joint chance-constrained programming: Wasserstein metric and second-order moment constraints
- Distributionally robust chance constraints for non-linear uncertainties
- Distributionally Favorable Optimization: A Framework for Data-Driven Decision-Making with Endogenous Outliers
- Data-driven distributionally robust chance-constrained optimization with Wasserstein metric
- Technical Note—Data-Driven Chance Constrained Programs over Wasserstein Balls
- On distributionally robust generalized Nash games defined over the Wasserstein ball
- Moment-based distributionally robust joint chance constrained optimization for service network design under demand uncertainty
- Robust approaches in portfolio optimization with stochastic dominance constraints
- Distributionally robust optimization for sequential decision-making
- Emergency medical service location problem based on physical bounds using chance-constrained programming approach
- ALSO-X \#: better convex approximations for distributionally robust chance constrained programs
This page was built for publication: On approximations of data-driven chance constrained programs over Wasserstein balls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106524)
