Practicing Success
Corner points of the feasible region for a linear programming problem are (0, 2), (3, 0), (6, 0), (6, 8) and (0,5). Let F = 4x + 6y be the objective function. Then the minimum value of F occurs at : |
(0, 2) only (3, 0) only The mid point 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) |
Objective function F(x, y) = 4x + 6y
|