Mathematical Programming

, Volume 40, Issue 1, pp 59–93

A polynomial-time algorithm, based on Newton's method, for linear programming

  • James Renegar
Article

DOI: 10.1007/BF01580724

Cite this article as:
Renegar, J. Mathematical Programming (1988) 40: 59. doi:10.1007/BF01580724

Abstract

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.

Key words

Linear programminginterior methodcomputational complexityNewton's method

Copyright information

© The Mathematical Programming Society, Inc. 1988

Authors and Affiliations

  • James Renegar
    • 1
  1. 1.School of Operations Research and Industrial EngineeringCornell UniversityIthacaUSA