Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity

  title={Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity},
  author={Nam Ho-Nguyen and F. Kılınç-Karzan and Simge K{\"u}ç{\"u}kyavuz and Dabeen Lee},
  journal={arXiv: Optimization and Control},
We consider exact deterministic mixed-integer programming (MIP) reformulations of distributionally robust chance-constrained programs (DR-CCP) with random right-hand sides over Wasserstein ambiguity sets. The existing MIP formulations are known to have weak continuous relaxation bounds, and, consequently, for hard instances with small radius, or with a large number of scenarios, the branch-and-bound based solution processes suffer from large optimality gaps even after hours of computation time… Expand

Tables from this paper

Chance-Constrained Set Covering with Wasserstein Ambiguity
We study a generalized distributionally robust chance-constrained set covering problem (DRC) with a Wasserstein ambiguity set, where both decisions and uncertainty are binary-valued. We establish theExpand
Consistency of Distributionally Robust Risk- and Chance-Constrained Optimization Under Wasserstein Ambiguity Sets
If the samples are drawn independently from an underlying distribution and the problems satisfy suitable technical assumptions, then the optimal value and optimizers of the distributionally robust versions of these problems converge to the respective quantities of the original problems, as the sample size increases. Expand
Chance-Constrained Optimization: A Review of Mixed-Integer Conic Formulations and Applications
Chance-constrained programming (CCP) is one of the most difficult classes of optimization problems that has attracted the attention of researchers since the 1950s. In this survey, we first reviewExpand
Building Load Control using Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty and the Risk-Adjustable Variants
Aggregation of heating, ventilation, and air conditioning (HVAC) loads can provide reserves to absorb volatile renewable energy, especially solar photo-voltaic (PV) generation. However, theExpand
Vessel Deployment with Limited Information: Distributionally Robust Chance Constrained Models
This paper studies the fundamental vessel deployment problem in the liner shipping industry, which decides the numbers of mixed-type ships and their sailing frequencies on fixed routes to provideExpand
Distributionally Robust Chance-Constrained Building Load Control under Uncertain Renewables
Aggregation of heating, ventilation, and air conditioning (HVAC) loads can provide reserves to absorb volatile renewable energy, especially solar photo-voltaic (PV) generation. However, theExpand
Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications
Fatma Kılınç-Karzan Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA 15213, USA, fkilinc@andrew.cmu.edu Simge Küçükyavuz Department of Industrial Engineering and ManagementExpand
Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty under Wasserstein Ambiguity
This work exploits the connection between nominal chance-constrained programs and DR-CCP to obtain strong formulations with significant enhancements, and proposes an exponential class of inequalities that can be separated efficiently within a branch-and-cut framework. Expand
Distributionally Robust Chance-Constrained Programmings for Non-Linear Uncertainties with Wasserstein Distance
In this paper, we study a distributionally robust chance-constrained programming (DRCCP) under Wasserstein ambiguity set, where the uncertain constraints require to be jointly satisfied with aExpand
Distributional Robust Batch Contextual Bandits
This paper proposes a novel learning algorithm that is able to learn a robust policy to adversarial perturbations and unknown covariate shifts and gives a performance guarantee based on the theory of uniform convergence. Expand


Data-Driven Distributionally Robust Chance-Constrained Optimization With Wasserstein Metric
We study distributionally robust chance-constrained programming (DRCCP) optimization problems with data-driven Wasserstein ambiguity sets. The proposed algorithmic and reformulation framework appliesExpand
On distributionally robust chance constrained programs with Wasserstein distance
  • Weijun Xie
  • Computer Science, Mathematics
  • Math. Program.
  • 2021
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. Expand
Data-Driven Chance Constrained Optimization under Wasserstein Ambiguity Sets
This work reformulates DRCCPs under data-driven Wasserstein ambiguity sets and a general class of constraint functions and presents a convex reformulation of the program and shows its tractability when the constraint function is affine in both the decision variable and the uncertainty. Expand
Data-Driven Chance Constrained Programs over Wasserstein Balls
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 withExpand
Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
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. Expand
A polyhedral study on chance constrained program with random right-hand side
This study considers a CCP problem with stochastic right-hand side under a finite discrete distribution, and presents a family of strong inequalities that subsumes known facet-defining ones for that single mixing set, and designs an efficient separation heuristic for implementation. Expand
On intersection of two mixing sets with applications to joint chance-constrained programs
This paper proposes a new class of valid inequalities in addition to the mixing inequalities, and establishes conditions under which these inequalities are facet defining, and proves that these new valid inequalities along with the classical mixing inequalities are sufficient in terms of providing the closed convex hull description of the set. Expand
Data-driven chance constrained stochastic program
This paper derives an equivalent reformulation for DCC and shows that it is equivalent to a classical chance constraint with a perturbed risk level, and analyzes the relationship between the conservatism of D CC and the size of historical data, which can help indicate the value of data. Expand
On quantile cuts and their closure for chance constrained optimization problems
It is shown that separation of quantile cuts is in general NP-hard, developed a heuristic separation method, and demonstrated its effectiveness through a computational study. Expand
On the mixing set with a knapsack constraint
We study a substructure appearing in mixed-integer programming reformulations of chance-constrained programs with stochastic right-hand-sides over a finite discrete distribution, which we call theExpand