Consider the linear programming problem:
$Minimize$ $z=-2x-5y$ subject to $3x+4y\ge 5$ , $x\ge 0$ , $y\ge 0$.
Which is correct ?
(A) Set of feasible solutions is empty.
(B) Set of feasible solution is non-empty but there are no optimal solution.
(C) Optimal value is attained at $(0,5/4)$.
(D) Optimal value is attained at $(5/3,0)$.
I have no idea about this problem..I tried to draw the figure but I did not get any region , as there are only one constraint is given..I could not deal with only one constraint..How I solve this?
