Karmarkar’s Algorithm

  • Howard Karloff
Part of the Modern Birkhäuser Classics book series (MBC)


The appearance in 1984 of Karmarkar’s Algorithm for linear programming generated much excitement in the mathematical community. Also known as the projective transformation method, Karmarkar’s Algorithm was the first polynomial-time linear programming algorithm to compete viably with Simplex on real-world problems. Like the Ellipsoid Algorithm, Karrnarkar’s Algorithm almost completely ignores the combinatorial structure of linear programming.


Polynomial Time Feasible Region Feasible Point Optimal Cost Projective Transformation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [5]
    I. Adler, M. G. C. Resende and G. Veiga, “An Implementation of Karmarkar’s Algorithm for Linear Programming,” Report ORC 86-8, Department of Industrial Engineering and Operations Research, University of California, Berkeley, 1986.Google Scholar
  2. [10]
    L. Babai, class notes, Dept. of Computer Science, University of Chicago, Chicago, IL.Google Scholar
  3. [24]
    D. Goldfarb and S. Mehrotra, “A Relaxed Version of Karmarkar’s Algorithm,” Mathematical Programming 40 (1988), 289-315.zbMATHCrossRefMathSciNetGoogle Scholar
  4. [25]
    D. Goldfarb and M. J. Todd, “Linear Programming,” in Optimization, G. Nemhauser et al., eds., North-Holland, Amsterdam, 1989, 73-170.CrossRefGoogle Scholar
  5. [26]
    C. C. Gonzaga, “An Algorithm for Solving Linear Programming Problems in O(n 3 L)Operations,” in Progress in Mathematical Programming: Interior-Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, NY, 1989, 1-28.Google Scholar
  6. [34]
    N. Karmarkar, “A New Polynomial-Time Algorithm for Linear Programming,” Combinatorica 4 (1984), 373-395.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [42]
    R. D. C. Monteiro and I. Adler, “Interior Path Following Primal-Dual Algorithms. Part I: Linear Programming,” Mathematical Programming 44 (1989), 27-41.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [45]
    J. Renegar, “A Polynomial-Time Algorithm, Based on Newton’s Method, for Linear Programming,” Mathematical Programming 40 (1988), 50-94.Google Scholar
  9. [47]
    A. Schrijver, Theory of Linear and Integer Programming, Wiley, New York, NY, 1986.zbMATHGoogle Scholar
  10. [58]
    M. J. Todd, “Polynomial Algorithms for Linear Programming,” in Advances in Optimization and Control, H. A. Eiselt and G. Pederzoli, eds., Springer-Verlag, Berlin, 1988, 49-66.Google Scholar
  11. [59]
    J. A. Tomlin, “An Experimental Approach to Karmarkar’s Projective Method for Linear Programming,” Mathematical Programming Study 31 (1987), 175-191.zbMATHMathSciNetGoogle Scholar
  12. [60]
    P. M. Vaidya, “An Algorithm for Linear Programming Which Requires O(((m+ n)n 2 +(m + n)1.5 n)L) Arithmetic Operations,” Mathematical Programming 47 (1990), 175-201.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Birkhäuser Boston, a part of Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Howard Karloff
    • 1
  1. 1.College of Computing, Georgia TechAtlantaUSA

Personalised recommendations