Q11: Which inequality is not a constraint of the shaded feasible region
The feasible region corresponding to the linear constraints of a Linear Programming Problem is given below.
Which of the following is not a constraint to the given Linear Programming Problem?
(a)
(b)
(c)
(d)
The shaded region lies on the same side of as the origin .
Why?
A line splits the plane into two half-planes. On one side , and on the other .
To find which inequality a region satisfies, test one point that is not on the line. The origin is the easiest.
At , , so the region satisfies , not .
Why?
Check with a corner of the region, : , so fails there.
Watch out: points on the line itself satisfy both and , so always test a point off the line.
For : at , . The region is on the other side, so .
For : at , . The region is on the same side, so .
So (a), (b) and (d) are constraints, and (c) is not.
Why?
Check with the corner : and .
The question asks for the inequality that is not a constraint, so the answer is (c).
Answer: (c)
Chapter 12, Linear Programming: Reading constraints from a feasible region.
Question type: Read the rules from a graph
How to spot it: click to see
Type 7. Read the rules from a graph
Spot it: the graph of the region is given, and the question asks for its constraints, or for the rule that is missing.
Here: The region lies on the origin's side of , where , so its rule is . Checked the same way, (a), (b) and (d) are rules, so (c) is not.
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Linear Programming in past papers: question 22 of 27 · see them all