On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- 562 Downloads
In this paper, we propose a decomposition-based branch-and-bound (DBAB) algorithm for solving two-stage stochastic programs having mixed-integer first- and second-stage variables. A modified Benders' decomposition method is developed, where the Benders' subproblems define lower bounding second-stage value functions of the first-stage variables that are derived by constructing a certain partial convex hull representation of the two-stage solution space. This partial convex hull is sequentially generated using a convexification scheme such as the Reformulation-Linearization Technique (RLT) or lift-and-project process, which yields valid inequalities that are reusable in the subsequent subproblems by updating the values of the first-stage variables. A branch-and-bound algorithm is designed based on a hyperrectangular partitioning process, using the established property that any resulting lower bounding Benders' master problem defined over a hyperrectangle yields the same objective value as the original stochastic program over that region if the first-stage variable solution is an extreme point of the defining hyperrectangle or the second-stage solution satisfies the binary restrictions. We prove that this algorithm converges to a global optimal solution. Some numerical examples and computational results are presented to demonstrate the efficacy of this approach.
KeywordsTwo-stage stochastic mixed-integer programs Benders' decomposition Convexification Reformulation-Linearization Technique (RLT)
Mathematics Subject Classification (1991)20E28 20G40 20C20
Unable to display preview. Download preview PDF.
- 1.Ahmed, S.: Mean-risk objectives in stochastic programming. School of Industrial & Systems Engineering, Georgia Tech, Atlanta, GA (2004). Working Paper, available at http://www.optimization-online.org/DB_HTML/2004/04/859.html
- 6.Carøe, C.C., Schultz, R.: Dual decomposition in stochastic integer programming. Operations Research Letters 24 (1-2), 37–45 (1999)Google Scholar
- 8.Carøe, C.C., Tind, J.: L-shaped decomposition of two-stage stochastic programs with integer recourse. Mathematical Programming 83a (3), 451–464 (1998)Google Scholar
- 13.Ntaimo, L., Sen, S.: The million-variable ``march'' for stochastic combinatorial optimization. Journal of Global Optimization 32 (3) (2005, (to appear))Google Scholar
- 15.Schultz, R., Stougie, L., van der Vlerk, M.H.: Two-stage stochastic integer programming: a survey. Statistica Neerlandica 50 (3), 404–416 (1996). Also see http://mally.eco.rug.nl/index.html?biblio/SPlist.html MathSciNetCrossRefGoogle Scholar
- 18.Sen, S., Sherali, H.D.: Decomposition with branch-and-cut approaches for two stage stochastic mixed-integer programming. Mathematical Programming (to appear, 2004)Google Scholar
- 19.Sherali, H.D.: A constructive proof of the representation theorem for polyhedral sets based on fundamental definitions. American Journal of Mathematical and Management Sciences 7 (3/4), 253–270 (1987)Google Scholar
- 20.Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishing, Boston, MA (1999)Google Scholar
- 22.Stougie, L., van der Vlerk, M.H.: Stochastic integer programming. In: Dell'Amico, M., Maffioli, F., Martello, S., (eds.) Annotated Bibliographies in Combinatorial Optimization, Chapter 9:127–141 (1997)Google Scholar