Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information

  title={Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information},
  author={Yiling Zhang and Ruiwei Jiang and Siqian Shen},
  journal={SIAM J. Optim.},
We consider chance-constrained binary programs, where each row of the inequalities that involve uncertainty needs to be satisfied probabilistically. Only the information of the mean and covariance ... 

Figures and Tables from this paper

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.

Decision Rule Approaches for Pessimistic Bilevel Linear Programs under Moment Ambiguity with Facility Location Applications

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

Optimized Bonferroni approximations of distributionally robust joint chance constraints

This paper shows that an optimized version of Bonferroni approximation of a distributionally robust joint chance constraint is exact when the uncertainties are separable across the individual inequalities, i.e., each uncertain constraint involves a different set of uncertain parameters and corresponding distribution families.

On distributionally robust chance constrained programs with Wasserstein distance

  • Weijun Xie
  • Computer Science
    Mathematical Programming
  • 2019
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.

Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets

We study multistage distributionally robust mixed-integer programs under endogenous uncertainty, where the probability distribution of stage-wise uncertainty depends on the decisions made in previous

Robust solutions for stochastic and distributionally robust chance-constrained binary knapsack problems

It is demonstrated that optimal solutions to robust binary knapsack problems with inner and outer polyhedral approximations of the ellipsoidal uncertainty set can provide both upper and lower bounds on the optimal value of the second-order cone-constrained binaryknapsack problem, and it is proved that the solution providing the upper bound converges to the optimal solution.

Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens

This paper first revisits basic mixing sets by establishing a strong and previously unrecognized connection to submodularity, and shows that mixing inequalities with binary variables are nothing but the polymatroid inequalities associated with a specific submodular function.

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. In this paper, we

Tractable Reformulations of Distributionally Robust Two-stage Stochastic Programs with $\infty-$Wasserstein Distance

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.




The term probabilistic constrained programming means the same as chance constrained programming, i.e., optimization of a function subject to certain conditions where at least one is formulated so

On Distributionally Robust Chance-Constrained Linear Programs

It is shown that, for a wide class of probability distributions on the data, the probability constraints can be converted explicitly into convex second-order cone constraints; hence the probability-constrained linear program can be solved exactly with great efficiency.

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.

From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization

The approach builds on a classical worst-case bound for order statistics problems and is applicable even if the constraints are correlated, and provides an application of the model on a network resource allocation problem with uncertain demand.

Polymatroids and mean-risk minimization in discrete optimization

Decomposition algorithms for two-stage chance-constrained programs

Computational results on a chance-constrained resource planing problem indicate that the decomposition algorithms developed are highly effective in solving these problems compared to a mixed-integer programming reformulation and a naive decomposition method.

Chance-Constrained Binary Packing Problems

This work considers a class of packing problems with uncertain data, which it refers to as the chance-constrained binary packing problem, and proposes a problem formulation in its original space based on the so-called probabilistic covers.

Stochastic 0-1 linear programming under limited distributional information

On mixing sets arising in chance-constrained programming

A compact extended reformulation that characterizes a linear programming equivalent of a single chance constraint with equal scenario probabilities and a compact extended linear program for the intersection of multiple mixing sets and a cardinality constraint for a special case is given.

Distributionally robust joint chance constraints with second-order moment information

It is proved that this approximation is exact for robust individual chance constraints with concave or (not necessarily concave) quadratic constraint functions, and it is demonstrated that the Worst-Case CVaR can be computed efficiently for these classes of constraint functions.