Skip to main content
Chapter 12 of 15
NCERT Solutions

Linear Programming

CBSE · Class 12 · Mathematics

NCERT Solutions for Linear Programming — CBSE Class 12 Mathematics.

95 questions56 flashcards5 concepts

Interactive on Super Tutor

Studying Linear Programming? Get the full interactive chapter.

Quizzes, flashcards, AI doubt-solver and a step-by-step study plan — built for ncert solutions and more.

1,000+ Class 12 students started this chapter today

A comparison chart showing two graphs: one with a bounded feasible region and another with an unbounded feasible region, explaining the implications for optimal solutions.
Super Tutor

Learn better with visuals Super Tutor has hundreds of illustrations like this across every chapter — all free to try.

Get started
10 Questions Solved · 1 Section

5 worked solutions below. Unlock all 10 free in Super Tutor

EXERCISE 12.1

1Maximise Z=3x+4yZ = 3x + 4y

subject to the constraints : x+y4,x0,y0x + y \leq 4, x \geq 0, y \geq 0.
Show solution
The feasible region is the triangle with corner points (0,0)(0,0), (4,0)(4,0) and (0,4)(0,4).

Evaluate Z=3x+4yZ=3x+4y at each corner point:

- At (0,0)(0,0): Z=3(0)+4(0)=0Z=3(0)+4(0)=0
- At (4,0)(4,0): Z=3(4)+4(0)=12Z=3(4)+4(0)=12
- At (0,4)(0,4): Z=3(0)+4(4)=16Z=3(0)+4(4)=16

The maximum value is 1616 at (0,4)(0,4).

Not sure why a step works? check your working in Super Tutor

2Minimise Z=3x+4yZ = -3x + 4y
subject to x+2y8x + 2y \leq 8, 3x+2y123x + 2y \leq 12, x0x \geq 0, y0y \geq 0.
Show solution
First find the feasible region from the constraints:

- x+2y8x+2y\le 8
- 3x+2y123x+2y\le 12
- x0, y0x\ge 0,\ y\ge 0

Corner points are:
- (0,0)(0,0)
- (0,4)(0,4) from x=0x=0 in x+2y=8x+2y=8
- (4,0)(4,0) from y=0y=0 in 3x+2y=123x+2y=12
- Intersection of x+2y=8x+2y=8 and 3x+2y=123x+2y=12:

Subtracting, 2x=42x=4, so x=2x=2.
Then 2+2y=8y=32+2y=8\Rightarrow y=3.
So intersection is (2,3)(2,3).

Now evaluate Z=3x+4yZ=-3x+4y:
- At (0,0)(0,0): Z=0Z=0
- At (0,4)(0,4): Z=16Z=16
- At (4,0)(4,0): Z=12Z=-12
- At (2,3)(2,3): Z=6+12=6Z=-6+12=6

The minimum value is 12-12 at (4,0)(4,0).

Not sure why a step works? check your working in Super Tutor

3Maximise Z=5x+3yZ = 5x + 3y
subject to 3x+5y153x + 5y \leq 15, 5x+2y105x + 2y \leq 10, x0x \geq 0, y0y \geq 0.
Show solution
The constraints are:

- 3x+5y153x+5y\le 15
- 5x+2y105x+2y\le 10
- x0, y0x\ge 0,\ y\ge 0

Corner points of the feasible region:
- (0,0)(0,0)
- (0,3)(0,3) from 3x+5y=153x+5y=15 with x=0x=0
- (2,0)(2,0) from 5x+2y=105x+2y=10 with y=0y=0
- Intersection of 3x+5y=153x+5y=15 and 5x+2y=105x+2y=10:

Multiply first by 2: 6x+10y=306x+10y=30
Multiply second by 5: 25x+10y=5025x+10y=50
Subtract: 19x=20x=201919x=20\Rightarrow x=\frac{20}{19}.

Then 52019+2y=105\cdot\frac{20}{19}+2y=10 gives 2y=90192y=\frac{90}{19}, so y=4519y=\frac{45}{19}.

Now compute Z=5x+3yZ=5x+3y:
- (0,0)(0,0): 00
- (0,3)(0,3): 99
- (2,0)(2,0): 1010
- (20/19,45/19)(20/19,45/19): 10019+13519=23519\frac{100}{19}+\frac{135}{19}=\frac{235}{19}.

Since the Chapter examples and the feasible polygon here give the largest value at the intersection, the maximum is 23519\frac{235}{19}.

This exact value is not among the chapter's printed options because no options were printed in the exercise; the computed answer is 23519\frac{235}{19}.

Not sure why a step works? check your working in Super Tutor

4Minimise Z=3x+5yZ = 3x + 5y
such that x+3y3x + 3y \geq 3, x+y2x + y \geq 2, x,y0x, y \geq 0.
Show solution
We need the minimum of Z=3x+5yZ=3x+5y subject to

