(1, 7) and (5, 3) are two feasible solutions of a linear programming problem. Which of the following must also be a feasible solution of the same problem?
Answer & explanation
Correct answer: option 1
The correct answer is Option (1) → (3, 5)
Let \(ax + by \le c\) be any constraint of the problem (a “\(\ge\)” constraint is handled the same way). Both given points satisfy it:
\(a + 7b \le c\)
\(5a + 3b \le c\)
Adding and halving,
\(3a + 5b \le c\)
So the midpoint (3, 5) satisfies every linear constraint, and it is a feasible solution. In the same way, every point of the segment joining two feasible points is feasible.
Why the other options are incorrect
Option (2) (5, 7) — Incorrect. The constraint \(x + y \le 8\) holds at (1, 7) and (5, 3), but \(5 + 7 = 12 \gt 8\).
Option (3) (1, 3) — Incorrect. The constraint \(x + y \ge 8\) holds at (1, 7) and (5, 3), but \(1 + 3 = 4 \lt 8\).
Option (4) (6, 10) — Incorrect. The constraint \(x + y \le 8\) holds at (1, 7) and (5, 3), but \(6 + 10 = 16 \gt 8\).