zbMATH — the first resource for mathematics

A brief description of ALPO. (English) Zbl 0744.90056
Summary: This paper describes an implementation of the one-phase primal-dual path- following algorithm for solving linear programming problems. The design is intended to be simple, portable and robust. These design goals are achieved without sacrificing state-of-the-art performance. We give a brief description of the algorithm and the implementation focusing on the features which most distinguish this implementation from others available.

90C05 Linear programming
90-08 Computational methods for problems pertaining to operations research and mathematical programming
90C06 Large-scale problems in mathematical programming
PDF BibTeX Cite
Full Text: DOI
[1] Choi, I.C; Monma, C.L; Shanno, D.F, Further development of a primal-dual interior point method, () · Zbl 0757.90051
[2] Gay, D.M, Electronic mail distribution of linear programming test problems, Mathematical programming society COAL newsletter, (1985)
[3] Lustig, I.J, Feasibility issues in an interior point method for linear programming, Math. programming, 49, 2, 145-162, (1991) · Zbl 0726.90050
[4] Lustig, I.J; Marsten, R.E; Shanno, D.F, Computational experience with a primal-dual interior point method for linear programming, Linear algebra appl., 152, 191-222, (1991) · Zbl 0731.65049
[5] Lustig, I.J; Marsten, R.E; Shanno, D.F, On implementing Mehrotra’s predictor-corrector interior point method for linear programming, SIAM J. optim., (1992), to appear · Zbl 0771.90066
[6] McShane, K.A; Monma, C.L; Shanno, D.F, An implementation of a primal-dual interior point method for linear optimizer, ORSA J. computing, 1, 70-83, (1989) · Zbl 0752.90047
[7] Vanderbei, R.J, ALPO: another linear program optimizer, () · Zbl 0777.90031
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.