On quantile cuts and their closure for chance constrained optimization problems
From MaRDI portal
Publication:1801023
DOI10.1007/s10107-017-1190-zzbMath1412.90096OpenAlexW2754581688MaRDI QIDQ1801023
Publication date: 26 October 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1190-z
Related Items (12)
Solving joint chance constrained problems using regularization and Benders' decomposition ⋮ ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs ⋮ Relaxations and approximations of chance constraints under finite distributions ⋮ Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning ⋮ Value at risk approach to producer's best response in an electricity market with uncertain demand ⋮ 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 ⋮ Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory ⋮ Quantile-based optimal portfolio selection ⋮ Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens ⋮ Special issue: Global solution of integer, stochastic and nonconvex optimization problems ⋮ Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity
Cites Work
- Unnamed Item
- On the mixing set with a knapsack constraint
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- An integer programming approach for linear programs with probabilistic constraints
- A polyhedral study on chance constrained program with random right-hand side
- Convex programming for disjunctive convex optimization
- Asymptotic analysis of sample average approximation for stochastic optimization problems with joint chance constraints via conditional value at risk and difference of convex functions
- On mixing sets arising in chance-constrained programming
- Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization
- Chance-Constrained Binary Packing Problems
- Covering Linear Programming with Violations
- Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
- On the Convergence of Sequences of Convex Sets in Finite Dimensions
- On the existence of optimal solutions to integer and mixed-integer programming problems
- The mixed vertex packing problem.
- Mixing mixed-integer inequalities
This page was built for publication: On quantile cuts and their closure for chance constrained optimization problems
