Institution: Stanford University, Department of Computer Science

Title: A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality

Author: Aspvall, Bengt

Author: Shiloach, Yossi

Date: January 1979

Abstract: We present a constructive algorithm for solving systems of linear inequalities (LI) with at most two variables per inequality. The algorithm is polynomial in the size of the input. The LI problem is of importance in complexity theory since it is polynomial time equivalent to linear programming. The subclass of LI treated in this paper is also of practical interest in mechanical verification systems, and we believe that the ideas presented can be extended to the general LI problem.

http://i.stanford.edu/pub/cstr/reports/cs/tr/79/703/CS-TR-79-703.pdf