Question

The feasible region of a linear programming problem is bounded but the objective function attains its minimum value at more than one point. One of the points is (5, 0).

Then one of the other possible points at which the objective function attains its minimum value is:

Options

• (2, 9)

• (6, 6)

• (4, 7)

• (0, 0)

Answer 1

(2, 9)

Explanation:

The student may read the point (2, 9) from the line on the graph.

The student may find the equation 3x + y = 15 joining (5, 0) and (0, 15) and then verify the point (2, 9) satisfies it.