Karmarkar's algorithm


Karmarkar's algorithm

[¦kär·mə‚kärz ′al·gə‚rith·əm] (mathematics) A method for solving linear programming problems that has a polynomial time bound and appears to be faster than the simplex method for many complex problems.