# A new polynomial-time algorithm for linear programming

- 1.3k Downloads
- 1.8k Citations

## Abstract

We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requires*O*(*n* ^{3.5} *L*) arithmetic operations on*O*(*L*) bit numbers, where*n* is the number of variables and*L* is the number of bits in the input. The running-time of this algorithm is better than the ellipsoid algorithm by a factor of*O*(*n* ^{2.5}). We prove that given a polytope*P* and a strictly interior point a ε*P*, there is a projective transformation of the space that maps*P*, a to*P′*, a′ having the following property. The ratio of the radius of the smallest sphere with center a′, containing*P′* to the radius of the largest sphere with center a′ contained in*P′* is*O*(*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## Preview

Unable to display preview. Download preview PDF.

## References

- [1]
- [2]G. B. Dantzig,
*Linear Programming and Extensions*, Princeton University Press, Princeton, NJ (1963).zbMATHGoogle Scholar - [3]M. Grötschel, L. Lovász andA. Schrijver, The Ellipsoid Method and its Consequences in Combinatorial Optimization,
*Combinatorica***1**(1981), 169–197.zbMATHMathSciNetGoogle Scholar - [4]L. G. Khachiyan, A polynomial Algorithm in Linear Programming,
*Doklady Akademii Nauk SSSR***244**:S (1979), 1093–1096, translated in*Soviet Mathematics Doklady***20**:1 (1979), 191–194.zbMATHMathSciNetGoogle Scholar - [5]V. Klee andG. L. Minty, How good is the simplex algorithm? in
*Inequalities III*, (ed. O. Shisha) Academic Press, New York, 1972, 159–179.Google Scholar - [6]
- [7]