# An algorithm for linear programming which requires O(((*m+n*)*n*^{2}+(*m+n*)^{1.5}*n*)*L*) arithmetic operations

Article

- Received:
- Revised:

DOI: 10.1007/BF01580859

- Cite this article as:
- Vaidya, P.M. Mathematical Programming (1990) 47: 175. doi:10.1007/BF01580859

## Abstract

We present an algorithm for linear programming which requires O(((*m+n*)*n*^{2}+(*m+n*)^{1.5}*n*)*L*) arithmetic operations where*m* is the number of constraints, and*n* is the number of variables. Each operation is performed to a precision of O(*L*) bits.*L* is bounded by the number of bits in the input. The worst-case running time of the algorithm is better than that of Karmarkar's algorithm by a factor of\(\sqrt {m + n} \).

### Key words

Optimizationlinear programmingcomplexitypolynomial time algorithms## Copyright information

© The Mathematical Programming Society, Inc. 1990