We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n 3.5 L) arithmetic operations onO(L) bit numbers, wheren is the number of variables andL is the number of bits in the input. The running-time of this algorithm is better than the ellipsoid algorithm by a factor ofO(n 2.5). We prove that given a polytopeP and a strictly interior point a εP, there is a projective transformation of the space that mapsP, a toP′, a′ having the following property. The ratio of the radius of the smallest sphere with center a′, containingP′ to the radius of the largest sphere with center a′ contained inP′ isO(n). The algorithm consists of repeated application of such projective transformations each followed by optimization over an inscribed sphere to create a sequence of points which converges to the optimal solution in polynomial time.
AMS subject classification (1980)90 C 05
Unable to display preview. Download preview PDF.
- H. S. M. Coxeter,Introduction to Geometry, Wiley (1961).Google Scholar
- V. Klee andG. L. Minty, How good is the simplex algorithm? inInequalities III, (ed. O. Shisha) Academic Press, New York, 1972, 159–179.Google Scholar
- O. Veblen andJ. W. Young,Projective Geometry, 1–2, Blaisdell, New York, (1938).Google Scholar
- R. J. Walker,Algebraic Curves, Princeton University Press (1950).Google Scholar