- x+3y3x+3y\ge 3
- x+y2x+y\ge 2
- x0, y0x\ge 0,\ y\ge 0

Find corner points of the feasible region.

1. Intersection of x+3y=3x+3y=3 and x+y=2x+y=2:

Subtract the second from the first:
2y=1y=122y=1\Rightarrow y=\frac12.
Then x+12=2x=32x+\frac12=2\Rightarrow x=\frac32.
So one corner point is (32,12)(\frac32,\frac12).

2. On the yy-axis (x=0x=0):
- From x+3y3x+3y\ge 3, we get y1y\ge 1.
- From x+y2x+y\ge 2, we get y2y\ge 2.
So the lowest point on the axis is (0,2)(0,2).

3. On the xx-axis (y=0y=0):
- From x+3y3x+3y\ge 3, we get x3x\ge 3.
- From x+y2x+y\ge 2, we get x2x\ge 2.
So the lowest point on the axis is (3,0)(3,0).

Now evaluate ZZ:
- At (32,12)(\frac32,\frac12): Z=332+512=92+52=7Z=3\cdot\frac32+5\cdot\frac12=\frac92+\frac52=7
- At (0,2)(0,2): Z=10Z=10
- At (3,0)(3,0): Z=9Z=9

The minimum value is 77 at (32,12)(\frac32,\frac12).

Not sure why a step works? check your working in Super Tutor

5Maximise Z=3x+2yZ = 3x + 2y
subject to x+2y10x + 2y \leq 10, 3x+y153x + y \leq 15, x,y0x, y \geq 0.
Show solution
Constraints:

- x+2y10x+2y\le 10
- 3x+y153x+y\le 15
- x0, y0x\ge 0,\ y\ge 0

Corner points:
- (0,0)(0,0)
- (5,0)(5,0) from 3x+y=153x+y=15 with y=0y=0
- (0,5)(0,5) from x+2y=10x+2y=10 with x=0x=0
- Intersection of x+2y=10x+2y=10 and 3x+y=153x+y=15:

From 3x+y=153x+y=15, y=153xy=15-3x.
Substitute in x+2y=10x+2y=10:
x+2(153x)=10x+2(15-3x)=10
x+306x=10x+30-6x=10
5x=20x=4-5x=-20\Rightarrow x=4.
Then y=1512=3y=15-12=3.
So intersection is (4,3)(4,3).

Now evaluate Z=3x+2yZ=3x+2y:
- (0,0)(0,0): 00
- (5,0)(5,0): 1515
- (0,5)(0,5): 1010
- (4,3)(4,3): 12+6=1812+6=18

The maximum value is 1818 at (4,3)(4,3).

Not sure why a step works? check your working in Super Tutor

6Minimise Z=x+2yZ = x + 2y
subject to 2x+y32x + y \geq 3, x+2y6x + 2y \geq 6, x,y0x, y \geq 0.
7Minimise and Maximise Z=5x+10yZ = 5x + 10y
subject to x+2y120x + 2y \leq 120, x+y60x + y \geq 60, x2y0x - 2y \geq 0, x,y0x, y \geq 0.
8Minimise and Maximise Z=x+2yZ = x + 2y
subject to x+2y100x + 2y \geq 100, 2xy02x - y \leq 0, 2x+y2002x + y \leq 200; x,y0x, y \geq 0.
9Maximise Z=x+2yZ = -x + 2y, subject to the constraints:
x3x \geq 3, x+y5x + y \geq 5, x+2y6x + 2y \geq 6, y0y \geq 0.
10Maximise Z=x+yZ = x + y, subject to xy1x - y \leq -1, x+y0-x + y \leq 0, x,y0x, y \geq 0.

5 more solved questions in Linear Programming

Every remaining exercise is solved step by step in Super Tutor, plus practice quizzes and flashcards for this chapter. Free to start.

Stuck on a step?

Ask Super Tutor AI to explain any solution on this page in a simpler way — free, 24x7.

Ask a Doubt Free

Frequently Asked Questions

What are the important topics in Linear Programming for CBSE Class 12 Mathematics?
Linear Programming covers several key topics that are frequently asked in CBSE Class 12 board exams. Focus on the core concepts listed on this page and practise related questions to build confidence.
How to score full marks in Linear Programming — CBSE Class 12 Mathematics?
Understand the core concepts first, then work through the 95 practice questions available for this chapter. Revise formulas and definitions regularly, and use flashcards for quick recall before the exam.
Where can I get free NCERT Solutions for Linear Programming Class 12 Mathematics?
This page has free step-by-step NCERT Solutions for every exercise question in Linear Programming (CBSE Class 12 Mathematics) — written the way examiners award marks: given, formula, working, answer.

Sources & Official References

Content is aligned to the official syllabus. Refer to the board website for the latest curriculum.

For serious students

Get the full Linear Programming chapter — for free.

Quizzes, flashcards, AI doubt-solver and a step-by-step study plan for CBSE Class 12 Mathematics.