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.
KeywordsPolynomial Time Feasible Region Feasible Point Optimal Cost Projective Transformation
Unable to display preview. Download preview PDF.
- 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
- L. Babai, class notes, Dept. of Computer Science, University of Chicago, Chicago, IL.Google Scholar
- 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
- J. Renegar, “A Polynomial-Time Algorithm, Based on Newton’s Method, for Linear Programming,” Mathematical Programming 40 (1988), 50-94.Google Scholar
- 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