An algorithm for linear programming which requires O(((m+n)nz+(m+n)1n)) arithmetic operations
- 1 January 1987
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
We present an algorithm for linear programming which requires &Ogr;(((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 &Ogr; (L) bits. L is bounded by the number of bits in the input.Keywords
This publication has 0 references indexed in Scilit: