Decomposition algorithms for stochastic programming on a computational grid

Computational Optimization and Applications

Volumn 24, Issue 2-3, 2003, Pages 207-250

  Linderoth, Jeff ^a   Wright, Stephen ^b  

^a LEHIGH UNIVERSITY   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; LINEAR PROGRAMMING;

COMPUTATIONAL GRID;

STOCHASTIC PROGRAMMING;

EID: 0037319402     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021858008222     Document Type: Article

References (26)

1. O. Bahn, O. du Merle, J.-L. Goffin, and J.P. Vial, "A cutting-plane method from analytic centers for stochastic programming," Mathematical Programming, Series B, vol. 69, pp. 45-73, 1995.
2. J.R. Birge, M.A.H. Dempster, H.I. Gassmann, E.A. Gunn, and A.J. King, "A standard input format for multiperiod stochastic linear programs," COAL Newsletter, vol. 17, pp. 1-19, 1987.
3. J.R. Birge, C.J. Donohue, D.F. Holmes, and O.G. Svintsiski, "A paralleI implementation of the nested decomposition algorithm for multistage stochastic linear programs," Mathematical Programming, vol. 75, pp. 327-352, 1996.
4. J.R. Birge, C.J. Donohue, D.F. Holmes, and O.G. Svintsitski, "ND-UM Version 1.0: Computer Code for Nested Decomposition Algorithm," Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117, Aug. 1998.
5. J.R. Birge and F. Louveaux, Introduction to Stochastic Programming, Springer Series in Operations Research, Springer: Berlin, 1997.
6. J.R. Birge and L. Qi, "Computing block-angular karmarkar projections with applications to stochastic programming," Management Science, vol. 34, pp. 1472-1479, 1988.
7. D. Buaklee, G. Tracy, M. Vernon, and S.J. Wright, "An adaptive model to control a large scale application," in Proceedings of the 16th Annual ACM International Conference on Supercomputing (ICS 2002), June 2002.
8. CPLEX Optimization, Inc., Incline Village, NV, Using the CPLEX Callable Library, 1995.
9. E. Fragnière, J. Gondzio, and J.-P. Vial, "Building and solving large-scale stochastic programs on an affordable distributed computing system," Annals of Operations Research, vol. 99, pp. 167-187, 2000.
10. H.I. Gassmann and E. Schweitzer, "A comprehensive input format for stochastic linear programs," Working Paper WP-96-1, School of Business Administration, Dalhousie University, Halifax, Canada, Dec. 1997.
11. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam, PVM: Parallel Virtual Machine, The MIT Press: Cambridge, MA, 1994.
12. J.-P. Goux, S. Kulkarni, J.T. Linderoth, and M. Yoder, "Master-Worker: An enabling framework for master-worker applications on the computational grid," Cluster Computing, vol. 4, pp. 63-70, 2001.
13. J.-P. Goax, J.T. Linderoth, and M. Yoder, "Metacomputing and the master-worker paradigm," Preprint MCS/ANL-P792-0200, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Ill., Feb. 2000.
14. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms II, Comprehensive Studies in Mathematics, Springer-Verlag: Bedim 1993.
15. K. Kiwiel, "Proximity control in bundle methods for convex nondifferentiable minimization," Mathematical Programming, vol. 46, pp. 105-122, 1990.
16. M. Livny, J. Basney, R. Raman, and T. Tannenbanm, "Mechanisms for high throughput computing," SPEEDUP, vol. 11, 1997. Available from http://www.cs.wisc.edu/condor/doc/htc_mech.ps.
17. O.L. Mangasarian, Nonlinear Programming, McGraw-Hill: New York, 1969.
18. J.M. Mulvey and A. Ruszczyński, "A new scenario decomposition method for large scale stochastic optimization," Operations Research, vol. 43, pp. 477-490, 1995.
19. R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1970.
20. A. Ruszczyński, "A regularized decomposition method for minimizing a sum of polyhedral functions," Mathematical Programming, vol. 35, pp. 309-333, 1986.
21. A. Ruszczyński, "Parallel decomposition of multistage stochastic programming problems," Mathematical Programming, vol. 58, pp. 201-228, 1993.
22. A. Ruszczyński and A. Świetanowski, "On the regularized decomposition method for two-stage stochastic linear problems," Working paper WP-96-014, IIASA, Laxenburg, Austria, 1996.
23. S. Sen, R.D. Doverspike, and S. Cosares, "Network planning with random demand," Telecommunications Systems, vol. 3, pp. 11-30, 1994.
24. A. Shapiro and T. Homem de Mello, "On the rate of convergence of optimal solutions of Monte Carlo approximations of stochastic programs," SIAM Journal on Optimization, vol. 11, pp. 70-86, 2000.
25. R. Van Slyke and R.J.-B. Wets, "L-shaped linear programs with applications to control and stochastic programming," SIAM Journal on Applied Mathematics, vol. 17, pp. 638-663, 1969.
26. R. Wunderling, "Paralleler und Objektorientierter Simplex-Algorithmus," Ph.D. Thesis, Konrad-Zuse-Zentrum für Informationstechnik, Berlin, 1996.