Chapter 12

Linear Programming
Important Results
1. Linear programming
It is the method used in decision making in business for obtaining
the maximum or minimum values of a linear expression subject to
the satisfying certain given inequations. This linear expression is
known as an objective function and the linear inequations are
known as linear constraints.
2. Linear constraints In business or industry we want to make the
best use of our limited resources, be these in the form of money,
labour, expenses etc. The limitations on the resources can often
be expressed in the form of linear inequations, known as linear
constraints.
3. Objective function A linear function of the involved variables,
which we want to maximize or minimize subject to the given
linear constraints, is known as an objective function.
4. Optimal value of an objective function The maximum or
minimum value of the objective function is known as its optimal
value.
5. Feasible solution A set of values of the variables satisfying all
the constraints is known as a feasible solution.
6. Optimal solution A feasible solution which leads to an optimal
value of the objective function is known as an optimal solution.
7. Optimization techniques The process of obtaining the optimal
values are called optimization techniques.
8. Linear Programming Problem (LPP) A general linear
programming consists of maximizing or minimizing an objective
function subject to certain given constraints.

Formulation of a Linear Programming

Problem (LPP)
Working Rules
Step 1 Identify the unknown in the given LPP.
Denote them by x and y.
Step 2 Formulate the objective function in terms of x and y.
Be sure whether it is to be maximized or minimized.
 NCERT Class XII Mathematics Solutions 655

Step 3 Translate all the constraints in the form of linear

inequations.
Step 4 Solve these inequations simultaneoulsy. Mark the
common area by shaded region. This is called the feasible
region.
Step 5 Find the coordinates of all the vertices of the feasible
region.
Step 6 Find the value of the objective function at each and every
vertex of the feasible region.
Step 7 Find the values of x and y for which the objective function
Z = ax + by has maximum or minimum value (as the case may be).

Exercise 12.1
Solve the following linear programming problems graphically.
Question 1. Maximize Z = 3 x + 4 y, subject to the constraints are
x + y ≤ 4, x ≥ 0 and y ≥ 0.
(Q. Nos. 1 to 10)
(a) Frame equation from the given constraints and plot these equations
on the graph.
(b) Find the feasible region and find the corner points.
(c) Find the value of Z at those points and see at which point Z is
minimum/maximum.
Solution Our problem is to maximize Z = 3x + 4y …(i)
Subject to constraints x + y ≤4 …(ii)
x ≥ 0, y ≥ 0 …(iii)
Firstly, draw the graph of the line x + y = 4
0 4 Y
x
y 4 0 6

Putting (0, 0) in the inequality 5

x + y ≤ 4, we have
4 B(0, 4)
0 + 0 ≤ 4 ⇒ 0 ≤ 4 (which is true)
So, the half plane is towards the 3
origin. Since, x, y ≥ 0 2
So, the feasible region lies in the Feasible
first quadrant. 1 region
A(4, 0)
∴ Feasible region is OABO.
O 1 2 3 4 5 6 X
(0, 0)
656 www.arihantbooks.com

The corner points of the feasible region are O(0, 0), A(4,0) and B(0, 4). The
values of Z at these points are as follows:
Corner point Z = 3 x + 4y
O(0, 0) 0
A(4, 0) 12
B(0, 4) 16 → Maximum
Therefore, the maximum value of Z is 16 at the point B(0, 4).
Note While plotting the graph, please be careful about the inequalities
in which direction we have to plot this.
Question 2. Minimize Z = − 3 x + 4 y, subject to constraints are
x + 2 y ≤ 8, 3 x + 2 y ≤ 12, x ≥ 0 and y ≥ 0.
Solution Our problem is to minimize
Z = − 3x + 4y …(i)
Subject to constraints x + 2y ≤ 8 …(ii)
3x + 2y ≤ 12 …(iii)
x ≥ 0, y ≥ 0 …(iv)
Firstly, draw the graph of the line, x + 2y = 8
x 0 8
y 4 0
Putting (0, 0) in the inequality x + 2y ≤ 8, we have
0 + 0 ≤8 ⇒ 0 ≤8 (which is true)
So, the half plane is towards the origin.
Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
Secondly, draw the graph of the line, 3x + 2y = 12
x 0 4 Y
y 6 0
Putting (0, 0) in the 6
inequality
3x + 2y ≤ 12, we have 5
3 × 0 + 2 × 0 ≤ 12
(0, 4)C 4
⇒ 0 ≤ 12
B(2, 3)
(which is true) 3
So, the half plane is x + 2y = 8
towards the origin. 2
Feasible
∴ Feasible region is 1 region
OABCO. A(4, 0)
On solving equations O X
1 2 3 4 5 6 7 8
x + 2y = 8 and (0, 0)
3x + 2y = 12 , we get 3x + 2y = 12
x = 2 and y = 3
∴ Intersection point B is (2, 3)
The corner points of the feasible region are O(0, 0), A(4, 0), B(2, 3) and
C(0, 4). The values of Z at these points are as follows:
 NCERT Class XII Mathematics Solutions 657

Corner point Z = − 3 x + 4y
O(0, 0) 0
A(4, 0) –12 → Minimum
B(2, 3) 6
C(0, 4) 16

Therefore, the minimum value of Z is –12 at the point A(4, 0).

Question 3. Maximize Z = 5 x + 3 y, subject to constraints are
3 x + 5 y ≤ 15, 5 x + 2 y ≤ 10, x ≥ 0 and y ≥ 0.
Solution Our problem is to maximize Z = 5x + 3y …(i)
Subject to constraints 3x + 5y ≤ 15 …(ii)
5x + 2y ≤ 10 (iii)
x ≥ 0, y ≥ 0 …(iv)
Firstly, draw the graph of the line 3x + 5y = 15
x 0 5
y 3 0

Putting (0, 0) in the inequality 3x + 5y ≤ 15, we have

3 × 0 + 5 × 0 ≤ 15 ⇒ 0 ≤ 15 (which is true)
So, the half plane is towards the origin. Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
Secondly, draw the graph of the line 5x + 2y = 10
x 0 2 Y
y 5 0
6
Putting (0, 0) in the
inequality 5
5x + 2y ≤ 10, we have
5 × 0 + 2 × 0 ≤ 10 4
Feasible
⇒0 ≤ 10 (which is true) (0, 3)C 3 B
20 , 45
region
19 19
So, the half plane is
towards the origin. 2
On solving given
equations 1
A(2, 0)
3x + 5y = 15
and 5x + 2y = 10, O 1 2 3 4 5 6 7 8 X
20 45 (0, 0)
we get x = ,y =
19 19 5x + 2y = 10 3x + 5y = 15
Coordinates of point
 20 45
B is  ,  .
 19 19
∴ Feasible region is OABCO.
658 www.arihantbooks.com

 20 45
The corner points of the feasible region are O(0, 0), A(2, 0), B  ,  and
 19 19
C(0, 3) The values of Z at these points are as follows:
Corner point Z = 5 x + 3y
O(0, 0) 0
A(2, 0) 10
C(0, 3) 9

B
20 45 
, 
235
→ Maximum
 19 19  19

235  20 45
Therefore, the maximum value of Z is at the point B  ,  .
19  19 19

Question 4. Minimize Z = 3 x + 5 y, subject to constraints are x + 3 y ≥ 3,

x + y ≥ 2 and x, y ≥ 0.
Solution Our problem is to minimize Z = 3x + 5y …(i)
Subject to constraints x + 3y ≥ 3 …(ii)
x + y ≥2 …(iii)
x ≥ 0, y ≥ 0 …(iv)
Firstly, draw the graph of the line x + 3y = 3
x 0 3
y 1 0
Putting (0, 0) in the inequality x + 3y ≥ 3, we have
0 + 3 ×0 ≥ 3 ⇒ 0 ≥ 3 (which is false)
So, the half plane is away from the origin. Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
Secondly, draw the Y
graph of the line
x + y =2 6

x 0 2 5
y 2 0
4
Putting (0, 0) in the
inequality x + y ≥ 2, we 3
have
(0, 2) C 2 3, 1
0 + 0 ≥2 ⇒ 0 ≥2 B
2 2
(which is false) 1
A(3 0)
So, the half plane is away X
O 1 2 3 4 5 6 7 8
from the origin.
(0, 0)
It can be seen that the x + 3y = 3
feasible region is x+y=2
unbounded.
 NCERT Class XII Mathematics Solutions 659

On solving equations x + y = 2 and x + 3y = 3, we get

3 1
x= and y =
2 2
 3 1
∴ Intersection point B  , 
 2 2
 3 1
The corner points of the feasible region are O(0, 0), A(3, 0), B  ,  and
 2 2
C(0, 2). The values of Z at these points are as follows:

Corner point Z = 3 x + 5y
O(0, 0) 0
A(3, 0) 9
B  , 
3 1 7 → Minimum
 2 2
C(0, 2) 10

As the feasible region is unbounded therefore, 7 may or may not be the

minimum value of Z.
For this, we draw the graph of the inequality, 3x + 5y < 7 and check
whether the resulting half plane has points in common with the feasible
region or not.
It can be seen that the feasible region has no common point with
3x + 5y < 7.
 3 1
Therefore, the minimum value of Z is 7 at  ,  .
 2 2

Question 5. Maximize Z = 3 x + 2 y, subject to constraints are

x + 2 y ≤ 10, 3 x + y ≤ 15 and x, y ≥ 0.
Solution Our problem is to maximize,
Z = 3x + 2y …(i)
Subject to constraints x + 2y ≤ 10 …(ii)
3x + y ≤ 15 …(iii)
x ≥ 0, y ≥ 0 …(iv)
Firstly, draw the graph of the line x + 2y = 10
x 0 10
y 5 0
Putting (0, 0) in the inequality x + 2y ≤ 10, we have
0 + 2 × 0 ≤ 10 ⇒ 0 ≤ 10 (which is true)
So, the half plane is towards the origin. Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
Secondly, draw the graph of the line 3x + y = 15
x 0 5
y 15 0
660 www.arihantbooks.com

Putting (0, 0) in the inequality Y

3x + y ≤ 15, we have

3x
3 × 0 + 0 ≤ 15

+y
6
⇒ 0 ≤ 15 (which is true)

=1
C(0, 5)

5
So, the half plane is towards 5
the origin.
4 B(4, 3)
On solving equations
x + 2y = 10 and 3x + y = 15, 3
we get x + 2y = 10
x = 4 and y = 3 2
∴Intersection point B is (4, 3).
1
∴ Feasible region is OABCO. A(5, 0)
The corner points of the
O 1 2 3 4 5 6 X
feasible region are O (0, 0),
(0, 0)
A(5, 0), B(4, 3) and
C(0, 5). The values of Z at these points are as follows:
Corner point Z = 3 x + 2y
O(0, 0) 0
A(5, 0) 15
B(4, 3) 18 → Maximum
C(0, 5) 10
Therefore, the maximum value of Z is 18 at the point B(4, 3).
Question 6. Minimize Z = x + 2 y, subject to constraints are 2 x + y ≥ 3,
x + 2 y ≥ 6 and x, y ≥ 0. Show that the minimum of Z occurs at more than
two points.
Solution Our problem is to minimize
Z = x + 2y …(i)
Subject to the constraints are
2x + y ≥ 3 …(ii) Y
x + 2y ≥ 6 …(iii)
x ≥ 0, y ≥ 0 …(iv) 6
Firstly, draw the graph of the
line 2x + y = 3z 5

x 0 3/2 4
y 3 0 B(0, 3)
3
Putting (0, 0) in the x+
inequality 2x + y ≥ 3, we 2 2y
=6
have 1
2 ×0 + 0 ≥ 3 A(6, 0)
⇒ 0≥3 O 1 2 3 4 5 6 7 8 X
(which is false) (0, 0)
So, the half plane is away
from the origin. Since, 2x + y = 3
x, y ≥ 0
 NCERT Class XII Mathematics Solutions 661

