期刊
MATHEMATICAL PROGRAMMING
卷 144, 期 1-2, 页码 39-64出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-012-0615-y
关键词
Two-stage stochastic integer programs; Gomory cuts; L-shaped method; Benders' decomposition; Lexicographic dual simplex; Finite convergence
类别
资金
- NSF-CMMI [1100383]
- Directorate For Engineering
- Div Of Civil, Mechanical, & Manufact Inn [1100383] Funding Source: National Science Foundation
We consider a class of two-stage stochastic integer programs with binary variables in the first stage and general integer variables in the second stage. We develop decomposition algorithms akin to the -shaped or Benders' methods by utilizing Gomory cuts to obtain iteratively tighter approximations of the second-stage integer programs. We show that the proposed methodology is flexible in that it allows several modes of implementation, all of which lead to finitely convergent algorithms. We illustrate our algorithms using examples from the literature. We report computational results using the stochastic server location problem instances which suggest that our decomposition-based approach scales better with increases in the number of scenarios than a state-of-the art solver which was used to solve the deterministic equivalent formulation.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据