Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!cbosgd!gatech!seismo!uwvax!medhi
From: medhi@uwvax.UUCP (Deep {ankar} Medhi)
Newsgroups: net.math
Subject: Is this solvable in polynomial time ?
Message-ID: <723@uwvax.UUCP>
Date: Fri, 21-Mar-86 12:12:45 EST
Article-I.D.: uwvax.723
Posted: Fri Mar 21 12:12:45 1986
Date-Received: Sat, 22-Mar-86 22:41:59 EST
Organization: U of Wisconsin CS Dept
Lines: 17
Keywords: linear inequalities


 Consider the following problem :

    find an x such that   A x <= b,

         where  A is an m x n matrix and b is an m-vector.
         ( Assume that rank of A is m )


 Is there a polynomial time algorithm to find x ( i.e, just finding a
 a feasible point ) ?  Or do you know of anybody working on this 
 problem ?


 Deepankar Medhi
 ARPA : medhi@rsch.wisc.edu
 UUCP : seismo!uwvax!medhi