A polynomial-time algorithm, based on Newton's method, for linear programming
- Cite this article as:
- Renegar, J. Mathematical Programming (1988) 40: 59. doi:10.1007/BF01580724
- 517 Downloads
A new interior method for linear programming is presented and a polynomial time bound for it is proven. The proof is substantially different from those given for the ellipsoid algorithm and for Karmarkar's algorithm. Also, the algorithm is conceptually simpler than either of those algorithms.