Language:   Search:   Contact
World of
Mathematics Database
»ZBMATH« MSC 2000
MSC 2010 Reviewer
Service Subscription
»ZBMATH«
ZBMATH Database | Advanced Search Print
Read more | Try MathML | Hide
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

ZBMATH Database Simple Search Advanced Search Command Search

Advanced Search

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 0735.90044
Megiddo, Nimrod
On the complexity of linear programming. (English)
[A] Advances in economic theory, Pap. World Congr. Econ. Soc., Cambridge/MA (USA) 1985, Econ. Soc. Monogr. 12, 225-268 (1989).

Summary: [For the entire collection see Zbl 0732.00024.]\par This is a partial survey of results on the complexity of the linear programming problem since the ellipsoid method. The main topics are polynomial and strongly polynomial algorithms, probabilistic analysis of simplex algorithms, and recent interior point methods.
MSC 2000:
*90C05 Linear programming
90C60 Abstract computational complexity for math. programming problems
90-02 Research monographs (optimization)

Keywords: survey; ellipsoid method; strongly polynomial algorithms; probabilistic analysis; interior point methods

Citations: Zbl 0732.00024

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering

Login Username: Password:

Highlights
Scientific prize winners of the ICM 2010
Overhang
Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Master Server

Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites

Copyright © 2013 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster