An extension of Karmarkar's algorithm for linear programming using dual variables
- 1 November 1986
- journal article
- research article
- Published by Springer Science and Business Media LLC in Algorithmica
- Vol. 1 (1-4), 409-424
- https://doi.org/10.1007/bf01840455
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method.Published by Defense Technical Information Center (DTIC) ,1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Some Extensions of an Algorithm for Sparse Linear Least Squares ProblemsSIAM Journal on Scientific and Statistical Computing, 1982
- Solution of sparse linear least squares problems using givens rotationsLinear Algebra and its Applications, 1980
- A class of methods for linear programmingMathematical Programming, 1978
- Extensions of Lemke's algorithm for the linear complementarity problemJournal of Optimization Theory and Applications, 1976
- Programming with linear fractional functionalsNaval Research Logistics Quarterly, 1962