Question

A linear programming problem is as follows:

Minimize Z = 30x + 50y

Subject to the constraints: 3x + 5y ≥ 15, 2x + 3y ≤ 18, x ≥ 0, y ≥ 0

In the feasible region, the minimum value of Z occurs at:

Options

• a unique point

• no point

• infinitely many points

• two points only

Answer 1

infinitely many points

Explanation:

Corner points of the feasible region	Z = 30x + 50y
(5, 0)	150
(9, 0)	270
(0, 3)	150
(0, 6)	300

The minimum value of Z occurs at infinitely many points.