Decomposition methods in stochastic programming

被引：5
作者：
Andrzej Ruszczyński
机构：
[1] University of Wisconsin-Madison,Department of Industrial Engineering
[2] Warsaw University of Technology,Department of Electronics and Computer Science
来源：
Mathematical Programming | 1997年 / 79卷
关键词：
Stochastic programming; Decomposition; Primal methods; Dual methods; Stochastic methods;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Stochastic programming problems have very large dimension and characteristic structures which are tractable by decomposition. We review basic ideas of cutting plane methods, augmented Lagrangian and splitting methods, and stochastic decomposition methods for convex polyhedral multi-stage stochastic programming problems.
引用
收藏
页码：333 / 353
页数：20
相关论文
共 42 条
[1]  
Benders J.F.(1962)Partitioning procedures for solving mixed-variables programming problems Numerische Mathematik 4 238-252
[2]  
Birge J.R.(1985)Decomposition and partitioning methods for multistage stochastic linear programs Operations Research 33 989-1007
[3]  
Birge J.R.(1996)A parallel implementation of the nested decomposition method for multistage stochastic linear programs Mathematical Programming 75 327-352
[4]  
Donohue C.J.(1988)A multicut algorithm for two-stage stochastic linear programs European Journal of Operational Research 34 384-392
[5]  
Holmes D.F.(1995)Scenario analysis via bundle decomposition Annals of Operations Research 56 39-63
[6]  
Svintsitski O.G.(1960)Decomposition principle for linear programs Operations Research 8 101-111
[7]  
Birge J.R.(1992)On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators Mathematical Programming 55 293-318
[8]  
Louveaux F.V.(1989)Importance sampling for stochastic simulation Management Science 35 1367-1392
[9]  
Chun B.J.(1993)Asymptotic theory for solutions in statistical estimation and stochastic programming Mathematics of Operations Research 18 148-162
[10]  
Robinson S.M.(1993)The integer Operations Research Letters 13 133-142
12345