Q18: Number of corner points for , ,
The number of corner points of the feasible region determined by the constraints , , , is :
(a)
(b)
(c)
(d)
The boundary lines are , , and .
Putting in :
The lines and meet at .
Why?
A corner point is a point where two boundary lines meet and which satisfies every constraint. So we find where each pair of lines meets, then test each point.
is the same as , which is why we can put into the other equation.
Then gives .
meets both axes at .
meets at and at .
fails , and fails .
Why?
Where meets the axes:
At : , which is negative. At : , which is negative. So neither point is in the feasible region.
and satisfy all four constraints. For example, at : and .
The feasible region is unbounded, with corner points and .
Why?
The region lies above , below and below . Its edges run from along to , then along for ever, and from along the -axis for ever.
Points such as satisfy every constraint, so the region is unbounded. Its only corners are and , so there are 2.
Answer: (a)
Chapter 12, Linear Programming: Corner points of a feasible region.
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Linear Programming in past papers: question 11 of 27 · see them all