Solving two-stage stochastic programming problems with level decomposition

Computational Management Science

Volumn 4, Issue 4, 2007, Pages 313-353

  Fábián, Csaba I ^a   Szőke, Zoltán ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

Decomposition; Stochastic recourse models; Successive approximation

Indexed keywords

EID: 34548178284     PISSN: 1619697X     EISSN: 16196988     Source Type: Journal    
DOI: 10.1007/s10287-006-0026-8     Document Type: Article

References (51)

1. Andersen ED, Andersen KD (2000) The MOSEK interior-point optimizer for linear programming: An implementation of the homogeneous algorithm. In: Frenk H, Roos K, Terlaky T, Zhang S, (eds) High performance optimization. Kluwer, Dordrecht, pp 197-232
2. Beale EML (1955) On minimizing a convex function subject to linear inequalities. J R Stat Soc Ser B 17:173-184
3. Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4:238-252 republished in Comput Manage Sci 2:3-19 (2005)
4. Birge JR, Louveaux FV (1997) Introduction to Stochastic Programming. Springer, Berlin Heidelberg New York
5. Birge JR, Wets RJ-B (1986) Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse. In: Prékopa A, Wets RJ-B (eds) Stochastic Programming 84, Vol 1. Mathematical Programming Study 27:54-102
6. Björck Å (1996) Numerical methods for least squares problems. Society for Industrial and Applied Mathematics, Philadelphia
7. Dantzig GB (1955) Linear programming under uncertainty. Manage Sci 1:197-206
8. Dantzig GB, Madansky A (1961) On the solution of two-stage linear programs under uncertainty. In: Proceedings of the 4th Berkeley symposium on mathematical statistics and probability, vol 1: Pp 165-176. University of California Press, Berkeley
9. Dantzig GB, Wolfe P (1960) The decomposition principle for linear programs. Oper Res 8:101-111
10. Fábián CI (2000) Csendes T, Rapcsák T (eds) Bundle-type methods for inexact data. Central Eur J Oper Res 8 (special issue); 35-55
11. Fábián CI (2005) Decomposing CVaR minimization in two-stage stochastic models. Stochastic Programming E-Print Series 20
12. Fábián CI (2006) Handling CVaR objectives and constraints in two-stage stochastic models. RUTCOR Research Report, vol 5
13. Frauendorfer K (1988) Solving SLP recourse problems with arbitrary multivariate distributions - the dependent case. Math Oper Res 13:377-394
14. Frauendorfer K, Kall P (1988) A solution method for SLP recourse problems with arbitrary distributions - The independent case. Probl Control Inf Theory 17:177-205
15. Gassmann HI, Wallace SW (1996) Solving linear programs with multiple right-hand sides: Pricing and ordering schemes. Ann Oper Res 64:237-259
16. Gondzio J, Grothey A (2003) Reoptimization with the primal-dual interior point method. SIAM J Optim 13:842-864
17. Kall P (1980) Solving complete fixed recourse problems by successive discretization. In: Kall P, Prékopa A (eds) Recent Results in Stochastic Programming, Lecture Notes in Economics and Math. Systems 170. Springer, Berlin, Heidelberg New York, pp 135-138
18. Kall P, Mayer J (2005) Stochastic Linear Programming: Models, Theory, and Computation. International series in operations research and management science. Springer, Berlin, Heidelberg New York
19. Kall P, Stoyan D (1982) Solving stochastic programming problems with recourse including error bounds. Math Opernforsch Stat Ser Optim 13:431-447
20. Kall P, Wallace SW (1994) Stochastic programming. Wiley, Chichester
21. Kennington JL, Helgason RV (1980) Algorithms for Network Programming. Wiley, New York
22. Klafszky E, Terlaky T (1992) On the ellipsoid method. Radov Mat 8:269-280
23. Klein Haneveld WK (1986) Duality in stochastic linear and dynamic programming. Lecture Notes in Economics and Mathematical Systems, vol 274. Springer, Berlin Heidelberg New York
24. Künzi-Bay A, Mayer J (2006) Computational aspects of minimizing conditional value-at-risk. Comput Manage Sci 3:3-27
25. Lemaréchal C (1982) Basic theory in nondifferentiable optimization. Research Report No. 181, Institut National de Recherche en Informatique at en Automatique, Domaine de Voluceau, Rocquencourt, France
26. Lemaréchal C, Nemirovskii A, Nesterov Yu (1995) New variants of bundle methods. Math Program 69:111-147
27. Linderoth JT, Shapiro A, Wright SJ (2002) The empirical behavior of sampling methods for stochastic programming. Optimization Technical Report 02-01. Computer Science Department, University of Wisconsin-Madison
28. Mak W-K, Morton D, Wood RK (1999) Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper Res Lett 24:47-56
29. Maros I (2003a) A generalized dual phase-2 simplex algorithm. Eur J Oper Res 149:1-16
30. Maros I (2003b) Computational techniques of the simplex method. Kluwer, Boston
31. Mayer J (1998) Stochastic linear programming algorithms. Gordon and Breach, Amsterdam
32. Mulvey JM, Ruszczyński A (1995) A new scenario decomposition method for large scale stochastic optimization. Oper Res 43:477-490
33. Norkin VI, Pflug GCh, Ruszczyński A (1998) A branch and bound method for stochastic global optimization. Math program 83:425-450
34. Prékopa A (1971) Logarithmic concave measures with applications to stochastic programming. Acta Sci Math (Szeged) 32:301-316
35. Prékopa A (1973) Contributions to the theory of stochastic programming. Math Program 4:202-221
36. Prékopa A (1995). Stochastic Programming. Kluwer, Dordrecht
37. Prékopa A (2003) Probabilistic programming. In: Ruszczyński A, Shapiro A (eds) Stochastic Programming, Handbooks in Operations Research and Management Science vol 10, pp 267-351 Elsevier, Amsterdam
38. Rockafellar RT, Uryasev S (2000) Optimization of conditional value-at-risk. J Risk 2:21-41
39. Roos C, Terlaky T, Vial J-Ph (1997) Theory and Algorithms for Linear optimization. Wiley, Chichester
40. Ruszczyński A (1986) A regularized decomposition method for minimizing the sum of polyhedral functions. Math Program 35:309-333
41. Ruszczyński A (2003) Decomposition methods. In: Ruszczyński A, Shapiro A (eds) Stochastic Programming. Handbooks in Operations Research and Management Science, vol 10, pp 141-211 Elsevier, Amsterdam
42. Ruszczyński A, Shapiro A (2003) Stochastic Programming Models. In: Ruszczyński A, Shapiro A (eds) Stochastic Programming. Handbooks in Operations Research and Management Science, vol 10, pp 1-64 Elsevier, Amsterdam
43. Ruszczyński A, Áwietanowski A (1997) Accelerating the regularized decomposition method for two-stage stochastic linear problems. Eur J Oper Res 101:328-342
44. Schrijver A (1986) Theory of linear and integer programming. Wiley, Chichester
45. Shapiro A (2003) Monte Carlo sampling methods. In: Ruszczyński A, Shapiro A (eds) Stochastic Programming, Handbooks in Operations Research and Management Science, vol 10 pp 353-425 Elsevier, Amsterdam
46. Shapiro A, Homem-de-Mello T (1998) A simulation-based approach to two-stage stochastic programming with recourse. Math Program 81:301-325
47. Shapiro A, Homem-de-Mello T (2000) On the rate of convergence of Monte Carlo approximations of stochastic programs. SIAM J Optim 11:70-86
48. Szántai T (1988) A computer code for the solution of probabilistic-constrained stochastic programming problems. In: Ermoliev Yu, Wets RJ-B (eds) Numerical Techniques for Stochastic Optimization. Springer, Berlin Heidelberg New York
49. Van Slyke R, Wets RJ-B (1969) L-Shaped linear programs with applications to optimal control and stochastic programming. SIAM J Appl Math 17:638-663
50. Wets RJ-B (1974) Stochastic programs with fixed recourse: The equivalent deterministic program. SIAM Review 16:309-339
51. Zakeri G, Philpott AB, Ryan DM (2000) Inexact cuts in Benders decomposition. SIAM J Optim 10:643-657