Mixed integer linear programming formulations for probabilistic constraints
From MaRDI portal
Publication:439901
DOI10.1016/j.orl.2012.01.007zbMath1245.90066MaRDI QIDQ439901
Juan Pablo Vielma, Shabbir Ahmed, Nemhauser, George I.
Publication date: 17 August 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2012.01.007
Related Items
Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization, On intersection of two mixing sets with applications to joint chance-constrained programs, Incremental and encoding formulations for mixed integer programming, Mixed Integer Linear Programming Formulation Techniques
Uses Software
Cites Work
- Unnamed Item
- Dual methods for probabilistic optimization problems.
- MIP reformulations of the probabilistic set covering problem
- An integer programming approach for linear programs with probabilistic constraints
- A simplification for some disjunctive formulations
- On the convex hull of the union of certain polyhedra
- Using separation algorithms to generate mixed integer model reformulations
- Relaxations for probabilistically constrained programs with discrete random variables
- Disjunctive programming: Properties of the convex hull of feasible points
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Strong valid inequalities for fluence map optimization problem under dose-volume restrictions
- On convex probabilistic programming with discrete distributions.
- On mixing sets arising in chance-constrained programming
- Representation for multiple right-hand sides
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
- 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
- Lectures on Stochastic Programming
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Concavity and efficient points of discrete distributions in probabilistic programming.
