Jump to content

Karmarkar's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Drlog (talk | contribs) at 05:16, 16 January 2006 (Created the article....still needs a lot of work.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Karmarkar's algorithm is an algorithm that solves linear programming problems in polynomial time. At each iteration, a new feasible search direction is calcualted and the current solution is updated.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Karmarkar%27s_algorithm&oldid=35362028"