Consider the following LP problem:
max x + y
s. t.: ax + by ≤ 1
x, y ≥ 0
where a and b are real numbers. This problem is infeasible if
1) a>0, b>0.
2) a>0, b<0.
3) a<0, b<0.
4) This instance is always feasible