An extension of Karmarkar's algorithm for linear programming using dual variables
Michael J. Todd, Bruce P. Burrell · Algorithmica · 1986
Cited by 153 works. doi:10.1007/bf01840455
Authors
References
- Matrix Computations
- A new polynomial-time algorithm for linear programming
- Programming with linear fractional functionals
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Nonlinear Programming
- Solution of sparse linear least squares problems using givens rotations
- On Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method.
- An experimental approach to karmarkar’s projective method for linear programming
- Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
- Extensions of Lemke's algorithm for the linear complementarity problem