Definition:Karmarkar's Algorithm

Definition

Karmarkar's algorithm is an algorithm for solving problems in linear programming and certain other more general constrained optimization problems.

For large problems it is often faster than the simplex method.

While the simplex method searches the boundaries of the feasible region, Karmarkar's algorithm starts its search from an interior point.

This article is complete as far as it goes, but it could do with expansion. In particular: Explain what it is You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding this information. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Expand}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Also see

• Results about Karmarkar's algorithm can be found here.

Source of Name

This entry was named for Narendra Krishna Karmarkar.

Historical Note

Karmarkar's algorithm was designed by Narendra Krishna Karmarkar in $1984$.

Sources

• 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): Karmarkar's algorithm