Consider the following L.P.P.
Minimize \(z = 400x + 300y\), subject to \(100x + 200y \ge 12000, 300x + 400y \ge 20000, 200x + 100y \ge 15000\) and \(x, y \ge 0\). Then
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → its feasible region is unbounded and optimal point is (60, 30)
Dividing each constraint by 100:
\(x + 2y \ge 120\)
\(3x + 4y \ge 200\)
\(2x + y \ge 150\)
All the constraints are of the “≥” type, so the region lies on the side of each line away from the origin and goes on without end: the feasible region is unbounded.
The second constraint is redundant: adding the other two gives \(3x + 3y \ge 270\), so \(3x + 4y \ge 270 \gt 200\) already. The corner points come from x + 2y = 120, 2x + y = 150 and the axes:
on the y-axis: (0, 150)
x + 2y = 120 and 2x + y = 150 meet at (60, 30)
on the x-axis: (120, 0)
Values of z:
\(z(0, 150) = 45000\)
\(z(60, 30) = 24000 + 9000 = 33000\)
\(z(120, 0) = 48000\)
Since the region is unbounded, check that no feasible point gives \(400x + 300y \lt 33000\), that is \(4x + 3y \lt 330\). For every feasible point:
\( \displaystyle 4x + 3y = \frac{5}{3}(2x + y) + \frac{2}{3}(x + 2y) \)
\( \displaystyle 4x + 3y \ge \frac{5}{3}(150) + \frac{2}{3}(120) = 330 \)
So the minimum, 33000, is at the optimal point (60, 30). The points (0, 110) and (30, 70) are not even feasible: there 2x + y is 110 and 130, less than 150.