Dantzig-wolfe decomposition for solving multistage stochastic capacity-planning problems

Operations Research

Volumn 57, Issue 5, 2009, Pages 1271-1286

  Singh, Kavinesh J ^a   Philpott, Andy B ^b   Kevin Wood, R ^c  

^a Mighty River Power Limited   (New Zealand)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

^c NAVAL POSTGRADUATE SCHOOL   (United States)

Author keywords

Algorithms; Applications; Benders decomposition; Capacity expansion; Electric; Facilities equipment planning; Industries; Integer; Networks graphs; Programming; Stochastic

Indexed keywords

BENDERS DECOMPOSITION; CAPACITY EXPANSION; ELECTRIC; FACILITIES/EQUIPMENT PLANNING; INTEGER; NETWORKS/GRAPHS; PROGRAMMING; STOCHASTIC;

COMPUTATIONAL EFFICIENCY; DECISION TREES; DISTRIBUTED PARAMETER NETWORKS; DYNAMIC PROGRAMMING; ELECTRIC UTILITIES; INTEGER PROGRAMMING; LINEARIZATION; STAGES; STOCHASTIC MODELS;

PROBLEM SOLVING;

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

References (60)

1. Ahmed, S., N. V. Sahinidis. 2003. An approximation scheme for stochastic integer programs arising in capacity expansion. Oper. Res. 51 461-471.
2. 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.
3. Alonso-Ayuso, A., L. F. Escudero, M. T. Ortuño. 2003. BFC, a branchand-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs. Eur. J. Oper. Res. 151 503-519.
4. Appelgren, L. H. 1969. A column generation algorithm for a ship scheduling problem. Transportation Sci. 3 53-68.
5. Balas, E., S. Ceria, G. Cornúejols. 1996. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management. Sci. 42 1229-1246.
6. Barahona, F., S. Bermon, O. Gunluk, S. Hood. 2005. Robust capacity planning in semiconductor manufacturing. Naval Res. Logist. 52 459-468.
7. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46 316-329.
8. Berman, O., Z. Ganz, J. M. Wagner. 1994. A stochastic optimization model for planning capacity expansion in a service industry under uncertain demand. Naval Res. Logist. 41 545-564.
9. Bienstock, D., G. Muratore. 2000. Strong inequalities for capacitated survivable network design problems. Math. Programming 89 127-147.
10. Birge, J. R., F. Louveaux. 1997. Introduction to Stochastic Programming. Springer Series in Operations Research. Springer-Verlag, New York.
11. Bixby, R. E., J. W. Gregory, I. J. Lustig, R. E. Marsten, D. F. Shanno. 1992. Very large-scale linear programming: A case study in combining interior-point and simplex methods. Oper. Res. 40 885-897.
12. Carøe, C. C., R. Schultz. 1999. Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24 37-45.
13. Chen, Z., S. Li, D. Tirupati. 2002. A scenario-based stochastic programming approach for technology and capacity planning. Comput. Oper. Res. 29 781-806.
14. Damodaran, P., W. Wilhelm. 2004. Branch-and-price methods for prescribing profitable upgrades of high-technology products with stochastic demands. Decision Sci. 35 55-81.
15. Dantzig, G. B., P. Wolfe. 1960. Decomposition principle for linear programs. Oper. Res. 8 101-111.
16. Dentcheva, D., W. Römisch. 2004. Duality gaps in nonconvex stochastic optimization. Math. Programming 101 515-535.
17. Desrosiers, J., H. Ben Amor, F. Soumis, D. Villeneuve. 2002. Stabilized column generation. IMA Workshop- Computational Methods for Large Scale Integer Programs, University of Minnesota, Minneapolis, 14-19.
18. du Merle, O., D. Villeneuve, J. Desrosiers, P. Hansen. 1999. Stabilized column generation. Discrete Math. 194 229-237.
19. Eppen, G. D., R. K. Martin, L. Schrage. 1989. A scenario approach to capacity planning. Oper. Res. 37 517-527.
20. Erlenkotter, D. 1967. Optimal plant size with time-phased imports. A. S. Manne, ed. Investments for Capacity Expansion- Size, Location, and Time-Phasing. George Allen & Unwin, Ltd., London, 156-177.
21. Freidenfelds, J. 1980. Capacity expansion when demand is a birth-death random process. Oper. Res. 28 712-721.
22. Giglio, R. J. 1970. Stochastic capacity models. Management Sci. 17 174-184.
23. Gondzio, J., A. Grothey. 2003. Reoptimization with the primal-dual interior point method. SIAM J. Optim. 13 842-864.
24. Higle, J. L., S. Sen. 1996. Stochastic Decomposition- A Statistical Method for Large Scale Stochastic Linear Programming. Kluwer Academic Publishers, Dordrecht, The Netherlands.
25. Huang, K., S. Ahmed. 2005. The value of multi-stage stochastic programming in capacity planning under uncertainty. Stochastic Programming E-Print Series. http://dochost.rz.hu-berlin.de/speps.
26. Johnson, D. S., J. K. Lenstra, A. H. G. Rinnooy Kan. 1978. The complexity of the network design problem. Networks 8 279-285.
27. Krarup, J., O. Bilde. 1977. Plant location, set covering and economic lot size: An O-mn--algorithm for structured problems. Numerische Methoden bei Optimierungsaufgaben, Band 3 (Tagung, Oberwolfach, 1976), Vol. 36. Internat. Ser. Numer. Math. Birkhäuser, Basel, Switzerland, 155-180.
28. Laguna, M. 1998. Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty. Management Sci. 44 S101-S110.
29. Laporte, G., F. V. Louveaux. 1993. The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13 133-142.
30. Lasserre, J. B. 2001. Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11 796-817.
31. Lovasz, L., A. Schrijver. 1991. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1 166-190.
32. Lübbecke, M. E., J. Desrosiers. 2005. Selected topics in column generation. Oper. Res. 53 1007-1023.
33. Lulli, G., S. Sen. 2004. A branch-and-price algorithm for multistage stochastic integer programming with application to stochastic batchsizing problems. Management Sci. 50 786-796.
34. Luss, H. 1982. Operations research and capacity expansion problems: A survey. Oper. Res. 30 907-947.
35. Lustig, I. J., J. M. Mulvey, T. J. Carpenter. 1991. Formulating twostage stochastic programs for interior point methods. Oper. Res. 39 757-770.
36. Magnanti, T. L., S. Raghavan. 2005. Strong formulations for network design problems with connectivity requirements. Networks 45 61-79.
37. Magnanti, T. L., L. A. Wolsey. 1995. Design of survivable networks. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Models. Handbook in Operations Research and Management Science, Vol. 7. Elsevier Publishing Company, Amsterdam, 503-616.
38. Manne, A. S. 1961. Capacity expansion and probabilistic growth. Econometrica 29 632-649.
39. Manne, A. S. 1967. Two producing areas constant cycle time policies. A. S. Manne, ed. Investments for Capacity Expansion- Size, Location, and Time-Phasing. George Allen & Unwin, Ltd., London, 193-209.
40. Marsten, R. E. 1975. The use of the boxstep method in discrete optimization. Math. Programming Study 3 127-144.
41. Masse, P., R. Gibrat. 1957. Application of linear programming to investments in the electric power industry. Management Sci. 3 149-166.
42. Mulvey, J., A. Ruszczyński. 1995. A new scenario decomposition method for large-scale stochastic optimization. Oper. Res. 43 477-490.
43. Padberg, M. W. 1974. Perfect zero-one matrices. Math. Programming 6 180-196.
44. Rajagopalan, S., M. R. Singh, T. E. Morton. 1998. Capacity expansion and replacement in growing markets with uncertain technological breakthroughs. Management Sci. 44 12-30.
45. Riis, M., K. A. Andersen. 2002. Capacitated network design with uncertain demand. INFORMS J. Comput. 14 247-260.
46. Riis, M., K. A. Andersen. 2004. Multiperiod capacity expansion of a telecommunications connection with uncertain demand. Comput. Oper. Res. 31 1427-1436.
47. Riis, M., J. Lodahl. 2002. A bicriteria stochastic programming model for capacity expansion in telecommunications. Math. Methods Oper. Res. 56 83-100.
48. Ruszczyński, A., A. Shapiro. 2003. Stochastic programming models. Stochastic Programming, Handbook in Operations Research and Management Science, Vol. 10. Elsevier, Amsterdam, 1-64.
49. Ryan, D. M., J. C. Falkner. 1988. On the integer properties of scheduling set partitioning models. Eur. J. Oper. Res. 35 442-456.
50. Savelsbergh, M. 1997. A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45 831-841.
51. Sen, S., R. D. Doverspike, S. Cosares. 1994. Network planning with random demand. Telecomm. Systems 3 11-30.
52. Sherali, H. D., W. P. Adams. 1990. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3 411-430.
53. Sherali, H. D., W. P. Adams, P. J. Driscoll. 1998. Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems. Oper. Res. 46 396-405.
54. Shiina, T., J. R. Birge. 2004. Stochastic unit commitment problem. Internat. Trans. Oper. Res. 11 19-32.
55. Silva, E. F., R. K. Wood. 2006. Solving a class of stochastic mixed integer programs with branch and price. Math. Programming 108 395-418.
56. Singh, K. J. 2004. Column-generation for capacity-expansion planning of electricity distribution networks. A. Mason, ed. Proc. 39th Annual OR Society of New Zealand Conf., Operational Research Society of New Zealand, Auckland, New Zealand, 76-85.
57. Singh, K. J., A. B. Philpott, R. K. Wood. 2009. Column-generation for survivable design of electricity distribution networks. In review.
58. Vanderbeck, F., L. A. Wolsey. 1996. An exact algorithm for IP column generation. Oper. Res. Lett. 19 151-159.
59. Van Mieghem, J. A. 2003. Capacity management, investment, and hedging: Review and recent developments. Manufacturing Service Oper. Management 5 269-302.
60. Wolsey, L. A. 1998. Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc., New York.