BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-79-703
       ENTRY:: June 19, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: A polynomial time algorithm for solving systems of linear
               inequalities with two variables per inequality
        TYPE:: Technical Report
      AUTHOR:: Aspvall, Bengt
      AUTHOR:: Shiloach, Yossi
        DATE:: January 1979
       PAGES:: 28
    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.
       NOTES:: [Adminitrivia V1/Prg/19950619]
         END:: STAN//CS-TR-79-703