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:

any point on the line joining the points (0, 2) and (3, 0) only

The correct answer is Option (3) → any point on the line joining the points (0, 2) and (3, 0) only