Another simplex-type method for large scale linear programming

Control and Cybernetics

Volumn 25, Issue 4, 1996, Pages 738-755

  Gondzio, Jacek ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

Active constraints; Large scale optimization; Linear programs; Working basis

Indexed keywords

EID: 3042916587     PISSN: 03248569     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (28)

1. ALTMAN, A. and GONDZIO J. (1993A) An efficient implementation of a higher order primal-dual interior point method for large sparse linear programs. Archives of Control Sciences, 2, 1/2, 23-40.
2. ALTMAN, A. and GONDZIO J. (1993B) HOPDM - A higher order primal-dual method for large scale linear programming. European Journal of Operational Research, 66, 159-161.
3. BIXBY, R.E. (1992) Implementing the simplex method: the initial basis. ORSA Journal on Computing, 4, 3, 267-284.
4. CARDOSO, D.M. and CLIMACO, J.C.N. (1992) The generalized simplex method. Operations Research Letters, 12, 5, 337-348.
5. DANTZIG, G.B.(1963) Linear Programming and Extensions. Princeton University Press, Princeton.
6. EISELT, H.A. and SANDBLOM, C.-L. (1990) Experiments with external pivoting. Computers and Operations Research, 17, 4 , 325-332.
7. EVTUSHENKO, JU.G. and ZHADAN, W.G. (1992) Barrier-projective and barrier-Newton computational methods of optimization (linear programming case). Technical Report, USSR Academy of Sciences Center of Computations, Moscow, USSR (in Russian).
8. FATHI, Y. and MURTY, K.G. (1989) Computational behavior of a feasible direction method for linear programming. European Journal of Operational Research, 40, 322-328.
9. FORREST, J.J. and GOLDFARB, D. (1992) Steepest-edge simplex algorithms for linear programming. Mathematical Programming, 57, 341-374.
10. GABASOV, R., KIRILLOVA, F.M. and TIATIUSHKIN, A.I. (1984) Constructive Aspects of Optimization, part 1. Izdatelstvo Universitetskoje, Minsk (in Russian).
11. GAY, D.M. (1985) Electronic mail distribution of linear programming test problems. Mathematical Programming Society COAL Newsletter, 13, 10-12.
12. GONDZIO, J. (1994A) On exploiting original problem data in the inverse representation of linear programming bases. ORSA Journal on Computing, 6, 2, 193-206.
13. GONDZIO, J. (1994B) Presolve analysis of linear programs prior to applying an interior point method, Technical Report 1994.3, Department of Management Studies, University of Geneva. Switzerland, February 1994, revised in December 1994, ORSA Journal on Computing (to appear).
14. GONDZIO, J. (1995) Applying Schur complements for handling general updates of large sparse unsymmetric matrix, Technical Report ZTSW-2-G244/93, Systems Research Institute, Warsaw, September 1993, revised April 1995.
15. GOULD, N.I.M. and REID, J. (1989) New crash procedures for large systems of linear constraints. Mathematical Programming, 45, 475-501.
16. JACQUET-LAGREZE, E. (1987) A projected gradient method for linear programming, Technical Report No 79. LAMSADE, University of Paris Dauphine, June, Paris, France.
17. KORYTOWSKI, A. (1990) Inner search methods for linear programming. Applicationes Matematicae, 20, 2, 307-327.
18. LUSTIG, I.J., MARSTEN, R.E. and SHANNO, D.F. (1992) On implementing Mehrotra's predictor-corrector interior point method for linear programming. SIAM Journal on Optimization, 2, 3, 435-449.
19. MARSTEN, R.E. (1981) The design of the XMP linear programming library. ACM Transactions on Mathematical Software, 7, 481-497.
20. MEHROTRA, S. (1991) Higher order methods and their performance, Technical Report 90-16R1. Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, July 1991.
21. MITRA, G., TAMIZ, M. and YADEGAR, J. (1988) Experimental investigation of an interior search method within a simplex framework. Communications of the ACM, 31, 1474-1482.
22. MURTAGH, B. (1981) Advanced Linear Programming, Computation and Practice. McGraw-Hill, New York.
23. POWELL, S. (1975) A development of the product form algorithm for the simplex method using reduced transformation vectors. Mathematical Programming Study, 4, 93-107.
24. REID, J.K. (1982) A sparsity-exploiting variant of the Bartels-Golub decomposition for linear programming bases. Mathematical Programming, 24, 55-69.
25. ROSEN, J. (1961) The gradient projection method for nonlinear programming, I. Linear constraints. Journal of SIAM, 8, 181-197.
26. TERLAKY, T. and ZHANG, S. (1995) Pivot rules for linear programming: a survey on recent theoretical developments. Annals of Operations Research, 46, 203-233.
27. WIERZBICKI, A.P. (1993) Augmented simplex: a modified and parallel version of simplex method based on multiple objective and subdifferential optimization approach, Technical Report 93-XX. Institute of Automatic Control, Warsaw University of Technology, Warsaw, July 1993.
28. WOLFE, P. (1963) Methods for nonlinear programming, in: Recent Advances in Mathematical Programming, Graves R.L. and Wolfe P. (eds), McGraw-Hill, New York, 1963.