SCENARIO ANALYSIS VIA BUNDLE DECOMPOSITION

被引:15
作者
CHUN, BJ [1 ]
ROBINSON, SM [1 ]
机构
[1] UNIV WISCONSIN,DEPT IND ENGN,MADISON,WI 53706
关键词
SCENARIO ANALYSIS; BUNDLE DECOMPOSITION; BUNDLE TRUST REGION METHOD; MILITARY FORCE PLANNING; MIX ANALYSIS; NETWORK MODELS;
D O I
10.1007/BF02031699
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Scenario analysis, originally proposed by Rockafellar and Wets, is a widely applicable method for introducing uncertainty into practical decision problems. As it often leads to very large optimization problems, one needs special techniques for the resulting numerical computation. One such technique, the Progressive Hedging Algorithm, is simple and universally applicable, but it can be slow. In this paper we show how the bundle decomposition method can be applied to linear or convex scenario analysis problems that are loosely coupled. We illustrate its effectiveness by presenting computational results for military force planning problems and for multi-scenario network models of production planning.
引用
收藏
页码:39 / 63
页数:25
相关论文
共 33 条
[1]  
CHUN BJ, 1992, 928 U WISC MAD DEP I
[2]  
CHUN BJ, 1991, 916 U WISC MAD DEP I
[3]  
CHUN BJ, 1992, THESIS U WISCONSIN M
[4]  
DANTZIG GB, 1989, EPRI EL6484 EL POW R
[5]  
EVSTIGNEEV IV, 1985, CP8523 INT I APPL SY
[6]   DECOMPOSITION AND NONDIFFERENTIABLE OPTIMIZATION WITH THE PROJECTIVE ALGORITHM [J].
GOFFIN, JL ;
HAURIE, A ;
VIAL, JP .
MANAGEMENT SCIENCE, 1992, 38 (02) :284-302
[7]  
GOFFIN JL, 1991, IN PRESS MATH PROGR
[8]  
GRIGORIADIS MD, 1979, RNET RUTGERS MINIMUM
[9]  
Helgason T., 1991, Annals of Operations Research, V31, P425, DOI 10.1007/BF02204861
[10]   A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING [J].
KARMARKAR, N .
COMBINATORICA, 1984, 4 (04) :373-395