Abstract
In 1979 a note of L. G. Khachiyan indicated how an algorithm, the so-called ellipsoid method, originally devised for nonlinear nondifferentiable optimization, can be modified in order to check the feasibility of a system of linear inequalities in polynomial time. This result caused great excitement in the world of mathematical programming since it implies the polynomial time solvability of linear programming problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Grötschel, M., Lovász, L., Schrijver, A. (1993). The Ellipsoid Method. In: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78240-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-78240-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-78242-8
Online ISBN: 978-3-642-78240-4
eBook Packages: Springer Book Archive