zbMATH — the first resource for mathematics

Affine-scaling for linear programs with free variables. (English) Zbl 0825.90681

90C05 Linear programming
PDF BibTeX Cite
Full Text: DOI
[1] I. Adler, A. Karmarkar, M.G.C. Resende and G. Veiga, ”An implementation of Karmarkar’s algorithm for linear programming,” to appear inMathematical Programming. · Zbl 0682.90061
[2] E.R. Barnes, ”A variation on Karmarkar’s algorithm for solving linear programming problems,”Mathematical Programming 36 (1986) 174–182. · Zbl 0626.90052
[3] D.A. Bayer and J. Lagarias, ”Nonlinear geometry of linear programming: Parts I and II,” to appear inTransactions of the AMS. · Zbl 0671.90046
[4] T.M. Cavalier and K.C. Schall, ”Implementing a projective algorithm for solving inequalityconstrained linear programs,” IMSE Working Paper 86–128, The Pennsylvania State University (1986).
[5] V. Chandru and B.S. Kochar, ”A class of algorithms for linear programming,” Research Memorandum No. 85–14, Purdue University (1985).
[6] V. Chandru and B.S. Kochar, ”Exploring special structures using a variant of Karmarkar’s algorithm,” Research Memorandum No. 86–10, Purdue University (1986).
[7] R.J. Vanderbei, M.S. Meketon and B.A. Freedman, ”A modification of Karmarkar’s linear programming algorithm,”Algorithmica 1 (1986) 395–407. · Zbl 0626.90056
[8] R.J. Vanderbei, ”The affine-scaling algorithm and primal degeneracy,” talk presented at the Conference on Advances in Mathematical Programming held in Monterey, CA, March 2–5, 1987.
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.