Consider points of the feasible region for a linear programming are (0, 2), (3, 0), (4, 1), (2, 3) and (0, 3). Let $F= 4x+6y $ be the objective function. The minimum value of F occurs at : |
(0, 2) only (3, 0) only mid points of the line segment joining the points (0, 2) and (3, 0) only every point on the line segment joining the points (0, 2) and (3,0) |
every point on the line segment joining the points (0, 2) and (3,0) |
The correct answer is Option (4) → every point on the line segment joining the points (0, 2) and (3,0) $F=4x+6y$
$F_{min}$ at all points joining (0, 2) and (3, 0) |