Exercise 12.1 · Q3: Maximise : the maximum at
Solve the following Linear Programming Problems graphically:
Maximise
subject to , , , .
Draw the lines (graph):
through and ;
through and .
At : and are true, so shade the side of each line that contains the origin. With , the feasible region is OABC (shaded). It is bounded.
At B, multiply by 5 and by 2, then subtract:
So , and , so .
At B, .
Since , , so it is the largest value. The region is bounded, so it is the maximum of .
Maximum at .
Want the reason behind every step, the basics and the checks?
The method is the same as always: draw, shade, find the corners, make the table. What is new is that the best corner is the crossing point of two lines whose coordinates are fractions. The variables and may take any real values here, so a fractional corner is a perfectly good answer.
- Given
- and the constraints , , , .
- To find
- The maximum value of on the feasible region, and where it occurs.
- Plan
- (1) and (2) Draw each line and choose its side. (3) Shade the feasible region and see that it is bounded. (4) Find the corners, solving for the crossing point exactly. (5) Make the table of . (6) Compare the values and read off the maximum.
Basics you need
For , put , then , and join the two points. Basics: where a line meets the axes
Put into the inequality: true means shade the origin's side, false means the other side. Basics: one side of a line
Multiply the equations so that one unknown has the same coefficient in both, then subtract. Basics: a corner solves two equations
If the region can be enclosed in a circle, has a maximum and a minimum on it, and each occurs at a corner point (Section 12.2.2). Basics: bounded or not
because and .
Solution
Draw the line and choose its side
Put : , so . Put : , so . So the line joins and .
Test in : is true, so this constraint keeps the side of the line that contains the origin.
The boundary of the inequality is the line with "" in place of "", and the axis points are the quickest points on it. One test point then picks the side.Draw the line and choose its side
Put : , so . Put : , so . So the line joins and .
Test in : is true, so again the origin's side is kept.
This line is the steeper of the two: it meets the -axis sooner (at 2 instead of 5) and the -axis higher (at 5 instead of 3). So the two lines must cross inside the first quadrant.Shade the feasible region
The constraints , keep the first quadrant. The part of it on the origin's side of both lines is the quadrilateral OABC:
The feasible region OABC of Exercise 12.1 Q3 (shaded), drawn with equal scales. Its corners are O(0, 0), A(2, 0), B and C(0, 3); the points and are outside the region. OABC is bounded: every corner is at most 3 from O, so a circle about O of radius 4 encloses it.
The feasible region is where all four kept sides overlap. Because it is bounded, the largest corner value will certainly be the maximum.Find the corner points
O , where the axes meet.
A , where meets the -axis. The other line meets the -axis at , but there , so breaks and is not a corner.
C , where meets the -axis. The point breaks : .
B, where the two lines cross. Multiply by 5 and by 2, so that has the coefficient 10 in both, and subtract:
Then from : , so .
So B is . It lies on the other line too: , and both coordinates are positive.
The two lines and the two axes cross in six points; only the four that obey every constraint are corners. Here neither unknown has matching coefficients, so we first multiply to make the -coefficients equal. Putting B back into the second equation catches any arithmetic slip.Work out at each corner
Corner point O A B ← largest C To compare: , so , which is more than 12, and so more than 10 and 9.
By Theorem 1 the maximum is at a corner, so these four values are the only candidates. Keeping B's value as an exact fraction avoids rounding, and writing 12 as makes the comparison exact.Conclude
The region is bounded, so by Theorem 2 the largest value in the table is the maximum of : maximum at .
Moving from A along the edge towards B, falls by 2 for every 5 that rises, so changes by : it improves all the way to B. Moving on from B along towards C, falls by 5 for every 3 that rises, so changes by : it gets worse. So B is the top.
The feasible region is bounded, with corners , , and , and
(Textbook answer: Maximum at .)
A direct proof that nothing beats : , since and . On the region the brackets are at most 15 and 10, so , with equality only where both lines meet, at B ✓.
In decimals: B is about and ; indeed , which matches up to the rounding of the coordinates ✓.
A computer check of the 8 whole-number points of the region found the largest value 11, at , below : the maximum is at a point with fractional coordinates, which the problem allows ✓.
- Rounding B too early. With B as you get , not the exact . Keep fractions.
- Using or as a corner. Each lies on one line but breaks the other constraint.
- An elimination slip. Multiplying to match the -coefficients gives ; check B in both equations.
- Thinking the answer must be whole numbers. Nothing in this problem asks for whole numbers; the maximum is at a fractional corner.
- Solve for the crossing point exactly and substitute it back into both equations.
- Compare fractions exactly, for example by writing a whole number with the same denominator.
- The same steps with whole-number corners: Exercise 12.1 Q2 and Example 1.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| A line from its axis points; a test point chooses the side | Steps 1, 2 | Class XI, Linear Inequalities (Basics, Basics) |
| Feasible region: common region of all the constraints | Step 3 | Section 12.2.2 (Basics) |
| Bounded: can be enclosed within a circle | Step 3 | Section 12.2.2, footnote to Theorem 2 (Basics) |
| Corner point: where two boundary lines meet; elimination | Step 4 | Section 12.2.2, footnote to Theorem 1; Class X, Pair of Linear Equations (Basics) |
| Theorem 1 and Theorem 2 | Steps 5, 6 | Section 12.2.2 |
| Corner Point Method, step 3(i): bounded region | Step 6 | Section 12.2.2 (Lesson) |
| Answer | Result | NCERT answer key, Exercise 12.1 Q3 |
| All values | Steps, Check | Recomputed with exact fractions in the site's verification script |
Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →