Karmarkar's algorithm

(redirected from Karmarkar 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.
References in periodicals archive ?
Another computer program algorithm patent which does not appear consistent with the three Supreme Court decisions on this subject, is AT&T's patent on "industrial applications," of the Karmarkar algorithm, in view of the Court's statements that merely limiting the field of application for the algorithm does not make it patentable.
Recently, Ilan Adler and his colleagues at the University of California at Berkeley successfully implemented the Karmarkar algorithm and tested their implementation on a set of 30 special problems.
In Chiu and Ye describe how the Simplex and Karmarkar algorithms can come under a unified framework.