Decomposition algorithms for two-stage chance-constrained programs
From MaRDI portal
Publication:291060
DOI10.1007/s10107-014-0832-7zbMath1338.90284OpenAlexW2056940756MaRDI QIDQ291060
Simge Küçükyavuz, Xiao Liu, James R. Luedtke
Publication date: 6 June 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-014-0832-7
Related Items (36)
Implementing Automatic Benders Decomposition in a Modern MIP Solver ⋮ A discussion of probability functions and constraints from a variational perspective ⋮ Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints ⋮ Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support ⋮ Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty ⋮ Relaxations and approximations of chance constraints under finite distributions ⋮ On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints ⋮ General Feasibility Bounds for Sample Average Approximation via Vapnik--Chervonenkis Dimension ⋮ Derivatives of probability functions: unions of polyhedra and 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 ⋮ 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 ⋮ Distributionally Favorable Optimization: A Framework for Data-Driven Decision-Making with Endogenous Outliers ⋮ A polyhedral study of the static probabilistic lot-sizing problem ⋮ Probabilistic Partial Set Covering with an Oracle for Chance Constraints ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ An efficient computational method for large scale surgery scheduling problems with chance constraints ⋮ 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 ⋮ Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information ⋮ Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system ⋮ Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem ⋮ Branch and Price for Chance-Constrained Bin Packing ⋮ Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints ⋮ Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services ⋮ 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 ⋮ Dynamic probabilistic constraints under continuous random distributions ⋮ 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
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- 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
- A multicut algorithm for two-stage stochastic linear programs
- Partitioning procedures for solving mixed-variables programming problems
- Relaxations for probabilistically constrained programs with discrete random variables
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- On robust optimization of two-stage systems
- Risk-averse two-stage stochastic programming with an application to disaster management
- Uncertain convex programs: randomized solutions and confidence levels
- On mixing sets arising in chance-constrained programming
- Chance-Constrained Binary Packing Problems
- Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition
- Constructing Uncertainty Sets for Robust Linear Optimization
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- The Probabilistic Set-Covering Problem
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Contributions to the theory of stochastic programming
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- The Scenario Approach to Robust Control Design
- Chance Constrained Programming with Joint Constraints
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
- Concavity and efficient points of discrete distributions in probabilistic programming.
This page was built for publication: Decomposition algorithms for two-stage chance-constrained programs
