Relaxations and approximations of chance constraints under finite distributions
From MaRDI portal
Publication:1650766
DOI10.1007/s10107-018-1295-zzbMath1391.90422OpenAlexW2803268961WikidataQ93616150 ScholiaQ93616150MaRDI QIDQ1650766
Publication date: 13 July 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-018-1295-z
Related Items (13)
Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements ⋮ ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs ⋮ Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs ⋮ Relaxation schemes for the joint linear chance constraint based on probability inequalities ⋮ Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning ⋮ Arc routing under uncertainty: introduction and literature review ⋮ 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 ⋮ On the Convexity of Level-sets of Probability Functions ⋮ Bounds for probabilistic programming with application to a blend planning problem ⋮ Chance-constrained sets approximation: a probabilistic scaling approach ⋮ Approximation algorithms for the covering-type \(k\)-violation linear program ⋮ Special issue: Global solution of integer, stochastic and nonconvex optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- 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 PTAS for the chance-constrained knapsack problem with random item sizes
- Sample average approximation method for chance constrained programming: Theory and applications
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- A polyhedral study on chance constrained program with random right-hand side
- Uncertain convex programs: randomized solutions and confidence levels
- On quantile cuts and their closure for chance constrained optimization problems
- On safe tractable approximations of chance constraints
- On mixing sets arising in chance-constrained programming
- Sequential pairing of mixed integer inequalities
- Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities
- Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty
- Chance-Constrained Binary Packing Problems
- Covering Linear Programming with Violations
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Lectures on Stochastic Programming
- Deterministic approximations of probability inequalities
- Numerical solution technique for joint chance-constrained programming problem —An application to electric power capacity expansion
- A branch and bound method for stochastic integer problems under probabilistic constraints
- The Scenario Approach to Robust Control Design
- Convex Bodies The Brunn-MinkowskiTheory
- Convex Approximations of Chance Constrained Programs
- The mixed vertex packing problem.
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Mixing mixed-integer inequalities
This page was built for publication: Relaxations and approximations of chance constraints under finite distributions
