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
$F(0,2)=4(0)+6(2)=12$
$F(3,0)=4(3)+6(0)=12$
$F(6,0)=4(6)+6(0)=24$
$F(0,5)=4(0)+6(5)=30$
∴ Minimum at (0, 2) and (3, 0) ⇒ the line will constitute.