RT Book, Section
SR 00
ID doi:10.1007/BFb0121120
A1 Qi, L.
T1 An alternating method for stochastic linear programming with simple recourse
YR 2009
FD 2009
VO 27
SP 183
OP 190
AB Stochastic linear programming with simple recourse arises naturally in economic problems and other applications. One way to solve it is to discretize the distribution functions of the random demands. This will considerably increase the number of variables and will involved discretization errors. Instead of doing this, we describe a method which alternates between solving some n-dimensional linear subprograms and some m-dimensional convex subprograms, where n is the dimension of the decision vector and m is the dimension of the random demand vector. In many cases, m is relatively small. This method converges in finitely many steps.
A2 Prekopa, A.
A2 Wets, R.
T2 Stochastic Programming 84 Part I
PB Springer
T3 Mathematical Programming Study
SN 978-3-642-00924-2
AV Published
LK https://pure.iiasa.ac.at/id/eprint/13651/
DO 10.1007/BFb0121120