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

Q30: Minimise Z=13x−15yZ = 13x - 15y graphically

The question

Solve the following linear programming problem graphically :

Minimize Z=13x−15yZ = 13x - 15y

Subject to constraints

x+y≤7x + y \le 7⁠,

2x−3y+6≥02x - 3y + 6 \ge 0⁠,

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

Exam answer

Draw the lines (graph below):

x+y=7x + y = 7 through (7,0)(7, 0) and (0,7)(0, 7)⁠;

2x−3y+6=02x - 3y + 6 = 0 through (−3,0)(-3, 0) and (0,2)(0, 2)⁠.

Why?

Each inequality is bounded by a straight line, found by writing "=" in place of the inequality sign. Two points fix a line, and the easiest are where it meets the axes.

For x+y=7x + y = 7⁠: y=0y = 0 gives x=7x = 7⁠, and x=0x = 0 gives y=7y = 7⁠.

For 2x−3y+6=02x - 3y + 6 = 0⁠: y=0y = 0 gives 2x=−62x = -6⁠, so x=−3x = -3⁠. And x=0x = 0 gives −3y=−6-3y = -6⁠, so y=2y = 2⁠.

At (0,0)(0, 0)⁠: 0≤70 \le 7 and 6≥06 \ge 0 are true, so shade the side of each line that contains the origin. With x,y≥0x, y \ge 0⁠, the feasible region is OABC (shaded). It is bounded.

Why?

A line splits the plane into two sides, and an inequality holds on one whole side. Testing one point that is not on the line tells us which side. The origin is the easiest test point.

At (0,0)(0, 0)⁠: x+y=0x + y = 0⁠, which is ≤7\le 7⁠. And 2x−3y+6=62x - 3y + 6 = 6⁠, which is ≥0\ge 0⁠.

x≥0x \ge 0⁠, y≥0y \ge 0 keep us in the first quadrant. The feasible region is where all four conditions hold at once.

At B, putting x=7−yx = 7 - y in 2x−3y=−62x - 3y = -6⁠: 14−5y=−614 - 5y = -6⁠, so y=4y = 4 and x=3x = 3⁠.

Why?

B is where the two lines cross, so its coordinates satisfy both equations. Solve them together.

From x+y=7x + y = 7⁠, x=7−yx = 7 - y⁠. Then 2(7−y)−3y=14−5y2(7 - y) - 3y = 14 - 5y⁠, so −5y=−20-5y = -20 and y=4y = 4⁠.

The second line 2x−3y+6=02x - 3y + 6 = 0 is the same as 2x−3y=−62x - 3y = -6⁠. Then:

2(7−y)−3y=−614−2y−3y=−614−5y=−6−5y=−6−14=−20y=−20−5=4x=7−4=3\begin{aligned} 2(7 - y) - 3y &= -6 \\ 14 - 2y - 3y &= -6 \\ 14 - 5y &= -6 \\ -5y &= -6 - 14 = -20 \\ y &= \frac{-20}{-5} = 4 \\ x &= 7 - 4 = 3 \end{aligned}

Check: 3+4=73 + 4 = 7 and 2(3)−3(4)+6=02(3) - 3(4) + 6 = 0⁠.

2(3)−3(4)+6=6−12+6=02(3) - 3(4) + 6 = 6 - 12 + 6 = 0
x y O −3 −2 −1 1 2 3 4 5 6 7 1 3 4 5 6 7 A(7, 0) B(3, 4) C(0, 2) (−3, 0) (0, 7) x + y = 7 2x − 3y + 6 = 0 OABC
The feasible region OABC (shaded), drawn with equal scales. Its corners are O(0, 0), A(7, 0), B(3, 4) and C(0, 2).
CornerZ=13x−15yO(0,0)0A(7,0)91B(3,4)−21C(0,2)−30←min\begin{array}{c|c} \text{Corner} & Z = 13x - 15y \\ \hline O(0, 0) & 0 \\ A(7, 0) & 91 \\ B(3, 4) & -21 \\ C(0, 2) & -30 \leftarrow \text{min} \end{array}
Why?

Corner point method: if ZZ has a minimum on the feasible region, it occurs at a corner. So we only need ZZ at the corners:

A:13(7)−15(0)=91−0=91B:13(3)−15(4)=39−60=−21C:13(0)−15(2)=0−30=−30\begin{aligned} A&: 13(7) - 15(0) \\ &= 91 - 0 = 91 \\[4pt] B&: 13(3) - 15(4) \\ &= 39 - 60 = -21 \\[4pt] C&: 13(0) - 15(2) \\ &= 0 - 30 = -30 \end{aligned}

At O both terms are 0.

The smallest of 00⁠, 9191⁠, −21-21⁠, −30-30 is −30-30⁠, at C.

The region is bounded, so the smallest value in the table is the minimum of ZZ⁠.

Why?

On a bounded feasible region, ZZ always has both a maximum and a minimum, so the smallest corner value is the answer.

Watch out: if the region were unbounded, we would also need to check that the half-plane 13x−15y<−3013x - 15y < -30 has no point in common with the region.

∴\therefore Minimum Z=−30Z = -30 at x=0x = 0⁠, y=2y = 2⁠.

Where this comes from

Chapter 12, Linear Programming: LPP: minimise graphically, bounded region.

Question type: Find the maximum

How to spot it: click to see

Type 1. Find the maximum: lines, shading, corners, table

Spot it: "Maximise ZZ" with "≤\le" rules that have only plus signs, like x+2y≤10x + 2y \le 10⁠. The region is then a closed shape with a corner at the origin.

Here: Both rules, x+y≤7x + y \le 7 and 2x−3y+6≥02x - 3y + 6 \ge 0⁠, hold at (0,0)(0, 0)⁠, so shade the origin's side: a closed region OABC. Solve the two lines for B(3,4)(3, 4)⁠; since a minimum is asked, take the smallest value, −30-30 at (0,2)(0, 2)⁠.

Found an error?

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