Q17: Corner points for , ,
The number of corner points of the feasible region determined by constraints , , is :
(A)
(B)
(C)
(D)
The line meets the axes at and .
Why?
Put in to get , the point . Put to get , the point .
Testing in : is false. So the region lies on the side of the line away from the origin.
Why?
To shade an inequality, test one point not on the line. The origin is the easiest. If it fails, the region is the other side of the line.
and keep us in the first quadrant.
The feasible region is the unbounded part of the first quadrant on or above this line. Its corner points are and .
Why?
A corner point is a vertex of the feasible region: a point where two boundary lines meet and which satisfies every constraint.
The boundary lines , and meet in pairs at , and . The point is not in the region, as the test showed, so it is not a corner point.
Watch out: an unbounded region can still have corner points. Here there are two.
Answer: (C)
Chapter 12, Linear Programming: Corner points of a feasible region.
Question type: A "" rule
How to spot it: click to see
Type 2. A "" rule: shade away from the origin
Spot it: a rule like , often with "Minimise ". The region no longer touches the origin.
Here: For , is false at the origin, so the region is the side of away from it. That leaves an unbounded region with just two corners, and .
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Linear Programming in past papers: question 8 of 27 · see them all