Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
From MaRDI portal
Abstract: 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 matrix is available, and we solve distributionally robust chance-constrained binary programs (DCBP). Using two different ambiguity sets, we equivalently reformulate the DCBPs as 0-1 second-order cone (SOC) programs. We further exploit the submodularity of 0-1 SOC constraints under special and general covariance matrices, and utilize the submodularity as well as lifting to derive extended polymatroid inequalities to strengthen the 0-1 SOC formulations. We incorporate the valid inequalities in a branch-and-cut algorithm for efficiently solving DCBPs. We demonstrate the computational efficacy and solution performance using diverse instances of a chance-constrained bin packing problem.
Recommendations
- Ambiguous chance constrained problems and robust optimization
- On the Bayesability of chance-constrained programming problems
- Convex Approximations of Chance Constrained Programs
- Robust optimization with ambiguous stochastic constraints under mean and dispersion information
- On information-augmented chance-constrained programs
- Uncertain convex programs: randomized solutions and confidence levels
- Estimated stochastic programs with chance constraints
- An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information
- Approximations for chance-constrained programming problems
- scientific article; zbMATH DE number 1328978
Cites work
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
- An analysis of approximations for maximizing submodular set functions—I
- An integer programming approach for linear programs with probabilistic constraints
- Chance-Constrained Binary Packing Problems
- Data-driven chance constrained stochastic program
- Decomposition algorithms for two-stage chance-constrained programs
- Distributionally Robust Convex Optimization
- Distributionally robust joint chance constraints with second-order moment information
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Distributionally robust stochastic knapsack problem
- From CVaR to uncertainty set: implications in joint chance-constrained optimization
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Models for minimax stochastic linear optimization problems with risk aversion
- Network design with probabilistic capacities
- On distributionally robust chance-constrained linear programs
- On mixing sets arising in chance-constrained programming
- Optimal allocation of surgery blocks to operating rooms under uncertainty
- Polymatroids and mean-risk minimization in discrete optimization
- Robust Mean-Covariance Solutions for Stochastic Optimization
- Sample average approximation method for chance constrained programming: Theory and applications
- Stochastic 0-1 linear programming under limited distributional information
- Supermodular covering knapsack polytope
- The logic of logistics. Theory, algorithms, and applications for logistics management
- The submodular knapsack polytope
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
Cited in
(32)- Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems
- An exact cutting plane method for k-submodular function maximization
- Distributionally robust optimization. A review on theory and applications
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
- Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets
- Robustness of stochastic programs with endogenous randomness via contamination
- Resource distribution under spatiotemporal uncertainty of disease spread: stochastic versus robust approaches
- Optimized Bonferroni approximations of distributionally robust joint chance constraints
- Frameworks and results in distributionally robust optimization
- On distributionally robust chance constrained programs with Wasserstein distance
- Ambiguous chance constrained problems and robust optimization
- Tractable reformulations of two-stage distributionally robust linear programs over the type-\(\infty\) Wasserstein ball
- Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities
- Distributionally robust chance constraint with unimodality-skewness information and conic reformulation
- Chance-constrained set covering with Wasserstein ambiguity
- Distributionally robust multi-period portfolio selection subject to bankruptcy constraints
- Branch and Price for Chance-Constrained Bin Packing
- Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
- Chance constrained \(0-1\) quadratic programs using copulas
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
- Building load control using distributionally robust chance-constrained programs with right-hand side uncertainty and the risk-adjustable variants
- Target-Oriented Distributionally Robust Optimization and Its Applications to Surgery Allocation
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Robust optimization for spread quality and shortfall in guaranteed targeted display advertising planning
- Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem
- Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- Moment-based distributionally robust joint chance constrained optimization for service network design under demand uncertainty
- Distributionally robust optimization
- A nonparametric robust optimization approach for chance-constrained knapsack problem
- Risk-averse two-stage distributionally robust mixed-integer optimization with decision-dependent ambiguity sets
This page was built for publication: Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4687246)
