A linear programming problem is as follows:
ššššššš§š š = 30š„ + 50š¦
subject to the constraints,
3š„ + 5š¦ ≥ 15
2š„ + 3š¦ ≤ 18
š„ ≥ 0,š¦ ≥ 0
In the feasible region, the minimum value of Z occurs at
(a) a unique point (b) no point
(c) infinitely many points (d) two points only