Skip to main content
Conference ProceedingsOPEN ACCESS

ALGORITHM FOR LINEAR PROGRAMMING WHICH REQUIRES O(((m plus n)n**2 plus (m plus n)**1**. **5n)L) ARITHMETIC OPERATIONS.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing (1987) 29-38
ISSN: 07349025
57Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We present an algorithm for linear programming which requires O(((m plus n)n**2 plus (m plus n)**1**. **5n)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 O(L) bits. L is bounded by the number of bits in the input.

Cite

CITATION STYLE

APA

Vaidya, P. M. (1987). ALGORITHM FOR LINEAR PROGRAMMING WHICH REQUIRES O(((m plus n)n**2 plus (m plus n)**1**. **5n)L) ARITHMETIC OPERATIONS. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 29–38). ACM.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free