Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Karmarkar's algorithm

Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_494

An algorithm devied by N. Karmarkar for solving a linear-programming problem by generating a sequence of points that lie in the strict interior of the problem's solution space and that converges to an optimal solution. Karmarkar's algorithm, and its many variations, have been shown to be polynomial-time algorithms that solve large-scale linear-programming problems in a computationally efficient manner. Interior point methods; Polynomial-time algorithm.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA