Category:Karmarkar's Algorithm

This category contains results about Karmarkar's Algorithm.
Definitions specific to this category can be found in Definitions/Karmarkar's Algorithm.

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.