Abstract
One approach how to solve a linear optimization is based on interior point method. This method requires the solution of large linear system equations. A special matrix factorization techniques that exploit the structure of the constraint matrix has been suggested for its computation. The method of Birge and Qi has been reported as efficient, stable and accurate for two-stage stochastic programs. In this report we present a generalization of this method for three-stage stochastic programs.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Vladimirou, H. Zenios, S.A.: Scalable parallel computations for large-scale stochastic programming, Annals of Oper. Res. 90, 1999, pp. 87–129.
Birge, J.R., Holmes, D.F.: Efficient solution of two-stage stochastic linear programs using interior point methods, Comput. Optim. Appl., 1, 1992,pp. 245–276.
Birge, J.R., Qi, L.: Computing block-angular Karmarkar projections with applications to stachastic programming, Management Sci., 34, 1988, pp. 1472–1479.
Jessup, E.R., Yang, D., Zenios, S.A.: Parallel factorization of structured matrices arising in stochastic programming, SIAM J.Optimization, Vol. 4., No. 4, 1994, pp. 833–846.
Golub, G.H., Van Loan, Ch.F.: Matrix Computations, The Johns Hopkins University Press, 1996.
A. Ralston: A first course in numerical analysis, McGraw-Hill, inc., New York, 1965.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pflug, G.C., Halada, L. (2002). Birge and Qi Method for Three-Stage Stochastic Programs Using IPM. In: Sloot, P.M.A., Hoekstra, A.G., Tan, C.J.K., Dongarra, J.J. (eds) Computational Science — ICCS 2002. ICCS 2002. Lecture Notes in Computer Science, vol 2329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46043-8_20
Download citation
DOI: https://doi.org/10.1007/3-540-46043-8_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43591-4
Online ISBN: 978-3-540-46043-5
eBook Packages: Springer Book Archive