Q7: Condition on for the minimum of at and
The corner points of the bounded feasible region determined by a system of linear constraints are , and . Let , where . The condition on and so that the minimum of occurs at and is
(a)
(b)
(c)
(d)
Why?
For a bounded feasible region, the minimum of occurs at a corner point. So we work out at the corners.
At : . At : .
For the minimum at both points, , so .
Why?
If the minimum occurs at two corners, takes the same smallest value at both. So the two values are equal, and gives .
Then at , , so the minimum is indeed at and .
Why?
The third corner must give a larger value, or it would share the minimum. With , , and because .
Then , which is the same at every point of the edge joining and : that edge lies on .
Answer: (b)
Chapter 12, Linear Programming: Corner point method: minimum at two corners.
Question type: Both maximum and minimum, and a tie along an edge
How to spot it: click to see
Type 3. Both maximum and minimum, and a tie along an edge
Spot it: "Minimise and maximise ". Often one rule, like , is a line through the origin.
Here: A minimum at both and means the two corner values tie: , so , that is .
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Linear Programming in past papers: question 21 of 27 · see them all