Karmarkar's algorithm

Also found in: Wikipedia

0.04 sec.

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.

How to thank TFD for its existence? Tell a friend about us, add a link to this page, add the site to iGoogle, or visit webmaster's page for free fun content.

?Page tools

Printer friendly
Cite / link

Email
Feedback

? Mentioned in

? References in periodicals archive

No references found

This improvement could give Karmarkar's algorithm a decided edge among the competing methods used to solve these problems.

A parallel path for speedy solutions by Peterson, Ivars / Science News

More results

Encyclopedia browser

? Full browser

karma
Kármán constant
Kármán swirling flow problem
Kármán vortex street
Karman, Theodor von
Kármán, Theodore von
Kármán-Tsien method
Karmarkar's algorithm
Karmathians
Karmel, Peter
Karnak
Karnal
Karnataka
Karnaugh map
Karnian

Encyclopedia

Free Tools:	For surfers: Free toolbar & extensions \| Word of the Day \| Help For webmasters: Free content \| Linking \| Lookup box \| Double-click lookup \| Partner with us

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. Terms of Use.