Abstract.
We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex, ellipsoid, interior-point, and other methods.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: June 22, 2000 / Accepted: April 4, 2001¶Published online October 2, 2001
Rights and permissions
About this article
Cite this article
Todd, M. The many facets of linear programming. Math. Program. 91, 417–436 (2002). https://doi.org/10.1007/s101070100261
Published:
Issue Date:
DOI: https://doi.org/10.1007/s101070100261