An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1. 5 n)L) Arithmetic Operations

We present an algorithm for linear programming which requires Ο ((( m + n ) n 2 + ( 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.

Authors

• Pravin M. Vaidya

Keywords

No keywords are indexed for this paper.