The Ellipsoid Method
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.
KeywordsPolynomial Time Convex Body Elementary Step Informal Description Ellipsoid Method
Unable to display preview. Download preview PDF.