Abstract
We present a computationally efficient implementation of an interior point algorithm for solving large-scale problems arising in stochastic linear programming and robust optimization. A matrix factorization procedure is employed that exploits the structure of the constraint matrix, and it is implemented on parallel computers. The implementation is perfectly scalable. Extensive computational results are reported for a library of standard test problems from stochastic linear programming, and also for robust optimization formulations. The results show that the codes are efficient and stable for problems with thousands of scenarios. Test problems with 130 thousand scenarios, and a deterministic equivalent linear programming formulation with 2.6 million constraints and 18.2 million variables, are solved successfully.
Keywords
Research funded in part by contract HPC-Finance of DGIII of the European Union.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A.J. Berger, J.M. Mulvey, and A. Ruszczyński, “An extension of the DQA algorithm to convex stochastic programs,” SIAM Journal on Optimization, vol. 4, no. 4, pp. 735–753, 1994.
J.R. Birge and L. Qi, “Computing block-angular Karmarkar projections with applications to stochastic programming,” Management Science, vol. 34, pp. 1472–1479, Dec. 1988.
J.R. Birge and D.F. Holmes, “Efficient solution of two-stage stochastic linear programs using interior point methods,” Computational Optimization and Applications, vol. 1, pp. 245–276, 1992.
Y. Censor and S.A. Zenios, Parallel Optimization: Theory, Algorithms and Applications, Oxford University Press: Oxford, England, 1997 (in print).
G.B. Dantzig, “Planning under uncertainty using parallel computing,” Annals of Operations Research, vol. 14, pp. 1–16, 1988.
G.B. Dantzig, J.K. Ho, and G. Infanger, “Solving stochastic linear programs on a hypercube multicomputer,” Technical report sol 91-10, Operations Research Department, Stanford University, Stanford, CA, 1991.
E.R. Jessup, D. Yang, and S.A. Zenios, “Parallel factorization of structured matrices arising in stochastic programming, SIAM Journal on Optimization, vol. 4, no. 4, pp. 833–846, 1994.
P. Kall and S.W. Wallace, Stochastic Programming, John Wiley & Sons: New York, 1994.
C.E. Leiserson, Z.S. Abuhamdeh, D.C. Douglas, C.R. Feynman, M.N. Ganmukhi, J.V. Hill, W.D. Hillis, B.C. Kuszmaul, M.A. St. Pierre, D.S. Wells, M.C. Wong, S.-W. Yang, and R. Zak, “The network architecture of the Connection Machine CM-5,” Manuscript, Thinking Machines Corporation, Cambridge, Massachusetts 02142, 1992.
R.D.C. Monteiro and I. Adler, “Interior path-following primal-dual algorithms. Part II: Convex quadratic programming,” Mathematical Programming, vol. 44, pp. 43–66, 1989.
J.M. Mulvey and A. Ruszczyński, “A new scenario decomposition method for large-scale stochastic optimization,” Operations Research, vol. 43, pp. 477–490, 1994.
J.M. Mulvey, R.J. Vanderbei, and S.A. Zenios, “Robust optimization of large scale systems,” Operations Research, vol. 43, pp. 264–281, 1995.
J.M. Mulvey and H. Vladimireu, “Evaluation of a parallel hedging algorithm for stochastic network programming,” in Impacts of Recent Computer Advances on Operations Research, R. Sharda, B.L. Golden, E. Wasil, O. Balci, and W. Stewart (Eds.), North-Holland, New York, USA, 1989.
E. Ng and B. Peyton, “A supernodal Cholesky factorization algorithm for shared-memory multiprocessors,” SIAM Journal on Scientific and Statistical Computing, vol. 14, pp. 761–769, 1993.
S.S. Nielsen and S.A. Zenios, “A massively parallel algorithm for nonlinear stochastic network problems,” Operations Research, vol. 41, no. 2, pp. 319–337, 1993.
S.S. Nielsen and S.A. Zenios, “Scalable parallel Benders decomposition for stochastic linear programming,” Technical report, Management Science and Information Systems Department, University of Texas at Austin, Austin, TX, 1994.
S. Sen, R.D. Doverspike, and S. Cosares, “Network planning with random demand,” Working paper, Systems and Industrial Engineering Department, University of Arizona, Tucson, AZ, 1992.
R.J. Vanderbei, “LOQO user’s manual,” Technical report SOR 92-5, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ, 1992.
R.J. Vanderbei and T.J. Carpenter, “Symmetric indefinite systems for interior point methods,” Mathematical Programming, vol. 58, pp. 1–32, 1993.
R.J.-B. Wets, “Stochastic programming,” in Handbooks in Operations Research and Management Science, G.L. Nemhauser, A.H.G. Rinnooy Kan, and M.J. Todd (Eds.), vol. 1, pp. 573–629, North-Holland, Amsterdam, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Kluwer Academic Publishers
About this chapter
Cite this chapter
Yang, D., Zenios, S.A. (1997). A Scalable Parallel Interior Point Algorithm for Stochastic Linear Programming and Robust Optimization. In: Murli, A., Toraldo, G. (eds) Computational Issues in High Performance Software for Nonlinear Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-26778-4_9
Download citation
DOI: https://doi.org/10.1007/978-0-585-26778-4_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9862-2
Online ISBN: 978-0-585-26778-4
eBook Packages: Springer Book Archive