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