ALPO

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 rather complete description of the algorithm and the implementation. Computational results obtained for the NETLIB suite of problems run on a Silicon Graphics workstation are also presented.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 10 articles , 1 standard article )

Showing results 1 to 10 of 10.
Sorted by year (citations)

  1. Vanderbei, Robert; Lin, Kevin; Liu, Han; Wang, Lie: Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (2016)
  2. Bishop, Raymond F. (ed.); Gernoth, Klaus A. (ed.); Walet, Niels R. (ed.): 150 years of quantum many-body theory. A Festschrift in honour of the 65th birthdays of John W. Clark, Alpo J. Kallio, Manfred L. Ristig and Sergio Rosati. Proceeding of the workshop, UMIST, Manchester, GB, July 10--14, 2000 (2001)
  3. Maros, István; Mészáros, Csaba: The role of the augmented system in interior point methods (1998)
  4. Levkovitz, Ron; Mitra, Gautam: Experimental investigations in combining primal dual interior point method and simplex based LP solvers (1995)
  5. Carpenter, Tamra J.; Shanno, David F.: An interior point method for quadratic programs based on conjugate projected gradients (1993)
  6. Fourer, Robert; Mehrotra, Sanjay: Solving symmetric indefinite systems in an interior-point method for linear programming (1993)
  7. Vanderbei, Robert J.: ALPO: Another linear program optimizer (1993)
  8. Vanderbei, Robert J.; Carpenter, Tamra J.: Symmetric indefinite systems for interior point methods (1993)
  9. Vanderbei, Robert J.: Splitting dense columns in sparse linear systems (1991)
  10. Vanderbei, Robert J.: A brief description of ALPO (1991)