Encyclopedia

Karmarkar's algorithm

Also found in: Wikipedia.

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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive
Since Karmarkar's algorithm [7] was proved to be polynomial, many researchers proposed some interior-point algorithms for solving mathematical problems over non-negative orthant.
In addition to the complexity result Karmarkar's algorithm has also been shown to be an efficient computational method in some contexts.
This improvement could give Karmarkar's algorithm a decided edge among the competing methods used to solve these problems.
Copyright © 2003-2025 Farlex, Inc Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.