So, the feasible region lies in the first quadrant.

Secondly, draw the graph of the line x + 2y = 6
x 0 6
y 3 0
Putting (0, 0) in the inequality x + 2y ≥ 6, we have
0 + 2 ×0 ≥6 ⇒ 0 ≥6 (which is false)
So, the half plane is away from the origin.
The intersection point of the lines x + 2y = 6 and 2x + y = 3 is B(0, 3).
The corner points of the feasible region are A(6, 0) and B(0, 3). The values
of Z at these points are as follows:
Corner point Z = x + 2y
A(6, 0) 6
B(0, 3) 6
It can be seen that the value of Z at points A and B is same. If we take any
other point such as (2, 2) on line x + 2y = 6, then Z = 6. Thus, the minimum
value of Z occurs for more than 2 points. Therefore, the value of Z is
minimum at every point on the line, x + 2y = 6.
Question 7. Minimize and maximize Z = 5 x + 10 y subject to constraints
are x + 2 y ≤ 120, x + y ≥ 60, x − 2 y ≥ 0 and x, y ≥ 0.
Solution Our problem is to minimize and maximize
Z = 5x + 10y …(i)
Subject to constraints x + 2y ≤ 120 …(ii)
x + y ≥ 60 …(iii)
x − 2y ≥ 0 …(iv)
x ≥ 0, y ≥ 0 …(v)
Firstly, draw the graph of the lines x + 2y = 120
x 0 120
Y
y 60 0
Putting (0, 0) in the
60
inequality
x + 2y ≤ 120, we 50
have
40 (60, 30)
C
0 + 2 × 0 ≤ 120 ⇒
30
0 ≤ 120 (which is
(40, 20)
true) 20 D
So, the half plane is
towards the origin. 10
A(60, 0) B(120, 0)
Secondly, draw the
graph of the line O
20 40 60 80 100 120 140 160 X
x + y = 60
x 0 60 x – 2y = 0 (0, 0) x + 2y = 120
y 60 0 x + y = 60
662 www.arihantbooks.com

Putting (0, 0) in the inequality x + y ≥ 60, we have

0 + 0 ≥ 60 ⇒ 0 ≥ 60
(which is false)
So, the half plane is away from the origin.
Thirdly, draw the graph of the line x − 2y = 0
x 0 10
y 0 5
Putting (5, 0) in the inequality x − 2y ≥ 0, we have
5 −2 ×0 ≥0 ⇒ 5 ≥0 (which is true)
So, the half plane is towards the X-axis. Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
∴ Feasible region is ABCDA.
On solving equations x − 2y = 0 and x + y = 60, we get D (40, 20)
and on solving equations x − 2y = 0 and x + 2y = 120, we get C(60, 30).
The corner points of the feasible region are A(60, 0), B(120, 0), C(60, 30)
and D(40, 20). The values of Z at these points are as follows:
Corner point Z = 5 x + 10 y
A(60, 0) 300 → Minimum
B(120, 0) 600 → Maximum
C(60, 30) 600 → Maximum
D(40, 20) 400

The minimum value of Z is 300 at (60, 0) and the maximum value of Z is

600 at all the points on the line segment joining the points (120, 0) and
(60, 30).
Question 8. Minimize and maximize Z = x + 2 y subject to constraints
are x + 2 y ≥ 100, 2 x − y ≤ 0, 2 x + y ≤ 200 and x, y ≥ 0.
Solution Our problem is to minimize and maximize
Z = x + 2y …(i)
Subject to constraints are x + 2y ≥ 100 …(ii)
2x − y ≤ 0 …(iii)
2x + y ≤ 200 …(iv)
x ≥ 0, y ≥ 0 …(v)
Firstly, draw the graph of the line x + 2y = 100
x 0 100
y 50 0

Putting (0, 0) in the inequality x + 2y ≥ 100, we have

0 + 2 × 0 ≥ 100
⇒ 0 ≥ 100
(which is false)
So, the half plane is away from the origin.
Secondly, draw the graph of line 2x − y = 0
 NCERT Class XII Mathematics Solutions 663

0 10 Y
x
200 D(0, 200)
y 0 20

Putting (5, 0) in the

inequality 2x − y ≤ 0,
we have
100
2 × 5 − 0 ≤ 0 ⇒ 10 ≤ 0
(which is false) 80 C(50, 100)
So, the half plane is
towards Y-axis. 60 A(0, 50)
Thirdly, draw the 40 B(20, 40)
graph of line
2x + y = 200 20
x 0 100 X
(0, 0) O 20 40 60 80 100 120 140 160
y 200 0
x + 2y = 100
Putting (0, 0) in the 2x + y = 200
inequality 2x + y ≤ 200, 2x – y = 0
we have
2 × 0 + 0 ≤ 200 ⇒ 0 ≤ 200 (which is true)
So, the half plane is towards the origin. Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
On solving equations 2x − y = 0 and x + 2y = 100, we get B(20, 40)
and on solving the equations 2x − y = 0 and 2x + y = 200, we get
C(50, 100).
∴Feasible region is ABCDA.
The corner points of the feasible region are A(0, 50), B(20, 40), C(50, 100)
and D(0, 200). The values of Z at these points are as follows:
Corner point Z = x + 2y
A(0, 50) 100 → Minimum
B(20, 40) 100 → Minimum
C(50, 100) 250
D(0, 200) 400 → Maximum

The maximum value of Z is 400 at D(0, 200) and the minimum value of Z is
100 at all the points on the line segment joining A(0, 50) and B(20, 40).
Question 9. Maximize Z = − x + 2 y, subject to the constraints are
x ≥ 3 , x + y ≥ 5, x + 2 y ≥ 6 and x, y ≥ 0.
Solution Our problem is to maximize Z = − x + 2y ...(i)
Subject to constraints are x≥3 …(ii)
x+y≥5 …(iii)
x + 2y ≥ 6 …(iv)
x ≥ 0, y ≥ 0 …(v)
664 www.arihantbooks.com

Firstly, draw the graph of the line x + y = 5

x 0 5
y 5 0

Putting (0, 0) in the inequality x + y ≥ 5, we have

0+0≥5
⇒ 0≥5 (which is false)
So, the half plane is away from the origin.
Secondly, draw the graph of line x + 2y = 6
x 0 6
y 3 0

Putting (0, 0) in the inequality x + 2y ≥ 6, we have

0 + 2 ×0 ≥6
⇒ 0 ≥6 (which is false)
So, the half plane is away from the origin.
Thirdly, draw the graph of the line − x + 2y = 1
x 0 –1 Y
y 1/2 0
6
Putting (0, 0) in the
inequality 5
− x + 2y > 1, we have – x + 2y = 1
−0 + 2 ×0 >1 4
⇒ 0 >1 3
(which is false)
So, the half plane is 2 C(3, 2)
away from the origin. B(4, 1)
1
Since, x ≥ 3, y ≥ 0 A(6, 0)
So, the feasible region
lies in the first X' –1 O 1 2 3 4 5 6 7 8 X
quadrant. (0, 0) x + 2y = 6
The points of Y' x+y=5
x=3
intersection of lines
x = 3 and − x + 2y = 1is C (3, 2) and lines x + 2y = 6 and x + y = 5 is B (4, 1).
It can be seen that the feasible region is unbounded.
The corner points of the feasible region are A(6, 0), B(4, 1) and C(3, 2). The
values of Z at these points are as follows:
Corner point Z = − x + 2y
A(6, 0) –6
B(4, 1) –2
C(3, 2) 1 ← Maximum
 NCERT Class XII Mathematics Solutions 665

As the feasible region is unbounded therefore, Z = 1may or may not be the

maximum value. For this, we graph the inequality, − x + 2y > 1 and check
whether the resulting half plane has points in common with the feasible
region or not.
The resulting feasible region has points in common with the feasible
region. Therefore, Z = 1 is not the maximum value.
Hence, Z has no maximum value.
Question 10. Maximize Z = x + y, subject to constraints are
x − y ≤ − 1, − x + y ≤ 0 and x, y ≥ 0.
Solution Our problem is to maximize Z = x + y …(i)
Subject to constraints are x − y ≤ −1 …(ii)
− x + y ≤0 …(iii)
x ≥ 0, y ≥ 0 …(iv)
Firstly, draw the graph of the line x − y = − 1
x 0 –1
y 1 0

Putting (0, 0) in the inequality x − y ≤ − 1, we have

0 −0 ≤ −1 ⇒ 0 ≤ −1 (which is false)
So, the half plane is away from the origin.
Secondly, draw the graph of the line − x + y = 0
x 0 1
y 0 1 Y x – y = –1

Putting (2, 0) in the –x + y = 0

6
inequality − x + y ≤ 0, we
have 5
−2 + 0 ≤0
4
⇒ −2 ≤0
(which is true) 3
So, the half plane is 2
towards the X-axis.
1
Since, x, y ≥ 0
So, the feasible region lies X' O
–1 1 2 3 4 5 6 7 8 X
in the first quadrant.
From the above graph, it is Y'
clearly shown that there is
no common region. Hence, there is no feasible region and thus Z has no
maximum value.
Note If there is no common region, then we do not determine the
minimum/maximum value.
666 www.arihantbooks.com

