Answers are grounded in this paper and cite their sources.
We present an algorithm for linear programming which requires Ο(((m + n) n2 + (m + n)1.5 n) L) arithmetic operations where m is the number of inequalities, and n is the number of variables. Each operation is performed to a precision of Ο (L) bits. L is bounded by the number of bits in the input.
No takes yet. Share an insight, caveat, or question.
Pravin M. Vaidya (1987) studied this question.