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 :
Answer & explanation
Correct answer: option 4
The correct answer is Option (4) → every point on the line segment joining the points (0, 2) and (3,0)
$F=4x+6y$
| Points | F values |
| (0, 2) | 12 |
| (3, 2) | 12 |
| (4, 1) | 22 |
| (2, 3) | 26 |
| (0, 3) | 18 |
$F_{min}$ at all points joining (0, 2) and (3, 0)