Let $Ax \leq b$ be the $m$ inequalities of a linear program in $n$ variables and all entries of $A,b$ be from -1, 0,1. What values of $r, R$ can be supplied to the Ellipsoid algorithm so that when it terminates it either finds a feasible point or realizes that the feasible set must be lower dimensional or empty?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.