Class 12 Maths, Worked in Full Past papersGet updates
CBSE Board Examination 2025 · Section C · 3 marks

Q27: Maximise Z=x+2yZ = x + 2y graphically: an unbounded region

The question

Solve the following linear programming problem graphically :

Maximise Z=x+2yZ = x + 2y

Subject to the constraints :

x−y≥0x - y \ge 0

x−2y≥−2x - 2y \ge -2

x≥0x \ge 0⁠, y≥0y \ge 0

Exam answer

Draw the lines (graph below):

x−y=0x - y = 0 through (0,0)(0, 0) and (2,2)(2, 2)⁠;

x−2y=−2x - 2y = -2 through (−2,0)(-2, 0) and (0,1)(0, 1)⁠.

Why?

Each constraint is bounded by a straight line: write it with "==" in place of the inequality sign, and plot two points of it.

For x−y=0x - y = 0⁠: x=0x = 0 gives y=0y = 0⁠, and x=2x = 2 gives y=2y = 2⁠.

For x−2y=−2x - 2y = -2⁠: y=0y = 0 gives x=−2x = -2⁠, and x=0x = 0 gives y=1y = 1⁠.

At the test point (1,0)(1, 0)⁠: 1≥01 \ge 0 and 1≥−21 \ge -2 are true, so shade the side of each line that contains (1,0)(1, 0)⁠. With x,y≥0x, y \ge 0⁠, the feasible region is the shaded region. It is unbounded.

Why?

A point that is not on a line tells us which side of the line to keep. At (1,0)(1, 0)⁠: x−y=1x - y = 1⁠, which is ≥0\ge 0⁠, and x−2y=1x - 2y = 1⁠, which is ≥−2\ge -2⁠. Both are true, so keep the side containing (1,0)(1, 0) for both lines.

x≥0x \ge 0⁠, y≥0y \ge 0 keep only the first quadrant. The region is unbounded: every point (n,0)(n, 0) with n≥0n \ge 0 satisfies all four constraints, however large nn is.

At A, putting x=yx = y in x−2y=−2x - 2y = -2⁠: −y=−2-y = -2⁠, so y=2y = 2 and x=2x = 2⁠.

Why?

The corner A is where the two lines meet, so solve their equations together. From x−y=0x - y = 0⁠, x=yx = y⁠; substitute in the other equation.

y−2y=−2−y=−2y=2x=y=2\begin{aligned} y - 2y &= -2 \\ -y &= -2 \\ y &= 2 \\ x &= y = 2 \end{aligned}

The other corner is the origin OO⁠, where x−y=0x - y = 0 meets the xx-axis.

−2 2 4 6 8 2 4 x y O A(2, 2) x − y = 0 x − 2y = −2 x + 2y = 6
The feasible region (shaded) is unbounded, with corners O(0, 0) and A(2, 2). The dashed line is x+2y=6x + 2y = 6⁠.
CornerZ=x+2yO(0,0)0A(2,2)6\begin{array}{c|c} \text{Corner} & Z = x + 2y \\ \hline O(0, 0) & 0 \\ A(2, 2) & 6 \end{array}
Why?

Corner point method: work out ZZ at every corner of the feasible region. For a bounded region, the largest of these values is the maximum.

O: 0+2(0)=0+0=0A: 2+2(2)=2+4=6\begin{aligned} O&:\ 0 + 2(0) = 0 + 0 = 0 \\ A&:\ 2 + 2(2) = 2 + 4 = 6 \end{aligned}

Here the region is unbounded, so 66 is only a candidate. It must be checked before we can call it the maximum.

The region is unbounded, so draw the half-plane x+2y>6x + 2y > 6 (above the dashed line). It has points in common with the feasible region, for example (8,0)(8, 0)⁠, where Z=8>6Z = 8 > 6⁠.

Why?

The rule for an unbounded region: M=6M = 6 is the maximum only if the open half-plane x+2y>6x + 2y > 6 has no point in common with the feasible region.

(8,0)(8, 0) is feasible: 8−0≥08 - 0 \ge 0⁠, 8−0≥−28 - 0 \ge -2⁠, 8≥08 \ge 0 and 0≥00 \ge 0⁠. It gives Z=8+2(0)=8Z = 8 + 2(0) = 8⁠, more than 66⁠. In fact Z=nZ = n at (n,0)(n, 0)⁠, so ZZ grows without limit.

Watch out: do not write "maximum =6= 6" just because 66 is the largest corner value.

∴ Z\therefore\ Z has no maximum value.

Where this comes from

Chapter 12, Linear Programming: LPP: unbounded region, no maximum.

Question type: An unbounded region with no maximum

How to spot it: click to see

Type 5. An unbounded region with no maximum

Spot it: the region goes on for ever, and ZZ keeps growing as you move out into it.

Here: The region is unbounded and the table gives M=6M = 6 at A(2,2)A(2, 2)⁠. But (8,0)(8, 0) is in the region, on the side x+2y>6x + 2y \gt 6⁠, with Z=8Z = 8⁠, so ZZ has no maximum value.

Found an error?

Tell us if something on this page is wrong or unclear. Send feedback on this question →