Exercise 12.2
Question 1. Reshma wishes to mix two types of food P and Q in such a
way that the vitamin contents of the mixture contain atleast 8 units of
vitamin A and 11 units of vitamin B. Food P costs ` 60 per kg and food Q
costs ` 80 per kg. Food P contains 3 units per kg of vitamin A and 5 units
per kg of vitamin B while food Q contains 4 units per kg of vitamin A and
2 units per kg of vitamin B. Determine the minimum cost of the mixture.
(Q. Nos. 1 to10)
(a) Firstly, we consider given types into variables x and y and
mathematically formulate the problem to find the expression for Z
(Objective function).
(b) Find the constraints and frame equations, plot these equations and a
graph and find feasible region.
(c) Find the corner points and value of Z at each corner point and observe
minimum/maximum value of Z.
Solution Let Reshma mixes x kg of food P and y kg of food Q.
Construct the following table:
Food Quantity Vitamin A Vitamin B Cost (` per kg)
P x kg 3x 5x 60x
Q y kg 4y 2y 80y
Total 3x + 4y 5x + 2 y 60 x + 80 y
Requirement Atleast 8 Atleast 11

The mixture must contain atleast 8 units of vitamin A and 11 units of

vitamin B. Total cost Z of purchasing food is Z = 60x + 80y
The mathematical formulation of the given problem is
Minimize Z = 60x + 80y …(i)
Subject to the constraints 3x + 4y ≥ 8 …(ii)
5x + 2y ≥ 11 …(iii)
x ≥ 0, y ≥ 0 …(iv)
Firstly, draw the graph of the line 3x + 4y = 8
x 0 8/3
y 2 0
Putting (0, 0) in the inequality 3x + 4y ≥ 8, we have
3 ×0 + 4 ×0 ≥8
⇒ 0 ≥8 (which is false)
So, the half plane is away from the origin.
Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
Secondly, draw the graph of the line 5x + 2y = 11
x 0 11/5
y 11/2 0
 NCERT Class XII Mathematics Solutions 667

Putting (0, 0) in the Y

inequality 5x + 2y ≥ 11,
we have
5 × 0 + 2 × 0 ≥ 11 6 C(0, 11/2)
⇒ 0 ≥ 11 5
(which is false)
4
So, the half plane is away
from the origin. 3
It can be seen that the
feasible region is 2
unbounded. B(2, 1/2)
1
On solving equations A(8/3, 0)
3x + 4y = 8 and X' X
5x + 2y = 11, we get –1 O 1 2 3 4 5 6 7 8
 1 3 x + 4y = 8
B 2,  .
 2 Y' 5x + 2y = 11

 8   1  11
The corner points of the feasible region are A  , 0 , B2,  and C 0,  .
 3   2  2
The values of Z at these points are as follows :
Corner point Z = 60 x + 80 y
A  , 0 
8 160 → Minimum
3 

B  2, 
1 160 → Minimum
 2

C  0, 
11 440
 2

As the feasible region is unbounded, therefore 160 may or may not be the
minimum value of Z. For this, we graph the inequality 60x + 80y < 160 or
3x + 4y < 8 and check whether the resulting half plane has points in
common with the feasible region or not. It can be seen that the feasible
region has no common point with 3x + 4y < 8 therefore, the minimum cost
8 
of the mixture will be ` 160 at the line segment joining the points A  ,0
3 
 1
and B2,  .
 2
Note Please be careful, while making the table and plotting the graph of
inequalities.
Question 2. One kind of cake requires 200 g of flour and 25 g of fat and
another kind of cake requires 100 g of flour and 50 g of fat. Find the
maximum number of cakes which can be made from 5 kg of flour and 1kg
of fat assuming that there is no shortage of the other ingredients used in
making the cakes.
668 www.arihantbooks.com

Solution Let x be number of cakes of one kind and y be the number of

cakes of other kind. Construct the following table :
Flour required Fat required
Kind Number of cakes
(in g) (in g)
I x 200x 25x
II y 100y 50y
Total x+ y 200 x + 100 y 25x + 50 y
Requirement 5000 1000
Our problem is to maximize Z = x + y …(i)
Subject to constraints are 200x + 100y ≤ 5000 ⇔ 2x + y ≤ 50 …(ii)
25x + 50y ≤ 1000 ⇔ x + 2y ≤ 40 …(iii)
and x, y ≥ 0 …(iv)
Firstly, draw the graph of the lines 2x + y = 50
x 0 25
y 50 0

Putting (0, 0) in the inequality 2x + y ≤ 50, we have

2 × 0 + 0 ≤ 50 ⇒ 0 ≤ 50 (which is true)
So, the half plane is towards the origin.
Secondly, draw the graph of the line x + 2y = 40
x 0 40
y 20 0
Putting (0, 0) in the Y
inequality x + 2y ≤ 40, we
have
0 + 2 × 0 ≤ 40 60

⇒ 0 ≤ 40 50
(which is true)
40
So, the half plane is towards
the origin. 30
Since, x, y ≥ 0
20 C(0, 20)
So, the feasible region lies in B(20, 10)
the first quadrant. 10
On solving equations (25, 0)A
2x + y = 50 O 10 20 30 40 50 60 70 80 X
(0, 0)
and x + 2y = 40, we get
x + 2y = 40
B (20, 10) 2x + y = 50
∴Feasible region is OABCO.
The corner points of the feasible region are 0 (0, 0), A(25, 0), B(20, 10) and
C(0, 20). The values of Z at these points are as follows:
 NCERT Class XII Mathematics Solutions 669

Corner point Z= x + y
0 (0, 0) 0
A(25, 0) 25
B(20, 10) 30 → Maximum
C(0, 20) 20

Thus, the maximum number of cakes that can be made is 30 i.e., 20 of one
kind and 10 of the other kind).
Question 3. A factory makes tennis rackets and cricket bats. A tennis
racket takes 1.5 h of machine time and 3 h of craftman’s time in its
making while a cricket bat takes 3 h of machine time and 1 h of
craftman’s time. In a day, the factory has the availability of not more than
42 h of machine time and 24 h of craftman’s time.
(a) What number of rackets and bats must be made, if the factory is to
work at full capacity?
(b) If the profits on rackets and on bats is ` 20 and ` 10 respectively,
find the maximum profit of the factory when it works at full capacity.
Solution Let the number of rackets and the number of cricket bats to
be made in a day be x and y respectively.
Construct the following table:
Machine time Craftsman’s
Item Number Profit (in `)
(in h) time (in h)
Tennis rackets x 1.5x 3x 20x
Cricket bats y 3y 1y 10y
Total x+ y 1.5x + 3y 3x + y 20 x + 10 y
Availability 42 24

The machine time is not available for more than 42 h. ∴ 1.5x + 3y ≤ 42

The craftman’s time is not available for more than 24 h. ∴ 3x + y ≤ 24
The profit on rackets is ` 20 and on bats is ` 10.
∴Maximum Z = 20x + 10y …(i)
Subject to constraints 1.5x + 3y ≤ 42 …(ii)
3x + y ≤ 24 …(iii)
x ≥ 0, y ≥ 0 …(iv)
Firstly, draw the graph of the line 1.5x + 3y = 42
x 0 28
y 14 0
Putting (0, 0) in the inequality 1.5x + 3y ≤ 42, we have
1.5 × 0 + 3 × 0 ≤ 42 ⇒0 ≤ 42 (which is true)
670 www.arihantbooks.com

So, the half plane is Y

towards the origin. 32
Since, x, y ≥ 0 28
So, the feasible region
lies in the first 24 (0, 24)
quadrant. 20
Secondly, draw the
graph of the line (0, 14) C16
B(4, 12)
3x + y = 24 12
x 0 8
8
y 24 0
4
Putting (0, 0) in the A(8, 0) (28, 0)
inequality 3x + y ≤ 24, X
O 4 8 12 16 20 24 28 32
we have
(0, 0)
3 × 0 + 0 ≤ 24 ⇒ 0 ≤ 24 1.5x + 3y = 42
3x + y = 24
(which is true)
So, the half plane is towards the origin.
On solving equations 1.5x + 3y = 42 and 3x + y = 24, we get B (4, 12).
∴Feasible region is OABCO.
The corner points of the feasible region are O (0, 0), A(8, 0), B(4, 12) and
C (0, 14). The values of Z at these points are as follows:
Corner point Z = 20 x + 10 y
O(0, 0) 0
A(8, 0) 160
B(4, 12) 200 → Maximum
C(0, 14) 140
Thus, the maximum profit of the factory when it works to its full capacity is
` 200.
Question 4. A manufacturer produces nuts and bolts. It takes 1 h of
work on machine A and 3 h on machine B to produce a package of nuts. It
takes 3 h on machine A and 1 h on machine B to produce a package of
bolts. He earns a profit of ` 17.50 per package on nuts and ` 7.00 per
package on bolts. How many package of each should be produced each
day so as to maximize his profit, if he operates his machines for at the
most 12 h a day?
Solution Let the manufacturer produces x nuts and y bolts.
We construct the following table :
Number of
Item Machine A (in h) Machine B (in h) Profit (in `)
packages
Nuts x 1x 3x 17.50 x
Bolts y 3y 1y 7y
Total x+ y x + 3y 3x + y 17.50 x + 7y
Availability 12 12
 NCERT Class XII Mathematics Solutions 671

∴Total profit, Z = 17.5x + 7y i. e., maximize Z = 17.5x + 7y …(i)

Subject to constraints
x + 3y ≤ 12 …(ii)
3x + y ≤ 12 …(iii)
x ≥ 0, y ≥ 0 …(iv)
Firstly, draw the graph of the lines x + 3y = 12
x 0 12
y 4 0
Putting (0, 0) in the inequality x + 3y ≤ 12, we have
0 + 3 × 0 ≤ 12
⇒ 0 ≤ 12 (which is true)
So, the half plane is towards from the origin.
Since, x, y ≥ 0
So, the feasible region lies in first quadrant.
Secondly, draw the graph of the line 3x + y = 12
x 4 0 Y
y 0 12 14
Putting (0, 0) in the 12 (0, 20)
inequality 3x + y ≤ 12,
we have 10
3 × 0 + 0 ≤ 12 8
⇒ 0 ≤ 12
(which is true) 6

So, the half plane is 4 B(3, 3)

C(0, 4)
towards from the origin.
2
On solving equations A(4, 0) (12, 0)
x + 3y = 12 and O
X
2 4 6 8 10 12 14 16
3x + y = 12, (0, 0)
x + 3y = 12
we get B (3, 3). 3x + y = 12
∴ Feasible region is
OABCO.
The corner points of the feasible region are O (0, 0) A(4, 0), B(3, 3) and
C(0, 4). The values of Z at these points are as follows:
Corner point Z = 17.5 x + 7 y
O(0, 0) 0
A(4, 0) 70
B(3, 3) 73.50 → Maximum
C(0, 4) 28

The maximum value of Z is ` 73.50 at (3, 3).

Thus, 3 packages of nuts and 3 packages of bolts should be produced each
day to get the maximum profit ` 73.50.
672 www.arihantbooks.com

Question 5. A factory manufactures two types of screws A and B. Each

type of screw requires the use of two machines, an automatic and a hand
operated. It takes 4 min on the automatic and 6 min on hand operated
machines to manufacture a package of screws A, while it takes 6 min on
automatic and 3 min on the hand operated machines to manufacture a
package of screws B. Each machine is available for at the most 4 h on any
day. The manufacturer can sell a package of screws A at a profit of ` 7 and
screws B at a profit of ` 10. Assuming that he can sell all the screws he
manufactured, how many packages of each type should the factory owner
produce in a day in order to maximize his profit? Determine the
maximum profit.
Solution Let the manufacturer produces x package of screws A and y
package of screws B. We construct the following table:
Number of Time on automatic Time on hand Profit
Type of screw
packages machine (in min) machine (in min) (in`)
A x 4x 6x 7x
B y 6y 3y 10y
Total x+ y 4x + 6 y 6 x + 3y 7x + 10 y
Availability 4 × 60 = 240 4 × 60 = 240
The profits on a package of screws A is ` 7 and on the package of screws B
is ` 10.
Our problem is to maximize Z = 7x + 10y …(i)
Subject to constraints 4x + 6y ≤ 240 ⇔ 2x + 3y ≤ 120 …(ii)
6x + 3y ≤ 240 ⇔ 2x + y ≤ 80 … (iii)
and x ≥ 0, y ≥ 0 …(iv)
Firstly, draw the graph of the line 2x + 3y = 120
Y
x 0 60
y 40 0 80

Putting (0, 0) in the 70

inequality
60
2x + 3y ≤ 120, we have
2 × 0 + 3 × 0 ≤ 120 50
⇒ 0 ≤ 120 40 C(0, 40)
(which is true)
30
So, the half plane is B(30, 20)
towards the origin. 20
Secondly, draw the
10 (40, 0)
graph of the line
2x + y = 80 A
O 10 20 30 40 50 60 70 80 X
x 40 0 (0, 0)
y 0 80 6x + 3y = 240 4x + 6y = 240
 NCERT Class XII Mathematics Solutions 673

Putting (0, 0) in the inequality 2x + y ≤ 80, we have

2 × 0 + 0 ≤ 80 ⇒ 0 ≤ 80 (which is true)
So, the half plane is towards the origin. Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
On solving equations 2x + 3y = 120 and 2x + y = 80, we get B(30, 20).
The corner points of the feasible region are O (0, 0), A(40, 0), B(30, 20) and
C(0, 40). The values of Z at these points are as follows:
∴ Feasible region is OABCO.
Corner point Z = 7 x + 10 y
O (0, 0) 0
A(40, 0) 280
B(30, 20) 410 → Maximum
C(0, 40) 400

The maximum value of Z is ` 410 at B(30, 20).

Thus, the factory should produce 30 packages of screws A and 20
packages of screws B to get the maximum profit of ` 410.
Question 6. A cottage industry manufactures pedestal lamps and
wooden shades, each requiring the use of a grinding/cutting machine and
a sprayer. It takes 2 h on grinding/cutting machine and 3 h on the sprayer
to manufacture a pedestal lamp. It takes 1 h on the grinding/cutting
machine and 2 h on the sprayer to manufacture a shade. On any day, the
sprayer is available for at the most 20 h and the grinding/cutting machine
for at the most 12 h. The profit from the sale of a lamp is ` 5 and that from
a shade is ` 3. Assuming that the manufacture can sell all the lamps and
shades that he produce, how should he schedule his daily production in
order to maximize his profit?
Solution Let the manufacturer produces x pedestal lamps and y
wooden shades everyday. We construct the following table :
Time on grinding/ Time on Profit
Item Number
cutting machine (in h) sprayer (in h) (in `)
A x 2x 3x 5x
B y y 2y 3y
Total x+ y 2x + y 3x + 2 y 5x + 3y
Availability 12 20

The profit on a lamp is ` 5 and on the shades is ` 3.

Our problem is to maximize Z = 5x + 3y …(i)
Subject to the constraints 2x + y ≤ 12 …(ii)
3x + 2y ≤ 20 …(iii)
x ≥ 0, y ≥ 0 …(iv)
Firstly, draw the graph of the line 2x + y = 12
x 0 6
y 12 0
674 www.arihantbooks.com

Putting (0, 0) in the Y

inequality 2x + y ≤ 12, we 14
have
12
2 × 0 + 0 ≤ 12 ⇒ 0 ≤ 12
(which is true) 10
(0, 10)C
So, the half plane is
8
towards the origin. Since,
x, y ≥ 0 6
So, the feasible region lies 4 B(4, 4)
in the first quadrant.
Secondly, draw the graph 2
(6, 0)A (6.6, 0)
of the line 3x + 2y = 20
X
O 2 4 6 8 10 12 14 16
20
x 0 = 6.6 (0, 0)
3 3x + 2y = 20
y 10 0 2x + y = 12

Putting (0, 0) in the inequality 3x + 2y ≤ 20, we have

3 × 0 + 2 × 0 ≤ 20 ⇒ 0 ≤ 20 (which is true)
So, the half plane is towards the origin.
On solving equations 2x + y = 12 and 3x + 2y = 20, we get B(4, 4).
∴ Feasible region is OABCO.
The corner points of the feasible region are O(0, 0), A(6, 0), B(4, 4) and
C(0, 10). The values of Z at these points are as follows:

Corner point Z = 5 x + 3y
0(0, 0) 0
A(6, 0) 30
B(4, 4) 32 → Maximum
C(0, 10) 30

The maximum value of Z is ` 32 at B(4, 4).

Thus, the manufacturer should produce 4 pedestal lamps and 4 wooden
shades to maximize his profits.
Question 7. A company manufactures two types of novelty souvenirs
made of plywood. Souvenirs of type A require 5 min each for cutting and
10 min each for assembling. Souvenirs of type B require 8 min each for
cutting and 8 min each for assembling. There are 3 h 20 min available for
cutting and 4 h for assembling. The profit is ` 5 each for type A and ` 6
each for type B souvenirs. How many souvenirs of each type should the
company manufacture in order to maximise the profit?
Solution Let the company manufactures x souvenirs of type A and y
souvenirs of type B. We construct the following table :
 NCERT Class XII Mathematics Solutions 675

Time for
Time for cutting assembling Profit
Type Number
machine (in min) (in ` )
(in min)
A x 5x 10x 5x
B y 8y 8y 6y
Total x+ y 5x + 8 y 10 x + 8 y 5x + 6 y
Availability 3 × 60 + 20 = 200 4 × 60 = 240
The profit on type A souvenirs is ` 5 and on type B souvenirs is ` 6.
Our problem is to maximizeZ = 5x + 6y …(i)
Subject to the constraints
5x + 8y ≤ 200 … (ii)
10x + 8y ≤ 240 ⇔ 5x + 4y ≤ 120 …(iii)
x ≥ 0, y ≥ 0 …(iv)
Firstly, draw the graph of the line 5x + 8Y = 200
x 0 40
y 25 0
Putting (0, 0) in the inequality 5x + 8y ≤ 200, we have
5 × 0 + 8 × 0 ≤ 200 ⇒ 0 ≤ 200 (which is true)
So, the half plane is towards the origin.
Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
Secondly, draw the graph of the line 5x + 4y = 120
x 0 24
y 30 0
Putting (0, 0) in the inequality 5x + 4y ≤ 120, we have
5 × 0 + 4 × 0 ≤ 120
⇒ 0 ≤ 120 (which is true)
So, the half plane is Y
towards the origin.
50
On solving equations
5x + 8y = 200 and 40
5x + 4y = 120, we get
B(8, 20). 30
(0, 25)C
20 B(8, 20)
∴ Feasible region is
OABCO. 10
The corner points of the A(24, 0)
feasible region are O(0, 0), O 10 20 30 40 50 60 70 80 X
A(24, 0), B(8, 20) and C(0, (0, 0)
25). The values of Z at 5x + 4y = 120
these points are as follows: 5x + 8y = 200
676 www.arihantbooks.com

Corner point Z = 5 x + 6y
O(0, 0) 0
A(24, 0) 120
B(8, 20) 160 → Maximum
C(0, 25) 150

The maximum value of Z is ` 160 at B(8, 20).

Thus, 8 souvenirs of type A and 20 souvenirs of type B should be produced
each day to get the maximum profit of ` 160.
Question 8. A merchant plans to sell two types of personal computers a
desktop model and a portable model that will cost ` 25000 and ` 40000
respectively. He estimates that the total monthly demand of computers
will not exceed 250 units. Determine the number of units of each type of
computers which the merchant should stock to get maximum profit, if he
does not want to invest more than ` 70 lakh and if his profit on the desktop
model is ` 4500 and on portable model is ` 5000.
Solution Let the merchant stocks x desktop computers and y portable
computers. We construct the following table:
Cost per
Investment Profit
Type Number computer
(in `) (in `)
(in `)
Desktop x 25000x 4500x 25000
Portable y 40000y 5000y 40000
Total x+ y 25000 x + 40000 y 4500 x + 5000 y
The cost of a desktop model is ` 25000 and of a portable model is ` 40000.
However, the merchant can invest a maximum of ` 70 lakh.
∴ 25000x + 40000y ≤ 7000000
So, our problem is to maximizeZ = 4500x + 5000y …(i)
Subject to constraints x + y ≤ 250 …(ii)
25000x + 40000y ≤ 7000000 ⇔ 5x + 8y ≤ 1400 …(iii)
x ≥ 0, y ≥ 0 …(iv)
Firstly, draw the graph of the line 5x + 8y = 1400
x 0 280
y 175 0
Putting (0, 0) in the inequality 5x + 8y ≤ 1400, we have
5 × 0 + 8 × 0 ≤ 1400 ⇒ 0 ≤ 1400 (which is true)
So, the half plane is towards the origin. Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
Secondly, draw the graph of the line, x + y = 250
x 0 250
y 250 0
 NCERT Class XII Mathematics Solutions 677

Putting (0, 0) in the inequality Y

300
x + y ≤ 250, we have
300
0 + 0 ≤ 250 ⇒ 0 ≤ 250
250
(which is true)
200 C(0, 175)
So, the half plane is towards
the origin. 150

On solving the equations 100 B(200, 50)

x + y = 250 50
(250, 0)A
and 5x + 8y = 1400, we get O 50 100150200 250300350 400 X
B(200, 50). (0, 0)
x + y = 250 5x + 8y = 1400
∴ Feasible region is OABCO.
The corner points of the feasible region are A(250, 0), B(200, 50) and
C(0, 175). The values of Z at these points are as follows:
Corner point Z = 4500 x + 5000 y
A(250, 0) 1125000
B(200, 50) 1150000 → Maximum
C(0, 175) 875000

The maximum value of Z is 1150000 at point B (200, 50).

Thus, the merchant should stock 200 desktop models and 50 portable
models to get the maximum profit of ` 1150000.
Question 9. A diet is to contain atleast 80 units of vitamin A and
100 units of minerals. Two foods F1 and F2 are available. Food F1 costs ` 4
per unit and food F2 costs ` 6 per unit. One units of food F1 contains at
3 units of vitamin A and 4 units of minerals. One unit of food F2 contains
6 units of vitamin A and 3 units of minerals. Formulate this as a linear
programming problem. Find the minimum cost for diet that consists of
mixture of these two foods and also meets the minimal nutritional
requirements.
Solution Let the diet contains x unit of food F1 and y units of food F2.
We construct the following table :
Vitamin A per Cost
Type Number Minerals per unit
unit (in `)
F1 x 3x 4x 4x
F2 y 6y 3y 6y
Total x+ y 3x + 6 y 4x + 3y 4x + 6 y
The cost of food F1 is ` 4 per unit and of food F2 is ` 6 per unit.
So, our problem is to minimize Z = 4x + 6y …(i)
Subject to constraints 3x + 6y ≥ 80 …(ii)
4x + 3y ≥ 100 …(iii)
x ≥ 0, y ≥ 0 …(iv)
678 www.arihantbooks.com

Firstly, draw the Y

graph of the line 35
3x + 6y = 80 C(0, 100/3)
0 80/3 30
x
y 40/3 0 25
Putting (0, 0) in the 20
inequality
3x + 6y ≥ 80, we have 15
3 × 0 + 6 × 0 ≥ 80 ⇒
0 ≥ 80 (which is false) 10
So, the half plane is 5 (24, 4/3)
away from the origin. B A(80/3, 0)
Since, x, y ≥ 0 X
O 5 10 15 20 25 30 35 40 45
So, the feasible (0, 0)
region lies in the first 3x + 6y = 80
quadrant. 2x + 3y = 52
4x + 3y = 100
Secondly, draw the
graph of the line 4x + 3y = 100
x 0 25
y 100/3 0
Putting (0, 0) in the inequality 4x + 3y ≥ 100, we have
4 × 0 + 3 × 0 ≥ 100 ⇒ 0 ≥ 100 (which is false)
So, the half plane is away from the origin.
On solving the equations 3x + 6y = 80 and 4x + 3y = 100, we get B(24, 4/3)
It can be seen that the feasible region is unbounded.
 80   4
The corner points of the feasible region are A  ,0 , B 24,  and
 3   3
 100
C 0,  . The values of Z at these points are as follows:
 3 
Corner point Z = 4x + 6y
A  ,0 
80 320
= 106.67
 3  3
104 → Minimum
B  24, 
4
 3

C  0,
100  200

 3 
As the feasible is unbounded therefore, 104 may or may not be the
minimum value of Z.
For this, we draw a graph of the inequality, 4x + 6y < 104 or 2x + 3y < 52
and check, whether the resulting half plane has points in common with
the feasible region or not.
It can be seen that the feasible region has no common point with
2x + 3y < 52
Therefore, the minimum cost of the mixture will be ` 104.
 NCERT Class XII Mathematics Solutions 679

Question 10. There are two types of fertilizers F1 and F2 . F1 consists of

10% nitrogen and 6% phosphoric acid and F2 consists of 5% nitrogen and
10% of phosphoric acid. After testing the soil conditions, a farmer finds
that she needs atleast 14 kg of nitrogen and 14 kg of phosphoric acid for
her crop. If F1 costs ` 6/kg and F2 costs ` 5/kg, determine how much of
each type of fertilizer should be used so that nutrient requirements are
met at a minimum cost. What is the minimum cost?
Solution Let the farmer uses x kg of F1 and y kg of F2. We have
construct the following table :
Quantity Phosphoric Cost
Type Nitrogen
(in kg) acid (in `)
F1 x 10 1 6 6x
x= x x
100 10 100
F2 y 5 1 10 5y
y= y y
100 20 100
Total x+ y x
+
y 6x
+
10 y 6 x + 5y
10 20 100 100
Requirement (in kg) 14 14

Total cost of fertilizers, Z = 6x + 5y

So, our problem is to minimize Z = 6x + 5y …(i)
x y
Subject to constraints + ≥ 14 ⇔ 2x + y ≥ 280 …(ii)
10 20
6x 10y
m + ≥ 14 ⇔ 3x + 5y ≥ 700 …(iii)
100 100
x ≥ 0, y ≥ 0 …(iv)
Firstly, draw the graph of the line 2x + y = 280
x 0 140
y 280 0
Putting (0, 0) in the inequality 2x + y ≥ 280, we have
2 × 0 + 0 ≥ 280
⇒ 0 ≥ 280 (which is false)
So, the half plane is away from the origin.
Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
Secondly, draw the graph of the line
3x + 5y = 700
x 0 700/3
y 140 0
Putting (0, 0) in the inequality 3x + 5y ≥ 700, we have
3 × 0 + 5 × 0 ≥ 700 ⇒ 0 ≥ 700 (which is false)
680 www.arihantbooks.com

So, the half plane is Y

away from the origin. 320
On solving the 280 C(0, 280)
equations
2x + y = 280 and 240
3x + 5y = 700, we get
B( 100, 80). 200
It can be seen that the 160
feasible region is
unbounded. 120
The corner points of 80 B(100, 80)
the feasible region are
 700  40
A , 0 , B(100, 80) A(700/3, 0)
 3  X'
O 40 80 120 160 200 240 280 320 X
and C(0, 280). The (0, 0)
values of Z at these 3x + 5y = 700
Y'
points are as follows : 2x + y = 280
6x + 5y = 1000

Corner point Z = 6 x + 5y

A 
700  1400
, 0
 3 
B(100, 80) 1000 → Minimum
C(0, 280) 1400

As the feasible region is unbounded therefore, 1000 may or may not be the
minimum value of Z. For this, we draw a graph of the inequality,
6x + 5y < 1000 and check, whether the resulting half plane has points in
common with the feasible region or not.
It can be seen that the feasible region has no common point with
6x + 5y < 1000.
Therefore, 100 kg of fertilizer F1 and 80 kg of fertilizer F2 should be used to
minimize the cost. The minimum cost is ` 1000.
Question 11. The corner points of the feasible region determined by the
following system of linear inequalities :
2 x + y ≤ 10, x + 3 y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let
Z = px + qy, where p, q > 0. Condition on p and q so that the maximum of Z
occurs at both (3, 4) and (0, 5) is
(a) p = q (b) p = 2 q (c) p = 3 q (d) q = 3 p
Solution (d) The maximum value of Z is unique.
It is given that the maximum value of Z occurs at two points (3, 4) and
(0, 5). Value of Z at (3, 4) = Value of Z at (0, 5)
⇒ p(3) + q(4) = p(0) + q(5), 3p + 4q = 5q ⇒ 3p = q
Hence, option (d) is correct.
 NCERT Class XII Mathematics Solutions 681

Miscellaneous Exercise
Question 1. A dietician has to develop a special diet using two foods P
and Q. Each packet (containing 30 g) of food P contains 12 units of
calcium, 4 units of iron, 6 units of cholesterol and 6 units of vitamin A.
Each packet of the same quantity of food Q contains 3 units of calcium, 20
units of iron, 4 units of cholesterol and 3 units of vitamin A. The diet
requires atleast 240 units of calcium, atleast 460 units of iron and at most
300 units of cholesterol. How many packets of each food should be used to
maximize the amount of vitamin A in the diet? What is the maximum
amount of vitamin A in the diet?
Solution Let the dietician uses x packets of food P and y packets of Q.
We construct the following table :
Number of Amount of Amount of Amount of Amount of
Foods
packets calcium iron cholesterol vitamin A
P x 12x 4x 6x 6x
Q y 3y 20y 4y 3y
Total x+ y 12 x + 3y 4x + 20 y 6 x + 4y 6 x + 3y
Requires Atleast 240 Atleast 460 Atmost 300
So, our problem is to maximize Z = 6x + 3y …(i)
Subject to constraints 12x + 3y ≥ 240 ⇔4x + y ≥ 80 …(ii)
4x + 20y ≥ 460 ⇔ x + 5y ≥ 115 …(iii)
6x + 4y ≤ 300 ⇔ 3x + 2y ≤ 150 …(iv)
x ≥ 0,y ≥ 0 …(v)
Firstly, draw the graph of the line 4x + y = 80
x 20 0
y 0 80
Putting (0, 0) in the inequality 4x + y ≥ 80, we have
4 × 0 + 0 ≥ 80 ⇒0 ≥ 80 (which is false)
So, the half plane is away from the origin.
Secondly, draw the graph of the line x + 5y = 115
x 0 115
y 23 0
Putting (0, 0) in the inequality x + 5y ≥ 115, we have
0 + 5 × 0 ≥ 115 ⇒0 ≥ 115 (which is false)
So, the half plane is away from the origin.
Thirdly, draw the graph of the line 3x + 2y = 150
x 50 0
y 0 75
Putting (0, 0) in the inequality 3x + 2y ≤ 150, we have
3 × 0 + 2 × 0 ≤ 150 ⇒ 0 ≤ 150 (which is true)
682 www.arihantbooks.com

So, the half plane is Y

towards the origin.
Since, x, y ≥ 0 120
So, the feasible region
lies in the first quadrant. 100
On solving equations 80 C(2, 72)
4x + y = 80 and
x + 5y = 115, we get 60
A(15, 20).
40 A(15, 20)
Similarly, solving the
equations, 3x + 2y = 150 20
B(40, 15)
and x + 5y = 115, we get
B(40, 15).
O 20 40 60 80 100 120 X
∴ Feasible region is (0, 0)
ABCA. x + 5y = 115
The corner points of the 4x + y = 80 3x + 2y = 150

feasible region are A(15, 20), B(40, 15) and

C(2, 72). The values of Z at these points are as follows:
Corner point Z = 6 x + 3y
A(15, 20) 150
B(40, 15) 285 → Maximum
C(2, 72) 228
Thus, the maximum value of Z is 285 at B(40, 15).
Therefore, to maximize the amount of vitamin A in the diet, 40 packets of
food P and 15 packets of food Q should be used. The maximum amount of
vitamin A in the diet is 228 units.
Question 2. A farmer mixes two brands P and Q of cattle feed. Brand P,
costing ` 250 per bag, contains 3 units of nutritional element A, 2.5 units of
elements B and 2 units of element C. Brand Q costing ` 200 per bag
contains 1.5 units of nutritional element A, 11.25 units of element B and 3
units of element C. The minimum requirements of nutrients A, B and C
are 18 units, 45 units and 24 units respectively. Determine the number of
bags of each brand which should be mixed in order to produce a mixture
having a minimum cost per bag? What is the minimum cost of the mixture
per bag?
Solution Let the farmer mixes x bags of brand P and y bags of brand
Q. We construct the following table:
Number of Element A Element B Element C Cost
Brands
bags (units) (units) (units) (per bag)
P x 3x 2.5x 2x 250x
Q y 1.5y 11.25y 3y 200y
Total x+ y 3x + 1.5y 2.5x + 11.25y 2 x + 3y 250 x + 200 y
Minimum 18 45 24
Requires
So, our problem is minimize Z = 250x + 200y …(i)
 NCERT Class XII Mathematics Solutions 683

Subject to constraints 3x + 1.5y ≥ 18 ⇔ 2x + y ≥ 12 …(ii)

2.5x + 1125
. y ≥ 45 ⇔ 2x + 9y ≥ 36 …(iii)
2x + 3y ≥ 24 …(iv)
x ≥ 0, y ≥ 0 …(v)
Firstly, draw the graph of the line 3x + 1.5y = 18
x 6 0
y 0 12
Putting (0, 0) in the inequality 3x + 1.5y ≥ 18, we have
3 × 0 + 1.5 × 0 ≥ 18 ⇒ 0 ≥ 18 (which is false)
So, the half plane is away from the origin.
Secondly, draw the graph of the line 2.5x + 11.25y = 45
x 18 0
y 0 4
Putting (0, 0) in the inequality 2.5x + 1125
. y ≥ 45, we have
2.5 × 0 + 1125
. × 0 ≥ 45 ⇒ 0 ≥ 45 (which is false)
So, the half plane is away from the origin.
Thirdly, draw the graph of the line 2x + 3y = 24
x 0 12
y 8 0
Putting (0, 0) in the inequality 2x + 3y ≥ 24, we have
2 × 0 + 3 × 0 ≥ 24 ⇒ 0 ≥ 24 (which is false)
So, the half plane is away from the origin. Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
On solving equations 3x + 1.5y = 18 and 2x + 3y = 24, we get C(3, 6).
Similarly, on solving equations 2.5x + 1125. y = 45 and 2x + 3y = 24, we get
B(9, 2).
Y
14

12 D(0, 12)

10

8
C(3, 6)
6

4
B(9, 2)
2
A(18, 0)
O X
2 4 6 8 10 12 14 16 18
(0, 0) 2.5x + 11.25y = 45
2x + 3y = 24
3x + 1.5y = 18
5x + 4y = 39
684 www.arihantbooks.com

The corner points of the feasible region are A(18, 0), B(9, 2), C(3, 6) and
D (0, 12). The values of Z at these points are as follows:
Corner point Z = 250 x + 200 y
A(18, 0) 4500
B(9, 2) 2650
C(3, 6) 1950 → Minimum
D(0, 12) 2400
As the feasible region is unbounded, therefore 1950 may or may not be the
minimum value of Z.
For this, we draw a graph of the inequality 250x + 200y < 1950 or
5x + 4y < 39 and check, whether the resulting half plane has points in
common with the feasible region or not.
It can be seen that the feasible region has no common point with
5x + 4y < 39.
Therefore, the minimum value of Z is 1950 at C(3, 6).
Thus, 3 bags of brand P and 6 bags of brand Q should be used in the
mixture to minimize the cost to ` 1950.
Question 3. A dietician wishes to mix together two kinds of food X and
Y in such a way that the mixture contains atleast 10 units of vitamin A, 12
units of vitamin B and 8 units of vitamin C. The vitamin contents of 1 kg
food is given below.
Food Vitamin A Vitamin B Vitamin C
X 1 2 3
Y 2 2 1
1 kg of food X costs of ` 16 and 1 kg of food Y costs ` 20. Find the least cost
of the mixture which will produce the required diet?
Solution Let the dietician mixes x kg of food X and y kg of food Y. We
construct the following table:
Food Amount Vitamin A Vitamin B Vitamin C Cost
X x kg x 2x 3x 16x
Y y kg 2y 2y y 20y
Total (x + y) kg x + 2y 2x + 2y 3x + y 16 x + 20 y
Minimum 10 12 8
Requires
So, our problem is to minimize Z = 16x + 20y …(i)
Subject to constraints x + 2y ≥ 10 …(ii)
2x + 2y ≥ 12 ⇔ x + y ≥ 6 …(iii)
3x + y ≥ 8 …(iv)
x ≥ 0, y ≥ 0 …(v)
Firstly draw the graph of the line x + 2y = 10
x 0 10
y 5 0
 NCERT Class XII Mathematics Solutions 685

Putting (0, 0) in the inequality x + 2y ≥ 10, we have

0 + 2 × 0 ≥ 10 ⇒0 ≥ 10 (which is false)
So, the half plane is away from the origin.
Secondly draw the graph of the line x + y = 6
x 0 6
y 6 0

Putting (0, 0) in the inequality x + y ≥ 6 we have

0 + 0 ≥6 ⇒0 ≥6 (which is false)
So, the half plane is away from the origin.
Thirdly draw the graph of the line 3x + y = 8
x 0 8/3
y 8 0

Putting (0, 0) in the inequality 3x + y ≥ 8, we have

3 ×0 + 0 ≥8 ⇒ 0 ≥8 (which is false)
So, the half plane is Y
away from the origin. 14
Since, x, y ≥ 0
12
So, the feasible region
lies in the first 10
quadrant.
8 D(0, 8)
On solving equations
x + y =6 6 C(1, 5)
and x + 2y = 10, we get
4 B(2, 4)
B(2, 4)
Similarly, solving the 2
equations 3x + y = 8 A(10, 0)
and x + y = 6, we get X' X
O 2 4 6 8 10 12 14 16 18
C(1, 5).
(0, 0)
The corner points of
Y' x+y=6 x + 2y = 10
the feasible region are
A(10, 0), B(2, 4), C(1, 5) 3 x + y = 8 4 x + 5 y = 28
and D(0, 8). The values
of Z at these points are as follows:
Corner point Z = 16 x + 20 y
A(10, 0) 160
B(2, 4) 112 → Minimum
C(1, 5) 116
D(0, 8) 160
As the feasible region is unbounded, therefore 112 may or may not be the
minimum value of Z.
For this, we draw a graph of the inequality, 16x + 20y < 112 or 4x + 5y < 28
and check, whether the resulting half plane has points in common with
the feasible region or not.
686 www.arihantbooks.com

It can be seen that the feasible region has no common point with
4x + 5y < 28.
Therefore, the minimum value of Z is 112 at B(2, 4).
Thus, the mixture should contain 2 kg of food X and 4 kg of food Y. The
minimum cost of the mixture is ` 112.
Question 4. A manufacturer make two types of toys A and B. Three
machines are needed for this purpose and the time (in minutes) required
for each toy on the machines is given below.
Machines
Types
I II III
A 12 18 6
B 6 0 9
Each machine is available for a maximum of 6 h per day. If the profit on
each toy of type A is ` 7.50 and that the each toy of type B is ` 5, show that
15 toys of type A and 30 of type B should be manufactured in a day to get
maximum profit.
Solution Let the manufacturer makes x toys of type A and y toys of
type B. We construct the following table:
Time of Time of Time of
Number Profit
Type of toys machine I machine II machine III
of toys (in `)
(in min) (in min) (in min)
A x 12x 18x 6x 7.50 x
B y 6y 0y 9y 5y
Total x+ y 12 x + 6 y 18 x + 0 y 6x + 9y 7.50 x + 5y
Maximum 6 × 60 = 360 6 × 60 = 360 6 × 60 = 360
requires
Our problem is to maximize Z = 7.50x + 5y …(i)
Subject to constraints 12x + 6y ≤ 360 ⇔ 2x + y ≤ 60 …(ii)
18x ≤ 360 ⇔ x ≤ 20 …(iii)
6x + 9y ≤ 360 ⇔ 2x + 3y ≤ 120 …(iv)
x ≥ 0, y ≥ 0 …(v)
Firstly, draw the graph of the line 2x + y = 60
x 0 30
y 60 0
Putting (0, 0) in the inequality 2x + y ≤ 60, we have
2 × 0 + 0 ≤ 60 ⇒ 0 ≤ 60 (which is true)
So, the half plane is towards the origin.
Secondly, draw the graph of the line 2x + 3y = 120
x 0 60
y 40 0

Putting (0, 0) in the inequality 2x + 3y ≤ 120, we have

 NCERT Class XII Mathematics Solutions 687

2 × 0 + 3 × 0 ≤ 120 Y
⇒ 0 ≤ 120 80
(which is true)
70
So, the half plane is
towards the origin. 60
Thirdly, draw the
50
graph of the line x = 20
D(0, 40)
Putting (0, 0) in the 40
inequality x ≤ 20, we
have 0 ≤ 20 30 C(15, 30)
(which is true) 20 B(20, 20)
So, the half plane is
towards the origin. 10
A(20, 0)
Since, x, y ≥ 0 X' X
O 10 20 30 40 50 60 70 80
So, the feasible region (0, 0)
lies in the first 2x + 3y = 120
quadrant. Y' 2x + y = 60
x = 20
On solving equations
2x + y = 60 and 2x + 3y = 120, we get C(15, 30)
Similarly, solving the equations x = 20 and 2x + y = 60, we get B(20, 20).
∴ Feasible region is OABCDO.
The corner points of the feasible region are A(20, 0), B(20, 20), C(15, 30)
and D(0, 40). The values of Z at these points are as follows:
Corner point Z = 7.50 x + 5 y
0(0, 0) 0
A(20, 0) 150
B(20, 20) 250
C(15, 30) 712.5 → Maximum
D(0, 40) 200
Thus, the maximum value of Z is 712.5 C(15, 30).
Thus, the manufacturer should manufacture 15 toys of type A and 30 toys
of type B to maximize the profit.
Question 5. An aeroplane can carry a maximum of 200 passengers. A
profit of ` 1000 is made on each executive class ticket and a profit of ` 600
is made on each economy class ticket. The airline reserves atleast 20 seats
for executive class. However atleast 4 times as many passengers prefer to
travel by economy class than by the executive class. Determine how
many tickets of each type must be sold in order to maximize the profit for
the airline. What is the maximum profit?
Solution Let x passengers travel by executive class and y passengers
travel by economy class. We construct the following table :
Class Number of tickets Profit (in `)
Executive x 1000x
Economy y 600y
Total x+ y 1000 x + 600 y
688 www.arihantbooks.com

So, our problem is to maximizeZ = 1000x + 600y …(i)

Subject to constraints x + y ≤ 200 …(ii)
x ≥ 20 …(iii)
y − 4x ≥ 0 ⇔ y ≥ 4x …(iv)
x ≥ 0, y ≥ 0 …(v)
Firstly, draw the graph of the line x + y = 200
x 0 200
y 200 0
Putting (0, 0) in the inequality x + y ≤ 200, we have
0 + 0 ≤ 200 ⇒ 0 ≤ 200 (which is true)
So, the half Y
plane is towards
the origin. 200
Secondly, draw 180 C(20, 180)
the graph of the B(40, 160)
line y = 4x 160

x 0 20 140
y 0 80 120
Putting (10, 0) in 100
the inequality A(20, 80)
y ≥ 4x, we have 80
0 ≥ 4 × 10 60
⇒ 0 ≥ 40
40
(which is false)
So, the half 20
plane is towards X
X-axis. O 20 40 60 80 100 120 140 160 180 200
(0, 0) x + y = 200
Thirdly, draw
the graph of the x = 20
line x = 20 y – 4x = 0

Putting (0, 0) in the inequality x ≥ 20, we have 0 ≥ 20 (which is false)

So, the half plane is away from the origin. Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
On solving the equations, we get A(20, 80), B(40, 160) and C(20, 180).
∴ Feasible region is ABCA.
The corner points of the feasible region are A(20, 80), B(40, 160) and
C(20, 180). The value of Z at these points are as follows:
Corner point 1000 x + 600 y
A(20, 80) 68000
B(40, 160) 136000 → Maximum
C(20, 180) 128000
Thus, the maximum value of Z is 136000 at B(40, 160).
Thus, 40 tickets of executive class and 160 tickets of economy class should
be sold to maximize the profit and the maximum profit is ` 136000.
 NCERT Class XII Mathematics Solutions 689

Question 6. Two godowns A and B have grain capacities of 100 quintals

and 50 quintals respectively. They supply to 3 ration shops, D, E and F,
whose requirements are 60, 50 and 40 quintals respectively. The cost of
transportation per quintal from the godowns to the shops are given in the
following table :
Transportation cost per quintal (in `)
From/ To A B
D 6 4
E 3 2
F 2.50 3
How would the supplies be transported in order that the transportation
cost is minimum. What is the minimum cost?
Assume A supplies x and y quintals of grain to D and E respectively.
Then, ( 100 − x − y ) quintals are supplied to F. Now, mathematically
formulate the problem, find total cost of transportation (Z). From
equations by using constraints and plot them on a graph. Find the
feasible region and find out the corner points along with value of Z at
each corner point. Observe to minimum value of Z.
Solution Let godown A supplies x and y quintals of grain to the shops
D and E respectively.
Then, (100 − x − y) will be supplied to shop F.
The requirement at shop D is 60 quintals, since x quintals are transported
from godown A. Therefore, the remaining (60 − x) quintals are transported
from godown B. Similarily, (50 − y) quintals and
40 − (100 − x − y) = (x + y − 60) quintals will be transported from godown B
to shops E and F respectively. The given problem can be represented
diagrammatically as follows:
Let Z be the total cost of transportation then,
Z = 6x + 3y + 2.50(100 − x − y) + 4 (60 − x) + 2 (50 − y) + 3 (x + y) − 60)
= 6x + 3y + 250 − 2.5x − 2.5y + 240 − 4x + 100 − 2y + 3x + 3y − 180
= 2.50x + 1.50y + 410 …(i)
Godown 10
A 0–
100 quintal (x
x `2 +y
.50 )
`6 `3 y

Shop D Shop E Shop F

60 quintal 50 quintal 40 quintal

60 `4 ` 2 50 – y
`3 y) }
– x+
x Godown 0 –(
10 60
B
0 –{ y–
50 quintal 4 x+
=
690 www.arihantbooks.com

Subject to constraints are 60 − x ≥ 0 ⇔ x ≤ 60 … (ii)

50 − y ≥ 0 ⇔ y ≤ 50 … (iii)
100 − (x + y) ≥ 0 ⇔ x + y ≤ 100 … (iv)
x + y − 60 ≥ 0 ⇔ x + y ≥ 60 … (v)
x ≥ 0, y ≥ 0 … (vi)
Firstly, draw the graph of the line x + y = 100
x 0 100
y 100 0
Putting (0, 0) in the inequality x + y ≤ 100, we have
0 + 0 ≤ 100 ⇒ 0 ≤ 100 (which is true)
So, the half plane is towards the origin.
Secondly, draw the graph of the line x = 60
Putting (0, 0) in the inequality x ≤ 60, we have 0 ≤ 60 (which is true)
So, the half plane is towards the origin.
Thirdly, draw the graph of the line x + y = 60
x 0 60
y 60 0
Putting (0, 0) in Y
the inequality 100
x + y ≥ 60, we
have 90
0 + 0 ≥ 60
80
⇒ 0 ≥ 60
(which is false) 70
So, the half
plane is away 60
from the D(10, 50) C(50, 50)
50
origin.
B(60, 40)
Fourthly, draw 40
the graph of
the line y = 50 30
Putting (0, 0) in 20
the inequality
y ≤ 50, we 10
have 0 ≤ 50 A(60, 0)
(which is true) X
O 10 20 30 40 50 60 70 80 90 100
So, the half (0, 0) x + y = 100
plane is x + y = 60
x = 60
towards the
origin. Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
The intersection points of the given lines are A (60, 0), B(60, 40), C (50, 50)
and D (10, 50).
∴ Feasible region is ABCDA.
 NCERT Class XII Mathematics Solutions 691

The corner points of the feasible region are A(60, 0) B(60, 40), C(50, 50) and
D(10, 50). The values of Z at these points are as follows:
Corner point Z = 2 .5 x + 1 .5 y + 410
A(60, 0) 560
B(60, 40) 620
C(50, 50) 610
D(10, 50) 510 → minimum
The minimum value of Z is 510 at D(10, 50).
Thus, the amount of grain transported from A to D, E and F is 10 quintals,
50 quintals and 40 quintals respectively and from B to D, E and F is
50 quintals, 0 quintal and 0 quintal respectively.
The minimum cost is ` 510.
Question 7. An oil company has two depots A and B with capacities of
7000 L and 4000 L respectively. The company is to supply oil to three
petrol pumps D, E and F, whose requirements are 4500 L, 3000 L and
3500 L respectively. The distances (in km) between the depots and the
petrol pumps is given in the following table :
From/ To A B
D 7 3
E 6 4
F 3 2
Assuming that the transportation cost of 10 L of oil is ` 1 per km. How
should that delivery be scheduled in order that the transportation cost is
minimum? What is the minimum cost?
Let x and y L of oil be supplied from A to petrol pumps D and E. Then,
( 7000 − x − y ) will be supplied from A to petrol pump F. Frame equations
by using constraints and plot them on a graph. Find the triangle region
and find out the corner points along with value of Z at each corner point.
observe to the minimum value.
Solution Let x and y L of oil be supplied from A to the petrol pumps, D
and E. Then, A
(7000 − x − y) will be 7000 L 70 `
supplied from A to x 00 3
petrol pump F. The y –x
`7 `6 –y
requirement at petrol
pump D is 4500 L. D E F
Since, x L are 4500 L 3000 L 3500 L
transported from depot (3000 – y) ` 4
` 0
A, the remaining 45 3 50
00 –3
(4500 − x) L will be –x y
B x+ `2
transported from petrol
pump B. 4000 L
Similarly, (3000 − y) L and 3500 − (7000 − x − y) = (x + y − 3500) L will be
transported from depot B to petrol pump E and F respectively. The given
problem can be represented diagrammatically as follows:
692 www.arihantbooks.com

∴Transportation cost of 10 L is ` 1 per km.

1
∴ Transportation of 1 L is per km.
10
Let Z be the total cost of transportation then.
7 6 3 3
Z= x + y+ (7000 − x − y) + (4500 − x)
10 10 10 10
4 2
+ (3000 − y) + (x + y − 3500)
10 10
= 0.3x + 0.1y + 3950
So, our problem is to minimize Z = 0.3x + 0.1y + 3950 …(i)
Subject to constraints are 4500 − x ≥ 0 ⇔ x ≤ 4500 …(ii)
3000 − y ≥ 0 ⇔ y ≤ 3000 …(iii)
x + y − 3500 ≥ 0 ⇔ x + y ≥ 3500 …(iv)
7000 − x − y ≥ 0 ⇔ x + y ≤ 7000 …(v)
x ≥ 0, y ≥ 0 …(vi)
Firstly, draw the graph of the line x + y = 7000
x 0 7000
y 7000 0
Putting (0, 0) in the inequality x + y ≤ 7000, we have
0 + 0 ≤ 100 ⇒0 ≤ 7000 (which is true)
So, the half plane is towards the origin.
Secondly, draw the graph of the line x = 4500
Putting (0, 0) in the inequality x ≤ 4500, we have
0 ≤ 4500 (which is true)
So, the half plane is towards the origin.
Thirdly, draw the graph
Y
of the line x + y = 3500
x 3500 0 8000
y 0 3500
7000
Putting (0, 0) in the
x = 4500
inequality x + y ≥ 3500, 6000
we have
5000
0 + 0 ≥ 3500
⇒ 0 ≥ 3500 4000
(which is false) E(500, 3000) D(4500, 3000)
3000 y = 3000
So, the half plane is C(4500, 2500)
away from the origin. 2000
Fourthly, draw the
graph of the line 1000
y = 3000 (3500, 0)A B(4500, 0)
X
Putting (0, 0) in the O
1000

2000

3000

4000

5000

6000

7000

8000

inequality y ≤ 3000, we (0, 0)

have x + y = 3500 x + y = 7000
 NCERT Class XII Mathematics Solutions 693

0 ≤ 3000 (which is true)

So, the half plane is towards the origin. Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
The intersection points of given lines are C(4500, 2500), D (4500, 3000) and
E (500, 3000).
∴ Feasible region is ABCDEA.
The corner points of the feasible region are A(3500, 0), B(4500, 0),
C(4500, 2500), D(4500, 3000) and E (500, 3000). The values of Z at these
points are as follows.
Corner point Z = 0.3 x + 0.1y + 3950
A(3500, 0) 5000
B(4500, 0) 5300
C(4500, 2500) 5550
D(4500, 3000) 5600
E(500, 3000) 4400 → Minimum

The minimum value of Z is 4400 at E(500, 3000).

Thus, the oil supplied from depot A is 500 L, 3000 L and 3500 L and from
depot B is 4000 L, 0 L and 0 L to petrol pumps D, E and F respectively.
The minimum transportation cost is ` 4400.
Question 8. A fruit grower can use two types of fertilizer in his garden,
brand P and brand Q. The amounts (in kg) of nitrogen, phosphoric acid,
potash and chlorine in a bag of each brand are given in the table. Tests
indicate that the garden needs atleast 240 kg of phosphoric acid, atleast
270 kg of potash and atmost 310 kg of chlorine. If the grower wants to
minimize the amount of nitrogen added to the garden, how many bags of
each brand should be used. What is the minimum amount of nitrogen
added in the garden?
kg per bag
Fertilizer Brand P Brand Q
Nitrogen 3 3.5
Phosphoric acid 1 2
Potash 3 1.5
Chlorine 1.5 2
Solution Let the fruit grower mixes x bags of brand P and y bags of
brand Q. Construct the following table:
Amount of
Brand of Number of Amount of Amount of Amount of
phosphoric
fertilizer bags nitrogen potash chlorine
acid
P x 3x x 3x 1.5x
Q y 3.5y 2x 1.5y 2y
Total x+ y 3x + 3.5y x + 2y 3x + 1.5y 1.5x + 2 y
694 www.arihantbooks.com

Our problem is to minimize Z = 3x + 3.5y …(i)

Subject to constraints are x + 2y ≥ 240 …(ii)
3x + 1.5y ≥ 270 …(iii)
1.5x + 2y ≤ 310 …(iv)
x ≥ 0, y ≥ 0 …(v)
Firstly, draw the graph of the line x + 2y = 240
x 0 240
y 120 0
Putting (0, 0) in the inequality x + 2y ≥ 240, we have
0 + 2 × 0 ≥ 240 ⇒0 ≥ 240 (which is false)
So, the half plane is away from the origin.
Secondly, draw the graph of the line 3x + 1.5y = 270
x 0 90
y 180 0
Putting (0, 0) in the inequality 3x + 1.5y ≥ 270, we have
3 × 0 + 1.5 × 0 ≥ 270 ⇒0 ≥ 270 (which is false)
So, the half plane is away from the origin.
Thirdly, draw the graph of the line 1.5x + 2y = 310
x 0 620/3
y 155 0
Putting (0, 0) in the inequality 1.5x + 2y ≤ 310, we have
1.5 × 0 + 2 × 0 ≤ 310 ⇒0 ≤ 310 (which is true)
So, the half plane is towards the origin.
Y
200

180

160
B(20, 140)
140

120

100 C(40, 100)

80

60 A(140, 50)

40

20

X' X
O 30 60 90 120 150 180 210 240 270
(0, 0)
x + 2y = 240
Y' 3x + 1.5y = 270 1.5x + 2y = 310
 NCERT Class XII Mathematics Solutions 695

Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
Let Z be the total cost.
On solving equations 1.5x + 2y = 310 and x + 2y = 240, we get
A(140, 50)
Similarly, on solving equations 3x + 1.5y = 270 and 1.5x + 2y = 310,
we get B(20, 140).
∴ Feasible region is ABCA.
The corner points of the feasible region are A(140, 50), B(20, 140) and
C(40, 100).
Corner point Z = 3 x + 3.5 y
A(140, 50) 595
B(20, 140) 550
C(40, 100) 470 → Minimum
The minimum value of Z is 470 at C(40, 100).
Thus, 40 bags of brand P and 100 bags of brand Q should be added to the
garden to minimize the amount of nitrogen.
The minimum amount of nitrogen added to the garden is 470 kg.
Question 9. A fruit grower can use two types of fertilizer in his garden,
brand P and brand Q. The amounts (in kg) of nitrogen, phosphoric acid,
potash and chlorine in a bag of each brand are given in the table. Tests
indicate that the garden needs atleast 240 kg of phosphoric acid, atleast
270 kg of potash and atmost 310 kg of chlorine. If the grower wants to
maximize the amount of nitrogen added to the garden, how many bags of
each brand should be added? What is the maximum amount of nitrogen
added?
Brand P Brand Q
Nitrogen 3 3.5
Phosphoric acid 1 2
Potash 3 1.5
Chlorine 1.5 2
Solution Let the fruit grower mixes x bags of brand P and y bags of
brand Q. Construct the following table:
Amount of
Brand of Number of Amount of Amount of Amount of
phosphoric
fertilizer bags nitrogen potash chlorine
acid
P x 3x 1x 3x 1.5x
Q y 3.5y 2y 1.5y 2y
Total x+ y 3x + 3.5 y x + 2y 3x + 1.5 y 1.5x + 2 y
Our problem is to minimize
Z = 3x + 3.5y …(i)
Subject to the constraints are x + 2y ≥ 240 …(ii)
3x + 1.5y ≥ 270 …(iii)
1.5x + 2y ≤ 310 …(iv)
696 www.arihantbooks.com

x ≥ 0, y ≥ 0 …(v)
Firstly, draw the graph of the line x + 2y = 240
x 0 240
y 120 0
Putting (0, 0) in the inequality x + 2y ≥ 240, we have
0 + 2 × 0 ≥ 240 ⇒0 ≥ 240 (which is false)
So, the half plane is away from the origin.
Secondly, draw the graph of the line 3x + 1.5y = 270
x 0 90
y 180 0
Putting (0, 0) in the inequality 3x + 1.5y ≥ 270, we have
3 × 0 + 1.5 × 0 ≥ 270 ⇒ 0 ≥ 270 (which is false)
So, the half plane is away from the origin.
Thirdly draw the graph of the line 1.5x + 2y = 310
x 0 620/3
y 155 0
Putting (0, 0) in the inequality 1.5x + 2y ≤ 310, we have
1.5 × 0 + 2 × 0 ≤ 310 ⇒ 0 ≤ 310 (which is true)
So, the half plane is towards the origin.
The intersection point of lines 3x + 1.5y = 270 and 1.5x + 2y = 310 is
B(20, 140); of lines 1.5x + 2y = 310 and x + 2y = 240 is A (140, 50); of lines
x + 2y = 240 and 3x + 1.5y = 270 is C(40, 100).
Y
200

180

160
B(20, 140)
140

120

100 C(40, 100)

80

60 A(140, 50)

40

20

X
O 30 60 90 120 150 180 210 240 270
(0, 0)
x + 2y = 240
1.5x + 2y = 310
3x + 1.5y = 270
 NCERT Class XII Mathematics Solutions 697

Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
Let Z be the total cost.
The corner points of the feasible region are C(40, 100), A(140, 50) and
B (20, 140). The values of Z at these points are as follows:
Corner point Z = 3 x + 3.5 y
A(140, 50) 595 → Minimum
B(20, 140) 550
C(40, 100) 470

The maximum value of Z is 595 at (140, 50).

Thus, 140 bags of brand P and 50 bags of brand Q should be added to the
garden to maximize the amount of nitrogen.
The maximum amount of nitrogen added to the garden is 595 kg.
Question 10. A toy company manufactures two types of dolls A and B.
Market tests and available resources have indicated that the combined
production level should not exceed 1200 dolls per week and the demand
for dolls of type B is atmost half of that for dolls of type A. Further, the
production level of dolls of type A can exceed three times the production
of dolls of type B by atmost 600 units. If the company makes profit of ` 12
and ` 16 per doll respectively on dolls A and B, how many of each should
be produced weekly in order to maximize the profit?
Solution Let the company manufactures x dolls of type A and y dolls of
type B, then x ≥ 0, y ≥ 0 …(i)
x + y ≤ 1200 …(ii)
y ≤ x /2 ⇔ x − 2y ≥ 0 …(iii)
x ≤ 3y + 600 ⇔ x − 3y ≤ 600 …(iv)
Firstly, draw the graph of the line x + y = 1200
x 1200 0
y 0 1200
Putting (0, 0) in the inequality x + y ≤ 1200, we have
0 + 0 ≤ 1200 ⇒ 0 ≤ 1200 (which is true)
So, the half plane is towards the origin.
Secondly, draw the graph of the line x − 2y = 0
x 0 2
y 0 1
Putting (200, 0) in the inequality x − 2y ≥ 0, we have
200 − 2 × 0 ≥ 0 ⇒200 ≥ 0 (which is true)
So, the half plane is towards the X-axis.
Thirdly, draw the graph of the line x − 3y = 600
x 600 0
y 0 −200
698 www.arihantbooks.com

Putting (0, 0) in the Y

inequality
x − 3y ≤ 600, we 1400
have
1200
0 + 3 × 0 ≤ 600
1000
⇒ 0 ≤ 600
800
(which is true)
So, the half plane is 600
towards the x-axis. 400 C(800, 400)
Since, x, y ≥ 0 200
So, the feasible 100 B(1050, 150)
region lies in the A(600, 0)
first quadrant. X
O

1200
100
200
400

600
800
1000

1400
1600
The point of x = 2y
(0, 0) x – 3y = 600
intersection of lines x + y = 1200
x − 3y = 600 and
x + y = 1200 is B(1050, 150); of lines x = 2y and x + y = 1200 is C (800, 400).
Let Z be the total profit, then
Z = 12x + 16y
∴ Feasible region is OABCO.
The corner points of the feasible region are A(600, 0), B(1050, 150) and
C(800, 400). The values of Z at these points are as follows:
Corner point Z = 12 x + 16 y
A(600, 0) 7200
B(1050, 150) 15000
C(800, 400) 16000 → Maximum

The maximum value of Z is 16000 at C(800, 400).

Thus, 800 and 400 dolls of types A and type B should be produced
respectively to get the maximum profit of ` 16000.

Selected NCERT Exemplar Problems

Question 1. A man rides his motorcycle at the speed of 50 km/h He has
to spend ` 2 per km on petrol. If he rides it at a faster speed of 80 km/h, the
petrol cost increases to ` 3 per km. He has atmost ` 120 to spend on petrol
and one hour's time. He wishes to find the maximum distance that he can
travel. Express this problem as a linear programming problem.
Solution Here, the first is mathematical formulation of linear
programming problem.
 NCERT Class XII Mathematics Solutions 699

Step I Let the man rides x km at the speed of 50 km/h and y km at the
speed of 80 km/h.
The total distance travelled is x + y, which we have to maximize under
certain constraints.
The objective function is Z = x + y
To find constraints (cost and time)
Given, the cost of 1 km at the speed of 50 km/h = ` 2
∴The cost of x km at the speed of 50 km/h = 2x
Given, the cost of 1 km at the speed of 80 km/h = ` 3
∴The cost of y km at the speed of 80 km/h = 3y
So, total cost of travelling(x + y) km = 2x + 3y. Given that the rider has
` 120 to spend. Hence, 2x + 3y ≤ 120
Time constraint —
Total available time = 1 h
Time to travel a distance of 50 km = 1 h
x
∴Time to travel a distance of x km = h
50
Also, time to travel a distance of 80 km = 1 h
y
∴ Time to travel a distance of y km = h
80
Hence, the inequation representing time constraint is,
x y
+ ≤ 1 ⇒ 80x + 50y ≤ 4000 ⇒ 8x + 5y ≤ 400
50 80
To sum up the mathematical formulation of LPP is
To maximize Z=x+y …(i)
Subject to the constraints are 2x + 3y ≤ 120 …(ii)
8x + 5y ≤ 400 …(iii)
x, y ≥ 0 …(iv)
Firstly, draw the graph of the line 2x + 3y = 120
x 0 60
y 40 0
Putting (0, 0) in the inequality 2x + 3y ≤ 120, we have
2 × 0 + 3 × 0 ≤ 120 ⇒ 0 ≤ 120 (which is true)
So, the half plane is towards the origin.
Secondly, draw the graph of the line 8x + 5y = 400
x 0 50
y 80 0
Putting (0, 0) in the inequality 8x + 5y ≤ 400, we have
8 × 0 + 5 × 0 ≤ 400 ⇒ 0 ≤ 400 (which is true)
So, the half plane is towards the origin.
Since, x, y ≥ 0
700 www.arihantbooks.com

So, the feasible region lies in the first quadrant.

The point of intersection of lines
8x + 5y = 400
 300 80
and 2x + 3y = 120 is B  , 
 7 7
Y
100

90

80

70

60

50

40 C(0, 40)

30

20
B(300/7, 80/7)
10
A(50, 0)
X
O 10 20 30 40 50 60 70 80 90 100
(0, 0)
2x + 3y = 120
8x + 5y = 400

∴ Feasible region is OABCO.

The corner points of the feasible region are O(0, 0), A(50, 0), B(300/7, 80/7)
and C(0, 40). The values of Z at these points are as follows:
Corner point Z= x + y
O(0, 0) 0
A(50, 0) 50
B(300/7, 80/7) 54.28 → Maximum
C(0, 40) 40
The maximum value of Z is 54.28 at B(300/7, 8/70).
Question 2. A firm has to transport 1200 packages using large vans
which can carry 200 packages each and small vans which can take
80 packages each. The cost for engaging each large van is ` 400 and each
small van is ` 200. Not more than ` 3000 is to be spent on the job and the
number of large vans cannot exceed the number of small vans. Formulate
this problem as a LPP given that the objective is to minimize the cost.
Solution Let x be the number of large vans and y be number of small
vans, then the problem is to be minimize
 NCERT Class XII Mathematics Solutions 701

Z = 400x + 200y (cost)

Subject to constraints are
400x + 200y ≤ 3000 ⇒ 2x + y ≤ 15
x≤y
200x + 80y ≥ 1200 ⇒ 5x + 2y ≥ 30
x, y ≥ 0
Question 3. A manufacturer produces two models of bikes-model X
and model Y. Model X takes a 6 man-hours to make per unit, while model
Y takes 10 man-hours per unit. There is a total of 450 man-hour available
per week. Handling and marketing costs are ` 2000 and ` 1000 per unit for
models X and Y respectively. The total funds vailable for these purposes
are ` 80000 per week. Profits per unit for models X and Y are ` 1000 and
` 500, respectively. How many bikes of each model should the
manufacturer produce so as to yield a maximum profit? Find the
maximum profit.
Solution Let the manufacturer produces x units of model X and y units
of model Y.
Then, our problem is to maximize
Z = 1000x + 500y
Subject to the constraints are
6x + 10y ≤ 450 ⇔ 3x + 5y ≤ 225 …(i)
2000x + 1000y ≤ 80000 ⇔ 2x + y ≤ 80 …(ii)
x, y ≥ 0
Firstly, draw the graph of the line 3x + 5y = 225
x 0 75
y 45 0

Putting (0, 0) in the inequality 3x + 5y ≤ 225, we have

3 × 0 + 5 × 0 ≤ 225 ⇒ 0 ≤ 225 (which is true)
So, the half plane is towards the origin.
Secondly, draw the graph of the line 2x + y = 80
x 0 40
y 80 0
Putting (0, 0) in the inequality 2x + y ≤ 80, we have
2 × 0 + 0 ≤ 80 ⇒ 0 ≤ 80 (which is true)
So, the half plane is towards the origin.
Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
The point of intersection of the lines 2x + y = 80
and 3x + 5y = 225 is B(25, 30)
Let Z be the total cost. Then, our problem is to maximize
z = 1000x + 500y
702 www.arihantbooks.com

Y
100

90

80

70

60

50
A(0, 45)
40
B(25, 30)
30

20

10
C(40, 0)
X
O 10 20 30 40 50 60 70 80 90 100
(0, 0)
2x + y = 80 3x + 5y = 225

The corner points of the feasible region are O(0, 0) A (0, 45), B(25, 30) and
C(40, 0). The values of Z at these points are as follows:
Corner point Z = 1000 x + 500 y
O(0, 0) 0
A(0, 45) 22500
B(25, 30) 40000 → Maximum
C(40, 0) 40000 → Rejected

So, 25 bikes of model X and 30 bikes of model Y should be produced as to

maximize the project. Maximum profit = ` 40000
Question 4. A company makes 3 model of calculators A, B and C at
factory I and factory II. The company has orders for atleast
6400 calculators of model A, 4000 calculators of model B and
4800 calculators of model C. At factory I, 50 calculators of model A, 50 of
model B and 30 of model C are made every day; at factory II,
40 calculators of model A, 20 of model B and 40 of model C are made
everyday. It costs ` 12000 and ` 15000 each day to operate factory I and II
respectively. Find the number of days each factory should operate to
minimize the operating costs and still meet the demand.
Solution Let factory I be operated for x days and factory II for y days.
Then, our problem is to minimize,
Z = 12000x + 15000y (operating cost)
 NCERT Class XII Mathematics Solutions 703

Subject to constraints are

50x + 40y ≥ 6400
⇒ 5x + 4y ≥ 640 …(i)
50x + 20y ≥ 4000
⇒ 5x + 2y ≥ 400 …(ii)
30x + 40y ≥ 4800
⇒ 3x + 4y ≥ 480 …(iii)
Also, x, y ≥ 0
Firstly, draw the graph of the line 5x + 4y = 640

x 0 128
y 160 0

Putting (0, 0) in the inequality 5x + 4y ≥ 640, we have

5 × 0 + 4 × 0 ≥ 640
⇒ 0 ≥ 640 (which is true)
So, the half plane is away from the origin.
Secondly, draw the graph of line 5x + 2y = 400

x 0 80
y 200 0

Putting (0, 0) in the inequality

5x + 2y ≥ 400
5 × 0 + 2 × 0 ≥ 400
⇒ 0 ≥ 400 (which is false)
So, the half plane is away from the origin.
Thirdly, draw the graph of the line 3x + 4y = 480

x 0 160
y 120 0

Putting (0, 0) in the inequality 3x + 4y ≥ 480, we have

3 × 0 + 4 × 0 ≥ 480
⇒ 0 ≥ 480 (which is false)
So, the half plane is away from the origin.
Since, x, y ≥ 0
So, the feasible region lies in the first quadrant.
704 www.arihantbooks.com

Y
200 D(0, 200)
180
160
140
120 C(32, 120)

100
80
B(80, 60)
60
40
20
A(160, 0)
X
O 20 40 60 80 100 120 140 160 180 200
(0, 0)
5x + 4y = 640 3x + 4y = 480
5x + 2y = 400

The corner points of the feasible region are A(160, 0), B(80, 60), C(32, 120)
and D(0, 200). The values of Z at these points are as follows:
Corner point Z = 12000 x + 15000 y
C(32, 120) 2184000
B(80, 60) 1860000 → Minimum
A(160, 0) 1920000
D(0, 200) 3000000
So, factory I should be operated for 80 days and factory II should be
operated for 60 days.