Corner points of the feasible region for a linear programming problem are (0, 2), (3, 0), (6, 0) and (0, 5). Let F = 4x + 6y be the objective function. The minimum value of F occurs at:
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → any point on the line joining the points (0, 2) and (3, 0) only
The minimum of F is reached at a corner point. Values of F = 4x + 6y at the corners:
\(F(0, 2) = 0+12 = 12\)
\(F(3, 0) = 12+0 = 12\)
\(F(6, 0) = 24+0 = 24\)
\(F(0, 5) = 0+30 = 30\)
The least value, 12, is reached at two adjacent corners, (0, 2) and (3, 0). When the optimum occurs at two adjacent corners, every point of the segment joining them gives the same value. So F is minimum, 12, at every point of the segment joining (0, 2) and (3, 0).
Why the other options are incorrect
Option (1) (0, 2) only — Incorrect. F(3, 0) = 12 as well, so the minimum is not reached at (0, 2) alone.
Option (2) (3, 0) only — Incorrect. F(0, 2) = 12 as well, so the minimum is not reached at (3, 0) alone.
Option (4) the mid point of the line segment joining the points (0, 2) and (3, 0) only. — Incorrect. The mid point (1.5, 1) does give F = 12, but so does every other point of the segment, so “only” is false.