Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse

Operations Research

Volumn 58, Issue 1, 2010, Pages 229-243

  Ntaimo, Lewis ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

Disjunctive programming; Integer programming; Stochastic programming

Indexed keywords

BINARY PROGRAMS; COMPUTATIONAL RESULTS; CUTTING PLANES; DISJUNCTIVE DECOMPOSITION; DISJUNCTIVE PROGRAMMING; INTEGER PROGRAM; MATRIX; RANDOM RECOURSE; RIGHT-HAND SIDES; STOCHASTIC SERVER LOCATION; SUB-PROBLEMS; TEMPORAL DECOMPOSITION; TWO STAGE; VALID INEQUALITY;

DYNAMIC PROGRAMMING; INTERNET PROTOCOLS; OPERATIONS RESEARCH; STOCHASTIC PROGRAMMING; STOCHASTIC SYSTEMS;

INTEGER PROGRAMMING;

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

References (49)

1. Ahmed, S., R. Garcia. 2003. Dynamic capacity acquisition and assignment under uncertainty. Ann. Oper. Res. 124 267-283.
2. Ahmed, S., M. Tawarmalani, N. V. Sahinidis. 2004. A finite branch and bound algorithm for two-stage stochastic integer programs. Math. Programming 100 355-377.
3. Alonso-Ayuso, A., L. F. Escudero, M. T. Ortuno, C. Pizarro. 2007. On a stochastic sequencing and scheduling problem. Comput. Oper. Res. 24 2604-2624.
4. Balas, E. 1975. Disjunctive programming: Cutting planes from logical conditions. O. L. Mangasarian, R. R. Meyer, S. M. Robinson, eds. Nonlinear Programming 2. Academic Press, New York, 279-312.
5. Balas, E. 1979. Disjunctive programming. Ann. Discrete Math. 5 3-51.
6. Balas, E., E. S. Ceria, G. Cornuéjols. 1993. A lift-and-project cutting plane algorithm for mixed 0-1 integer programs. Math. Programming 58 295-324.
7. Balas, E., E. S. Ceria, G. Cornuéjols. 1996. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Sci. 42 1229-1246.
8. Benders, J. F. 1962. Partitioning procedures for solving mixed-variable programming problems. Numerische Mathematik 4 238-252.
9. Birge, J. R., F. V. Louveaux. 1997. Introduction to Stochastic Programming. Springer, New York.
10. Blair, C., R. Jeroslow. 1978. A converse for disjunctive constraints. J. Optim. Theory Appl. 25 195-206.
11. Blair, C., R. Jeroslow. 1982. The value function of an integer program. Math. Programming 23 237-273.
12. Carøe, C. C. 1998. Decomposition in stochastic integer programming. Ph.D. thesis, Department of Operations Research, University of Copenhagen, Denmark.
13. Carøe, C. C., J. Tind. 1997. A cutting-plane approach to mixed 0-1 stochastic integer programs. Eur. J. Oper. Res. 101 306-316.
14. Donovan, G. H., D. B. Rideout. 2003. An integer programming model to optimize resource allocation for wildfire containment. Forest Sci. 49(2) 331-335.
15. ILOG, Inc. 2003. CPLEX 9.0 Reference Manual. ILOG CPLEX Division.
16. Klein Haneveld, W. K., M. H. van der Vlerk. 1999. Stochastic integer programming: General models and algorithms. Ann. Oper. Res. 85 39-57.
17. Laporte, G., F. V. Louveaux. 1993. The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 1 133-142.
18. Lee, W. J. 2006. A stochastic mixed integer programming approach to wildfire management systems. M.S. thesis, Department of Industrial and Systems Engineering, Texas A and M University, College Station.
19. Linderoth, J., S. Wright. 2003. Decomposition algorithms for stochastic programming on a computational grid. Comput. Optim. Appl. 24 207-250.
20. Louveaux, F. V., R. Schultz. 2003. Stochastic integer programming. A. Ruszczynski, A. Shapiro, eds. Stochastic Programming, Handbooks in Operations Research and Management Science, Vol.10, Chapter 6. Elsevier, Amsterdam, 213-266.
21. NIFC. 2006. Wildland fire statistics. National Interagency Fire Center. http://www.nifc.gov/stats/wildlandfirestats.html.
22. Ntaimo, L. 2004. Decomposition algorithms for stochastic combinatorial optimization: Computational experiments and extensions. Ph.D. thesis, Department of Systems and Industrial Engineering, University of Arizona, Tucson.
23. Ntaimo, L., S. Sen. 2005. The million-variable "march" for stochastic combinatorial optimization. J. Global Optim. 32(3) 385-400.
24. Ntaimo, L., S. Sen. 2008. A comparative study of decomposition algorithms for stochastic combinatorial optimization. Comput. Optim. Appl. J. 40(3) 299-319.
25. Riis, M., A. J. V. Skriver, J. Lodahl. 2004. Deployment of mobile switching centers in a telecommunications network: A stochastic programming approach. Telecomm. Systems 26 93-109.
26. Ruszczynski, A., A. Shapiro, eds. 2003. Stochastic Programming, Handbooks in Operations Research and Management Science, Vol.10. Elsevier, Amsterdam.
27. Schultz, R. 1993. Continuity properties of expectation functions in stochastic integer programming. Math. Oper. Res. 18 578-589.
28. Schultz, R. 2003. Stochastic programming with integer variables. Math. Programming 97 285-309.
29. Schultz, R., L. Stougie, M. H. van der Vlerk. 1996. Two-stage stochastic integer programming: A survey. Statistica Neerlandica 50 404-416.
30. Sen, S. 2005. Algorithms for stochastic mixed-integer programming models. K. Aardal, G. Nemhauser, R. Weismantel, eds. Discrete Optimization, Chapter 9. Handbooks in Operations Research and Management Science, Vol.12. Elsevier, Dordrecht, The Netherlands, 515-558.
31. 2 algorithm for large scale stochastic mixed-integer programming: Set convexification. Math. Programming 104(1) 1-20.
32. Sen, S., H. D. Sherali. 1987. Nondifferentiable reverse convex programs and facetial cuts via a disjunctive characterization. Math. Programming 37 169-183.
33. Sen, S., H. D. Sherali. 2006. Decomposition with branch-and-cut approaches for two stage stochastic mixed-integer programming. Math. Programming 106(2) 203-223.
34. Sen, S., J. L. Higle, L. Ntaimo. 2002. A summary and illustration of disjunctive decomposition with set convexification. D. L. Woodruff, ed. Stochastic Integer Programming and Network Interdiction Models, Chapter 6. Kluwer Academic Press, Dordrecht, The Netherlands, 105-123.
35. Sherali, H. D., W. P. Adams. 1999. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishing, Boston.
36. Sherali, H. D., C. M. Shetty. 1980. Optimization with disjunctive constraints. Lecture Notes in Economics and Mathematical Systems, Vol.181. Springer-Verlag, Berlin, 411-430.
37. Sherali, H. D., X. Zhu. 2006. On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables. Math. Programming 108(2-3) 597-616.
38. Van Slyke, R., R. J.-B. Wets. 1969. L-shaped linear programs with application to optimal control and stochastic programming. SIAM J. Appl. Math. 17 638-663.
39. Wang, Q., E. Batta, C. M. Rump. 2003. Facility location models for immobile servers with stochastic demand. Naval Res. Logist. 51 137-152.
40. Bollapragada, S., T. E. Morton. 1999. Myopic heuristics for the random yield problem. Oper. Res. 47(5) 713-722.
41. Ehrhardt, R., L. Taube. 1987. An inventory model with random replenishment quantities. Internat. J. Production Res. 25 1795-1803.
42. Glasserman, P., S. Tayur. 1995. Sensitivity analysis for base-stock levels in multiechelon production-inventory systems. Management Sci. 41(2) 263-281.
43. Henig, M., Y. Gerchak. 1990. The structure of periodic review policies in the presence of random yield. Oper. Res. 38(4) 634-643.
44. Henig, M., N. Levin. 1992. Joint production planning and product delivery commitment with random yield. Oper. Res. 40(2) 404-408.
45. Inderfurth, K., S. Transchel. 2007. Note on "Myopic heuristics for the random yield problem." Oper. Res. 55(6) 1183-1186.
46. Janakiraman, G., R. O. Roundy. 2004. Lost-sales problems with stochastic lead times: Convexity results for base-stock policies. Oper. Res. 52(5) 795-803.
47. Li, Q., H. Xu, S. Zheng. 2006. Periodic review inventory systems with random yield: Bounds and heuristics. Working paper, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong.
48. Yano, C. A., H. L. Lee. 1995. Lot sizing with random yields: A review. Oper. Res. 43(2) 311-334.
49. Zipkin, P. H. 2000. Foundations of Inventory Management. McGraw-Hill, New York.