Solving multistage stochastic network programs on massively parallel computers

Mathematical Programming, Series B

Volumn 73, Issue 3, 1996, Pages 227-250

  Nielsen, Soren S ^a,b   Zenios, Stavros A ^a,b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000150904     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592213     Document Type: Article

References (31)

1. D.P. Bertsekas, P. Hossein and P. Tseng, "Relaxation methods for network flow problems with convex arc costs", SIAM Journal on Control and Optimization 25 (1987) 1219-1243.
2. D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods (Prentice Hall, Englewood Cliffs, New Jersey, 1989).
3. J.R. Birge, "Decomposition and partitioning methods for multistage stochastic linear programs", Operations Research 33 (5) (1985) 989-1007.
4. F. Black, E. Derman and W. Toy, "A one-factor model of interest rates and its application to treasury bond options", Financial Analysts Journal (1990) 33-39.
5. Y. Censor and A. Lent, "An iterative row-action method for interval convex programming", Journal of Optimization Theory and Applications 34 (1981) 321-353.
6. Y. Censor and S.A. Zenios, "The proximal minimization algorithm with D-functions", Journal of Optimization Theory and Applications 73 (3) (1992) 455-468.
7. J. Czyzyk, R.H. Fourer and S. Mehrotra, "A study of the augmented system and column-splitting approaches for solving two-stage stochastic linear programs by interior-point methods". Technical report 93-05, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, 11, USA (1993).
8. G.B Dantzig, "Planning under uncertainty using parallel computing", in: Annals of Operations Research 14 (1985) 1-17.
9. G.B. Dantzig, M.A.H. Dempster and M.J. Kallio, eds., Large-Scale Linear Programming, IIASA Collaborative Proceedings Series 1, Laxenburg, Austria (1981) CP-81-51.
10. G.B. Dantzig and P.W. Glynn, "Parallel processors for planning under uncertainty", Annals of Operations Research 22 (1990) 1-21.
11. H.I. Gassmann, "MSLiP: A computer code for the multistage stochastic linear programming problem", Math. Prog. 47 (1990) 407-423.
12. I.J. Lustig, J.M. Mulvey and T.J. Carpenter, "Formulating stochastic programs for interior point methods", Operations Research 39 (5) (1991) 757-770.
13. J.M. Mulvey and A. Ruszczynski, "A diagonal quadratic approximation method for large scale linear programs", Operations Research Letters 12 (1992) 205-215.
14. J.M. Mulvey and H. Vladimirou, "Stochastic network optimization models for investment planning", Annals of Operations Research 20 (1989) 187-217.
15. J.M. Mulvey and H. Vladimirou, "Applying the progressive hedging algorithm to stochastic generalized networks", Annals of Operations Research 31 (1991) 399-424.
16. J.M. Mulvey and H. Vladimirou, "Solving multistage stochastic networks: An application of scenario aggregation", Networks 21 (1991) 619-643.
17. S.S. Nielsen and S.A. Zenios, "A massively parallel algorithm for nonlinear stochastic network problems", Operations Research 41 (2) (1993) 319-337.
18. S.S. Nielsen and S.A. Zenios, "Proximal minimization with D-functions and the massively parallel solution of linear network programs", Computational Optimization and Applications 1 (4) (1993) 375-398.
19. S.S. Nielsen and S.A. Zenios, "Massively parallel proximal algorithms for solving linear stochastic network programs", International Journal of Supercomputer Applications 4 (1993) 349-364.
20. S.S. Nielsen and S.A. Zenios, "A stochastic programming model for funding Single Premium Deferred Annuities", Mathematical Programming (1995) (to appear).
21. L. Qi, "Forest iteration method for stochastic transportation problem", Mathematical Programming Study 25 (1985) 142-163.
22. R.T. Rockafellar, "Augmented Lagrangians and applications to proximal point algorithms in convex programming", Math. of Operations Research 1 (1976) 97-116.
23. R.T. Rockafellar, "Monotone operators and the proximal point algorithm", SIAM Journal on Control and Optimization 14 (1976) 877-898.
24. R.T. Rockafellar and R.J.-B. Wets, "Scenarios and policy aggregation in optimization under uncertainty", Math. of Operations Research 16 (1) (1991) 119-147.
25. A. Ruszczynski, "A regularized decomposition method for minimizing a sum of polyhedral functions", Mathematical Programming 35 (1986) 309-333.
26. A. Ruszczynski, "Parallel decomposition of multistage stochastic programming problems", Working paper WP-88-094, HASA (1988).
27. A. Ruszczynski, "Regularized decomposition and augmented Lagrangian decomposition for angular linear programming problems", Aspiration Based Decision Support Systems (1989) A. Levandowski, A. P. Wierzbicki, eds. (Springer Verlag).
28. R. van Slyke and R.J-B. Wets, "L-shaped linear programs with applications to optimal control and stochastic programming", SIAM Journal of Applied Mathematics 17 (1969) 638-663.
29. R.J-B. Wets, "On parallel processor design for solving stochastic programs", Report wp-85-67, International Institute for Applied Systems Analysis, Laxenburg, Austria (1985).
30. S.A. Zenios, "Massively parallel computations for financial modeling under uncertainty", in: J. Mesirov, ed., Very Large Scale Computing in the 21st Century, SIAM (1991) 273-296.
31. S.A. Zenios and R.A. Lasken, "Nonlinear network optimization on a massively parallel Connection Machine", Annals of Operations Research 14 (1988) 147-165.