Consider the following instance of LP Max x + y s.t.: ax + by <= 1 x,y >= 0 where a, b are real parameters. This problem is infeasible when: a>0, b>0 a<0, b<0 This problem is always feasible. a>0, b<0