A new polynomial-time algorithm for linear programming

@article{Karmarkar1984ANP,
title={A new polynomial-time algorithm for linear programming},
author={N. Karmarkar},
journal={Combinatorica},
year={1984},
volume={4},
pages={373-395}
}

We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n3.5L) 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(n2.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… Expand