Q16: Missing constraint from the graph of an LPP
A student of class XII studying Mathematics comes across an incomplete question in a book.
Maximise
Subject to the constraints ,
He/ She notices the below shown graph for the said LPP problem, and finds that a constraint is missing in it:
Help him/her choose the required constraint from the graph.
The missing constraint is
(A)
(B)
(C)
(D)
For Visually Impaired:
If , where , attains its maximum value at two of its corner points (4,0) and (0,3) of the feasible region determined by the system of linear inequalities, then
(A)
(B)
(C)
(D)
The other boundary line passes through and :
Why?
In the graph, the line of the given constraint meets the axes at and . The shaded region has one more edge, on a line that meets the axes at and .
Why?
A line with intercepts on the x-axis and on the y-axis is
Here and . Multiplying by 2 clears the fractions:
Check: gives , and gives .
The origin is not in the shaded region, and at , . So the region is .
Why?
The line splits the plane into two sides. The origin, on one side, gives . The shaded region is on the other side, so there , with the line included.
Options (A) and (D) use , the line through and , which is not in the graph. Option (C) is the origin's side.
Answer: (B)
For Visually Impaired
is maximum at both corners, so it has the same value there:
Why?
The maximum value is a single number. If it is attained at and at , then is equal at these two points (and at every point of the edge joining them).
Why?
Put the points into :
Watch out: appears on both sides and cancels, so (C) and (D), which keep , are wrong.
Answer: (A)
Chapter 12, Linear Programming: LPP: a constraint read from the feasible region.
Question type: (main question) Read the rules from a graph; (visually impaired version) Both maximum and minimum, and a tie along an edge
How to spot it: click to see
(main question) 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 missing edge meets the axes at and : , so . The origin is not in the region and gives , so the rule is .
(visually impaired version) 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 maximum at both and means the two corner values tie: , so .
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Linear Programming in past papers: question 15 of 27 · see them all