The augmented system variant of IPMs in two-stage stochastic linear programming computation

European Journal of Operational Research

Volumn 101, Issue 2, 1997, Pages 317-327

  Mészáros, Csaba ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

NUMERICAL METHODS; OPERATIONS RESEARCH; RANDOM PROCESSES; STATISTICAL METHODS;

INTERIOR POINT METHODS;

LINEAR PROGRAMMING;

EID: 0031219824     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00400-6     Document Type: Article

References (31)

1. K.D. Andersen, A modified Schur complement method for handling dense columns in interior point methods for linear programming, Technical Report, Odense University, 1995.
2. M. Arioli, I.S. Duff, P.P.M. Rijk, On the augmented system approach to sparse least-squares problems, Numerische Mathematik 55 (1989) 667-684.
3. J.R. Birge, Current trends in stochastic programming computation and application, Technical Report, Department of Industrial and Operations Engineering, University of Michigan, 1995.
4. J.R. Birge, M.A.H. Dempster, H.I. Gassman, E.A. Gunn, A.J. King, S.W. Wallace, A standard input format for multiperiod stochastic linear programs, COAL newsletter 17 (1987) 1-20.
5. J. Birge, D. Holmes, Efficient solution of two-stage stochastic linear programs using interior point methods, Computational Optimization and Applications 1 (1992) 245-276.
6. J. Birge, L. Qi, Computing block-angular Karmarkar projections with applications to stochastic programming, Management Science 34 (12) (1988) 1472-1479.
7. J.R. Bunch, B.N. Parlett, Direct methods for solving symmetric indefinite systems of linear equations, SIAM Journal on Numerical Analysis 8 (1971) 639-655.
8. J. Czyzyk, R. Fourer, 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, IL, 1994.
9. G.B. Dantzig, A. Madansky, On the solution of the two-stage linear programs under uncertainty, in: J. Neyman (Ed.), Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, CA, 1961, pp. 165-176.
10. I.S. Duff, A.M. Erisman, J.K. Reid, Direct Methods for Sparse Matrices, Oxford University Press, New York, 1989.
11. R. Fourer, S. Mehrotra, Solving symmetric indefinite systems in an interior point method for linear programming, Mathematical Programming 62 (1993) 15-39.
12. J. Gondzio, Preconditioned conjugate gradients in an interior point method for two-stage stochastic programming, Working Paper WP-94-130, IIASA International Institute for Applied Systems Analysis, Laxenburg, Austria, 1994.
13. J. Gondzio, Multiple centrality corrections in primal dual method for linear programming, Technical Report 1994.20, Department of Management Studies, University of Geneva, Switzerland, 1994.
14. D. Holmes, A collection of stochastic programming problems, Technical Report 94-11, Department of Industrial and Operations Engineering, The University of Michigan, 1994.
15. P. Kall, J. Mayer, SLP-IOR: a model management system for stochastic linear programming - system design, in: A.J.M. Beulens, J.-H. Sebastian (Eds.), Optimization-based Computer-aided Modeling and Design, Springer-Verlag, New York, 1992, pp. 139-147.
16. P. Kall, J. Mayer, A model management system for stochastic linear programming, in: P. Kall (Ed.), System Modelling and Optimization, Springer-Verlag, New York, 1992, pp. 580-587.
17. N. Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica 4 (1984) 375-395.
18. I.J. Lustig, J.M. Mulvey, T.J. Carpenter, Formulating two-stage stochastic programs for interior point methods, Operations Research 39/5 (1991) 757-770.
19. I.J. Lustig, R.E. Marsten, D.F. Shanno, Interior point methods for linear programming: computational state of the art, ORSA Journal on Computing 6 (1994) 1-14.
20. I. Maros, Cs. Mészáros, The role of the augmented system in interior point methods, Technical Report TR/06/95, Department of Mathematics and Statistics, Brunel University, London, 1995.
21. S. Mehrotra, Higher order methods and their performance, Technical Report 90-16R1, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, 1991.
22. Cs. Mészáros, Fast Cholesky-factorization for interior point method of linear programming, Computational Mathematics and Applications 31 (4-5) (1996) 49-54.
23. Cs. Mészáros, The 'inexact' minimum local fill-in ordering algorithm, Working Paper WP 95-7, Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, 1995.
24. J.M. Mulvey, H. Vladimirou, Stochastic network optimization models for investment planning, Annals of Operations Research 20 (1989) 187-217.
25. R. Van Slyke, R.J.-B. Wets, The L-shaped linear programs with application to optimal control and stochastic programming, SIAM Journal on Applied Mathematics 17 (1969) 638-663.
26. G.W. Stewart, Modifying pivot elements in Gaussian elimination, Mathematics of Computation 28 (1974) 537-542.
27. B. Strazicky, Some results concerning an algorithm for the discrete recourse problem, in: M.A.H. Dempster (Ed.), Stochastic Programming, Academic Press, New York, 1980.
28. U.H. Suhl, L.M. Suhl, Computing sparse LU factorizations for large-scale linear programming bases, ORSA Journal on Computing 2 (4) (1990) 325-335.
29. R.J. Vanderbei, T.J. Carpenter, Symmetric indefinite systems for interior point methods, Mathematical Programming 58 (1993) 1-32.
30. R.J. Vanderbei, Symmetric quasi-definite matrices, SIAM Journal on Optimization 5 (1) (1995) 373-395.
31. R.J.-B. Wets, Stochastic programs with fixed recourse: the equvivalent deterministic problem, SIAM Review 16 (1974) 309-339.