The feasible region of a linear programming problem is given by , , , , , and the objective is to minimise .
Which of the following points is not an optimal solution?
Confirming your payment
Practice Questions · Question 19 of 30
The feasible region of a linear programming problem is given by , , , , , and the objective is to minimise .
Which of the following points is not an optimal solution?
(A)
(B)
(C)
(D)
Option (B) is correct.
Corner points.
The point , where meets the -axis, breaks , so it is not a corner. The region is the bounded triangle with these three vertices.
| Corner point | |
|---|---|
The minimum value occurs at two corners. By the Remark after Example 3, every point of the segment joining and is also optimal. That segment is the part of with .
Checking each option
Lying on the line is not enough: an optimal solution must first be a point of the feasible region.