A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
From MaRDI portal
Publication:403644
DOI10.1007/s10107-013-0684-6zbMath1297.90092OpenAlexW2041977479MaRDI QIDQ403644
Publication date: 29 August 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-013-0684-6
Related Items
Solving joint chance constrained problems using regularization and Benders' decomposition ⋮ A discussion of probability functions and constraints from a variational perspective ⋮ On the mixing set with a knapsack constraint ⋮ Decomposition algorithms for two-stage chance-constrained programs ⋮ Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints ⋮ Scenario Min-Max Optimization and the Risk of Empirical Costs ⋮ Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support ⋮ Data-driven chance constrained stochastic program ⋮ On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs ⋮ On the Quantile Cut Closure of Chance-Constrained Problems ⋮ Relaxations and approximations of chance constraints under finite distributions ⋮ Vehicle routing with probabilistic capacity constraints ⋮ Probabilistic optimization via approximate \(p\)-efficient points and bundle methods ⋮ Chance-constrained stochastic programming under variable reliability levels with an application to humanitarian relief network design ⋮ A comparison of four approaches from stochastic programming for large-scale unit-commitment ⋮ Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning ⋮ An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems ⋮ General Feasibility Bounds for Sample Average Approximation via Vapnik--Chervonenkis Dimension ⋮ Chance-Constrained Binary Packing Problems ⋮ Covering Linear Programming with Violations ⋮ Derivatives of probability functions: unions of polyhedra and elliptical distributions ⋮ Eventual convexity of probability constraints with elliptical distributions ⋮ On intersection of two mixing sets with applications to joint chance-constrained programs ⋮ A polyhedral study on chance constrained program with random right-hand side ⋮ HARFE: hard-ridge random feature expansion ⋮ A conflict-directed approach to chance-constrained mixed logical linear programming ⋮ Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ A solution algorithm for chance-constrained problems with integer second-stage recourse decisions ⋮ Chance-constrained set covering with Wasserstein ambiguity ⋮ Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory ⋮ Distributionally Favorable Optimization: A Framework for Data-Driven Decision-Making with Endogenous Outliers ⋮ Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation ⋮ A polyhedral study of the static probabilistic lot-sizing problem ⋮ Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method ⋮ Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data ⋮ Probabilistic Partial Set Covering with an Oracle for Chance Constraints ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Optimization models of anti-terrorist protection ⋮ Scalable Algorithms for the Sparse Ridge Regression ⋮ A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints ⋮ Convergence conditions for the observed mean method in stochastic programming ⋮ An adaptive model with joint chance constraints for a hybrid wind-conventional generator system ⋮ Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs ⋮ Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems ⋮ On the chance-constrained minimum spanning \(k\)-core problem ⋮ Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information ⋮ On quantile cuts and their closure for chance constrained optimization problems ⋮ Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system ⋮ Branch and Price for Chance-Constrained Bin Packing ⋮ A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs ⋮ Risk-Averse Shortest Path Interdiction ⋮ Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints ⋮ Convergence analysis on a smoothing approach to joint chance constrained programs ⋮ Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services ⋮ Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs ⋮ A Multistage Stochastic Programming Approach to the Optimal Surveillance and Control of the Emerald Ash Borer in Cities ⋮ Approximating two-stage chance-constrained programs with classical probability bounds ⋮ Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens ⋮ Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity ⋮ On sample average approximation for two-stage stochastic programs without relatively complete recourse ⋮ Large-scale unit commitment under uncertainty ⋮ Generalized differentiation of probability functions: parameter dependent sets given by intersections of convex sets and complements of convex sets ⋮ Nonlinear chance-constrained problems with applications to hydro scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- MIP reformulations of the probabilistic set covering problem
- An integer programming approach for linear programs with probabilistic constraints
- Finding optimal vaccination strategies under parameter uncertainty using stochastic program\-ming
- On probabilistic constraints induced by rectangular sets and multivariate normal distributions
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- Representability in mixed integer programming. I: Characterization results
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Robust solutions of linear programming problems contaminated with uncertain data
- Uncertain convex programs: randomized solutions and confidence levels
- Branching rules revisited
- Regularization methods for optimization problems with probabilistic constraints
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- Stochastic programming models for air quality management
- On distributionally robust chance-constrained linear programs
- On mixing sets arising in chance-constrained programming
- On two-stage convex chance constrained problems
- Ambiguous chance constrained problems and robust optimization
- Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
- A Gradient Formula for Linear Chance Constraints Under Gaussian Distribution
- Covering Linear Programming with Violations
- Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
- Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach
- Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- The Probabilistic Set-Covering Problem
- The Price of Robustness
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Programming under probabilistic constraints with a random technology matrix
- Introduction to Stochastic Programming
- A Computational Study of Search Strategies for Mixed Integer Programming
- The Scenario Approach to Robust Control Design
- Convex Approximations of Chance Constrained Programs
- An Integer Programming Approach for Linear Programs with Probabilistic Constraints
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
- The mixed vertex packing problem.
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Mixing mixed-integer inequalities
