The Ellipsoid Method

  • Martin Grötschel
  • László Lovász
  • Alexander Schrijver
Part of the Algorithms and Combinatorics book series (AC, volume 2)


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.


Polynomial Time Convex Body Elementary Step Informal Description Ellipsoid Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Martin Grötschel
    • 1
  • László Lovász
    • 2
  • Alexander Schrijver
    • 3
  1. 1.Institute of MathematicsUniversity of AugsburgAugsburgFed. Rep. of Germany
  2. 2.Department of Computer ScienceEötvös Loránd UniversityBudapestHungary
  3. 3.Department of EconometricsTilburg UniversityTilburgThe Netherlands

Personalised recommendations