Mixed integer linear programming formulations for probabilistic constraints
From MaRDI portal
Recommendations
- An Integer Programming Approach for Linear Programs with Probabilistic Constraints
- An integer programming approach for linear programs with probabilistic constraints
- scientific article; zbMATH DE number 433035
- Threshold Boolean form for joint probabilistic constraints with random technology matrix
- On mixing sets arising in chance-constrained programming
Cites work
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A branch and bound method for stochastic integer problems under probabilistic constraints
- A simplification for some disjunctive formulations
- An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
- An integer programming and decomposition approach to general chance-constrained mathematical programs
- An integer programming approach for linear programs with probabilistic constraints
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Disjunctive programming: Properties of the convex hull of feasible points
- Dual methods for probabilistic optimization problems.
- Lectures on Stochastic Programming
- MIP reformulations of the probabilistic set covering problem
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- On convex probabilistic programming with discrete distributions.
- On mixing sets arising in chance-constrained programming
- On the convex hull of the union of certain polyhedra
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Relaxations for probabilistically constrained programs with discrete random variables
- Representation for multiple right-hand sides
- Strong valid inequalities for fluence map optimization problem under dose-volume restrictions
- The Probabilistic Set-Covering Problem
- Using separation algorithms to generate mixed integer model reformulations
Cited in
(14)- An integer programming approach for linear programs with probabilistic constraints
- A linear programming approach for linear programs with probabilistic constraints
- A conflict-directed approach to chance-constrained mixed logical linear programming
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
- Threshold Boolean form for joint probabilistic constraints with random technology matrix
- On intersection of two mixing sets with applications to joint chance-constrained programs
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems
- Incremental and encoding formulations for mixed integer programming
- On mixing sets arising in chance-constrained programming
- An Integer Programming Approach for Linear Programs with Probabilistic Constraints
- Mixed integer linear programming formulation techniques
- New reformulations for probabilistically constrained quadratic programs
- Problem-based optimal scenario generation and reduction in stochastic programming
This page was built for publication: Mixed integer linear programming formulations for probabilistic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439901)
