On mixing sets arising in chance-constrained programming

Mathematical Programming

Volumn 132, Issue 1-2, 2012, Pages 31-56

  Küçükyavuz, Simge ^a  

^a The Ohio State University   (United States)

Author keywords

Chance constraints; Compact extended formulations; Computation; Facets; Lot sizing; Mixed integer programming

Indexed keywords

CHANCE CONSTRAINT; EXTENDED FORMULATIONS; FACETS; LOT SIZING; MIXED-INTEGER PROGRAMMING;

BLENDING; CALCULATIONS; COMPUTER PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING;

COMBINATORIAL OPTIMIZATION;

EID: 84858439351     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0385-3     Document Type: Article

References (25)

1. A. Atamtürk 2006 Strong formulations of robust mixed 0-1 programming Math. Program. 108 235 250 2238701 1136.93331 10.1007/s10107-006-0709-5 (Pubitemid 43999759)
2. A. Atamtürk G.L. Nemhauser M.W.P. Savelsbergh 2000 The mixed vertex packing problem Math. Program. 89 35 53 1795056 1033.90095
3. E. Balas 1998 Disjunctive programming: properties of the convex hull of feasible points Discrete Appl. Math. 89 1 44 10.1016/S0166-218X(98)00096-1
4. P. Beraldi A. Ruszczyński 2002 A branch and bound method for stochastic integer programs under probabilistic constraints Optim. Methods Softw. 17 359 382 1944287 1064.90030 10.1080/1055678021000033937 (Pubitemid 35242089)
5. P. Beraldi A. Ruszczyński 2002 The probabilistic set covering problem Oper. Res. 50 956 967 1946782 1163.90655 10.1287/opre.50.6.956.345
6. A. Charnes W. Cooper G.Y. Symonds 1958 Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil Manage. Sci. 4 235 263 10.1287/mnsc.4.3.235
7. M. Conforti M. di Summa L.A. Wolsey 2007 The mixing set with flows SIAM J. Discrete Math. 21 2 396 407 2318674 1171.90477 10.1137/05064148X
8. M. Conforti L.A. Wolsey 2008 Compact formulations as union of polyhedra Math. Program. 114 277 289 2393043 1145.90044 10.1007/s10107-007-0101-0 (Pubitemid 351530905)
9. G. Cornuéjols 2008 Valid inequalities for mixed integer linear programs Math. Program. 112 3 44 2327000 05189151 10.1007/s10107-006-0086-0 (Pubitemid 47167323)
10. D. Dentcheva A. Prékopa A. Ruszczyński 2000 Concavity and efficient points of discrete distributions in probabilistic programming Math. Program. 89 55 77 1795057 1033.90078 10.1007/PL00011393
11. O. Günlük Y. Pochet 2001 Mixing mixed-integer inequalities Math. Program. 90 429 457 1832218 1041.90033 10.1007/PL00011430 (Pubitemid 33758916)
12. M.A. Lejeune A. Ruszczyński 2007 An efficient trajectory method for probabilistic inventory-production-distribution problems Oper. Res. 55 2 378 394 2316267 1167.90489 10.1287/opre.1060.0356 (Pubitemid 46663469)
13. J. Luedtke S. Ahmed 2008 A sample approximation approach for optimization with probabilistic constraints SIAM J. Optim. 19 2 674 699 2425035 1177.90301 10.1137/070702928
14. J. Luedtke S. Ahmed G. Nemhauser 2010 An integer programming approach for linear programs with probabilistic constraints Math. Program. 122 2 247 272 2546332 1184.90115 10.1007/s10107-008-0247-4
15. G. Lulli S. Sen 2004 Branch-and-price algorithm for multistage stochastic integer programming with application to stochastic batch-sizing problems Manage. Sci. 50 6 786 796 06007596 10.1287/mnsc.1030.0164
16. A.J. Miller L.A. Wolsey 2003 Tight formulations for some simple mixed integer programs and convex objective integer programs Math. Program. 98 73 88 2019368 1047.90035 10.1007/s10107-003-0397-3
17. B.L. Miller H.M. Wagner 1965 Chance constrained programming with joint constraints Oper. Res. 13 930 965 0132.40102 10.1287/opre.13.6.930
18. A. Prékopa 1973 Contributions to the theory of stochastic programming Math. Program. 4 202 221 0273.90045 10.1007/BF01584661
19. A. Prékopa 1990 Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution ZOR Methods Models Oper. Res. 34 441 461 0724.90048 10.1007/BF01421551
20. A. Ruszczyński 2002 Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra Math. Program. 93 195 215 1952650 1065.90058 10.1007/s10107-002-0337-7 (Pubitemid 44744743)
21. A. Saxena V. Goyal M.A. Lejeune 2010 MIP reformulations of the probabilistic set covering problem Math. Program. 121 1 1 31 2520405 1184.90116 10.1007/s10107-008-0224-y
22. S. Sen 1992 Relaxations for probabilistically constrained programs with discrete random variables Oper. Res. Lett. 11 81 86 1167427 0765.90071 10.1016/0167-6377(92)90037-4
23. M. van Vyve 2005 The continuous mixing polyhedron Math. Oper. Res. 30 2 441 452 2142042 1082.90075 10.1287/moor.1040.0130 (Pubitemid 43126841)
24. Wolsey L.A.: Integer programming. John Wiley and Sons, New York (1998)
25. M. Zhao I.R. de Farias Jr 2008 The mixing-MIR set with divisible capacities Math. Program. 115 1 73 103 2403754 1176.90433 10.1007/s10107-007- 0140-6 (Pubitemid 351702153)