Cutting planes for multistage stochastic integer programs

Operations Research

Volumn 57, Issue 2, 2009, Pages 287-298

  Guan, Yongpei ^a   Ahmed, Shabbir ^b   Nemhauser, George L ^b  

^a University of Oklahoma   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; CUTTING PLANES; GENERAL METHODS; INTEGER PROGRAMS; KNAPSACK PROBLEMS; STOCHASTIC LOT SIZINGS;

RANDOM PROCESSES;

INTEGER PROGRAMMING;

EID: 65349170163     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1080.0535     Document Type: Article

References (19)

1. Ahmed, S., A. J. King, G. Parija. 2003. A multi-stage stochastic integer programming approach for capacity expansion under uncertainty. J. Global Optim. 26 3-24.
2. Barany, I., T. van Roy, L. A. Wolsey. 1984. Uncapacitated lot-sizing: The convex hull of solutions. Math. Programming Stud. 22 32-43.
3. Carøe, C. C, R. Schultz. 1999. Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24 37-45.
4. Cook, W., R. Kannan, A. J. Schrijver. 1990. Chvátal closures for mixed integer programming problems. Math. Programming 47 155-174.
5. Di Summa, M., L. A. Wolsey. 2008. Lot-sizing on a tree. Oper. Res. Lett. 36(1) 7-13.
6. Guan, Y. 2005. Pairing inequalities and stochastic lot-sizing problems: A study in integer programming. Ph.D. thesis, Georgia Institute of Technology, Atlanta.
7. Guan, Y, S. Ahmed, G. L. Nemhauser. 2007. Sequential pairing of mixed integer inequalities. Discrete Optim. 4 21-39.
8. Guan, Y., S. Ahmed, G. L. Nemhauser, A. J. Miller. 2006. A branch- and-cut algorithm for the stochastic uncapacitated lot-sizing problem. Math. Programming 105 55-84.
9. Günliik, O., Y. Pochet. 2001. Mixing MIR inequalities for mixed integer programs. Math. Programming 90 429-457.
10. Loparic, M., H. Marchand, L. A. Wolsey. 2003. Dynamic knapsack sets and capacitated lot-sizing. Math. Programming 95 53-69.
11. Lulli, G., S. Sen. 2004. A branch and price algoridim for multi-stage stochastic integer programming with application to stochastic batch- sizing problems. Management Sci. 50 786-796.
12. Miller, A. J., L. A. Wolsey. 2003. Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Programming 78 73-88.
13. Nemhauser. G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley, New York.
14. Nemhauser. G. L., L. A. Wolsey. 1990. A recursive procedure for generating all cuts for 0-1 mixed integer programs. Math. Programming 46 379-390.
15. Nowak, M. P., W. Römisch. 2000. Stochastic Lagrangian relaxation applied to power scheduling in a hydro-thermal system under uncertainty. Ann. Oper. Res. 100 251-272.
16. Romisch, W., R. Schultz. 2001. Multistage stochastic integer programs: An introduction. M. Grötschel, S. O. Kramke, J. Rambau, eds. Online Optimization of Large Scale Systems. Springer-Verlag, Berlin- Dahlem, 579-598.
17. Sen, S. 2005. Algorithms for stochastic mixed-integer programming models. K. Aardal, G. L. Nemhauser, R. Weismantel, eds. Handbook of Discrete Optimization. North-Holland Publishing Co., Amsterdam, 515-558.
18. Singh, K., A. B. Philpott, K. Wood. 2008. Dantzig-Wolfe decomposition for solving multi-stage stochastic capacity planning problems. Under review.
19. Takriti, S., J. R. Birge, E. Long. 1996. A stochastic model for the unit commitment problem. IEEE Trans. Power Systems 11 1497-1508.