Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

12.3 EXERCISE
SHORT ANSWER TYPE QUESTIONS
Q1. Determine the maximum value of Z = 11x + 7y subject to the
constraints:
2x + y  6, x  2, x  0, y  0
Sol. Given that: Z = 11x + 7y and the constraints 2x + y  6, x  2,
x  0, y  0
Let 2x + y = 6
x 0 3
y 6 0
The shaded area OABC is the
feasible region determined by
the constraints
2x + y  6, x  2, x  0, y  0
The feasible region is bounded.
So, maximum value will occur at a corner point of the feasible
region.
Corner points are (0, 0), (2, 0), (2, 2) and (0, 6).
Now, evaluating the value of Z, we get
Corner points Value of Z
O(0, 0) 11(0) + 7(0) = 0
A(2, 0) 11(2) + 7(0) = 22
B(2, 2) 11(2) + 7(2) = 36
C(0, 6) 11(0) + 7(6) = 42  Maximum
Hence, the maximum value of Z is 42 at (0, 6).
Q2. Maximise Z = 3x + 4y, subject to the constraints: x + y  1, x  0,
y  0.
Sol. Given that: Z = 3x + 4y and the constraints x + y  1, x  0, y  0
Let x+y = 1
x 1 0
y 0 1

www.mathongo.com 1
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

The shaded area OAB is the

feasible region determined by
x + y  1, x  0, y  0.
The feasible region is bounded.
So, maximum value will occur
at the corner points O(0, 0),
A(1, 0), B(0, 1).
Now, evaluating the value of
Z, we get
Corner points Value of Z
O(0, 0) 3(0) + 4(0) = 0
A(1, 0) 3(1) + 4(0) = 3
B(0, 1) 3(0) + 4(1) = 4  Maximum
Hence, the maximum value of Z is 4 at (0, 1).
Q3. Maximise the function Z = 11x + 7y subject to the constraints:
x  3, y  2, x  0, y  0.
Sol. The shaded region is the
feasible region determined
by the constraints x  3, y  2,
x  0, y  0.
The feasible region is
bounded with four corners
O(0, 0), A(3, 0), B(3, 2) and
C(0, 2).
So, the maximum value can
occur at any corner.
Let us evaluate the value of Z.
Corner points Value of Z
O(0, 0) 11(0) + 7(0) = 0
A(3, 0) 11(3) + 7(0) = 33
B(3, 2) 11(3) + 7(2) = 47  Maximum
C(0, 2) 11(0) + 7(2) = 14
Hence, the maximum value of the function Z is 47 at (3, 2).
Q4. Minimise Z = 13x – 15y subject to the constraints:
x + y  7, 2x – 3y + 6  0, x  0, y  0.
Sol. Given that: Z = 13x – 15y and the constraints
x + y  7, 2x – 3y + 6  0, x  0, y  0

www.mathongo.com 2
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

Let x + y = 7
x 3 4
y 4 3
Let 2x – 3y + 6 = 0
x 1 –3
y 2 0
The shaded region is the
feasible region determined
by the constraints x + y  7, 2x – 3y + 6  0, x  0, y  0
The feasible region is bounded with four corners
O(0, 0), A(7, 0), B(3, 4), C(0, 2)
So, the maximum value can occur at any corner.
Let us evaluate the value of Z.
Corner points Value of Z
O(0, 0) 13(0) – 15(0) = 0
A(7, 0) 13(7) – 15(0) = 91
B(3, 4) 13(3) – 15(4) = – 21
C(0, 2) 13(0) – 15(2) = – 30  Minimum
Hence, the minimum value of Z is – 30 at (0, 2).
Q5. Determine the maximum value of Z = 3x + 4y if the feasible
region (shaded) for a LPP
is shown in figure.
Sol. As shown in the figure,
OAED is the feasible
region.
At A, y = 0 \ 2x + y = 104
 x = 52
Which gives corner point
A = (52, 0)
At D, x = 0 \ x + 2y = 76  y = 38
Which gives corner point D = (0, 38)
Now solving the given equations, we get
x + 2y = 76
2x + y = 104
2x + 4y = 152
2x + y = 104
(–) (–) (–)
3y = 48  y = 16

www.mathongo.com 3
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

x + 2(16) = 76

 x = 76 – 32 = 44
So, the corner point E = (44, 16)
Evaluating the maximum value of Z, we get
Corner points Z = 3x + 4y
O(0, 0) Z = 3(0) + 4(0) = 0
A(52, 0) Z = 3(52) + 4(0) = 156
E(44, 16) Z = 3(44) + 4(16) = 196  Maximum
D(0, 38) Z = 3(0) + 4(38) = 152
Hence, the maximum value of Z is 196 at (44, 16).
Q6. Feasible region (shaded) for a LPP is shown in figure.
Maximise Z = 5x + 7y.
Sol. OABC is the feasible region
whose corner points are
O(0, 0), A(7, 0), B(3, 4) and
C(0, 2)
Evaluating the value of Z, we
get
Corner points Value of Z
O(0, 0) Z = 5(0) + 7(0) = 0
A(7, 0) Z = 5(7) + 7(0) = 35
B(3, 4) Z = 5(3) + 7(4) = 43  Maximum
C(0, 2) Z = 5(0) + 7(2) = 14
Hence, the maximum value of Z is 43 at (3, 4).
Q7. The feasible region for a LPP is shown in figure. Find the
minimum value of Z = 11x + 7y.
Sol. As per the given figure,
ABCA is the feasible
region. Corner points
C(0, 3), B(0, 5) and for A,
we have to solve equations
x + 3y = 9
and x+y = 5
Which gives x = 3, y = 2
i.e., A(3, 2)
Evaluating the value of Z, we get

www.mathongo.com 4
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

Corner points Value of Z

A(3, 2) Z = 11(3) + 7(2) = 47
B(0, 5) Z = 11(0) + 7(5) = 35
C(0, 3) Z = 11(0) + 7(3) = 21  Minimum
Hence, the minimum value of Z is 21 at (0, 3).
Q8. Refer to Exercise 7 above. Find the maximum value of Z.
Sol. As per the evaluating table for the value of Z, it is clear that
the maximum value of Z is 47 at (3, 2).
Q9. The feasible region for a LPP is shown in figure. Evaluate
Z = 4x + y at each of the corner points of this region. Find the
minimum value of Z, if it exists.
Sol. As per the given figure, ABC is the feasible region which is
open unbounded.
Here, we have
x+y = 3 ...(i)
and x + 2y = 4 ...(ii)
Z = 4x + y
Solving eq. (i) and (ii), we
get
x = 2 and y = 1
So, the corner points are
A(4, 0), B(2, 1) and C(0, 3)
Let us evaluate the value of Z
Corner points Z = 4x + y
A(4, 0) Z = 4(4) + (0) = 16
B(2, 1) Z = 4(2) + (1) = 9
C(0, 3) Z = 4(0) + (3) = 3  Minimum
Now, the minimum value of Z is 3 at (0, 3) but since, the
feasible region is open bounded so it may or may not be the
minimum value of Z.
Therefore, to face such situation, we draw a graph of 4x + y < 3
and check whether the resulting open half plane has no point
in common with feasible region. Otherwise Z will have no
minimum value. From the graph, we conclude that there is no
common point with the feasible region.
Hence, Z has the minimum value 3 at (0, 3).
Q10. In given figure, the feasible region (shaded) for a LPP is shown.
Determine the maximum and minimum value of Z = x + 2y.

www.mathongo.com 5
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

Sol. Here, corner points are given as follows:

Ê 7 3ˆ Ê 3 15 ˆ Ê 3 24 ˆ Ê 18 2 ˆ

R , , Q , , P Á , ˜ and S Ë , ¯ .
Ë 2 4¯ Ë2 4 ¯ Ë 13 13 ¯ 7 7
Now, evaluating the value of Z for the feasible region RQPS.
Corner points Value of Z = x + 2y
Ê 7 3ˆ 7 Ê 3ˆ
R , Z= +2 =5
Ë 2 4¯ 2 Ë 4¯

Ê 3 15 ˆ 3 Ê 15 ˆ  Maximum
Q , Z= +2 =9
Ë2 4 ¯ 2 Ë 4¯

Ê 3 24 ˆ 3 Ê 24 ˆ 51
PÁ , ˜ Z= + 2Á ˜ =
Ë 13 13 ¯ 13 Ë 13 ¯ 13

Ê 18 2 ˆ 18 Ê 2 ˆ 22  Minimum
S , Z= +2 =
Ë 7 7¯ 7 Ë7¯ 7

Ê 3 15 ˆ
Hence, the maximum value of Z is 9 at , and the
Ë2 4 ¯
22 Ê 18 2 ˆ
minimum value of Z is at Ë , ¯ .
7 7 7
Q11. A manufacturer of electric circuits has a stock of 200 resistors,
120 transistors and 150 capacitors and is required to produce

www.mathongo.com 6
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

two types of circuits A and B. Type A requires 20 resistors, 10

transistors and 10 capacitors. Type B requires 10 resistors, 20
transistors and 30 capacitors. If the profit on type A circuit is
` 50 and that on type B circuit is ` 60, formulate this problem
as a LPP so that the manufacturer can maximise his profit.
Sol. Let x units of type A and y units of type B electric circuits be
produced by the manufacturer.
As per the given information, we construct the following table:
Items Type A (x) Type B (y) Maximum stock
Resistors 20 10 200
Transistors 10 20 120
Capacitors 10 30 150
Profit ` 50 ` 60 Z = 50x + 60y
Now, we have the total profit in rupees Z = 50x + 60y to
maximise subject to the constraints
20x + 10y 200 ...(i); 10x + 20y  120 ...(ii)
10x + 30y  150 ...(iii); x  0, y  0 ...(iv)
Hence, the required LPP is
Maximise Z = 50x + 60y subject to the constraints
20x + 10y 200  2x + y  20; 10x + 20y  120  x + 2y  12
and 10x + 30y  150  x + 3y  15, x  0, y  0
Q12. 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 minimise cost.
Sol. Let x and y be the number of large and small vans respectively.
From the given information, we construct the following
corresponding constraints table;
Items Large vans Small vans Maximum/
(x) (y) Minimum
Packages 200 80 1200
Cost 400 200 3000
Now the objective function for minimum cost is
Z = 400x + 200y
Subject to the constraints;
200x + 80y  1200  5x + 2y  30 ...(i)

www.mathongo.com 7
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

400x + 200y  3000  2x + y  15 ...(ii)

xy ...(iii)
and x  0, y  0 (non-negative constraints)
Hence, the required LPP is to minimise Z = 400x + 200y
Subject to the constraints 5x + 2y  30, 2x + y  15, x  y and
x  0, y  0.
Q13. A company manufactures two types of screws A and B. All
the screws have to pass through a threading machine and a
slotting machine. A box of type A screws requires 2 minutes on
the threading machine and 3 minutes on the slotting machine.
A box of type B screws requires 8 minutes of threading on
threading machine and 2 minutes on the slotting machine. In
a week, each machine is available for 60 hours.
On selling these screws, the company gets a profit of ` 100
per box on type A screws and ` 170 per box on type B screws.
Formulate this problem as a LPP given that the objective is to
maximise profit.
Sol. Let the company manufactures x boxes of type A screws and
y boxes of type B screws.
From the given information, we can construct the following
table.
Items Type A Type B Minimum time available
(x) (y) on each machine
in a week
Time required on
2 8 60 × 60 = 3600 minutes
threading machine
Time required on
3 2 60 × 60 = 3600 minutes
slotting machine
Profit ` 100 ` 170
As per the information in the above table, the objective
function for maximum profit Z = 100x + 170y
Subject to the constraints
2x + 8y  3600  x + 4y  1800 ...(i)
3x + 2y  3600 ...(ii)
x  0, y  0 (non-negative constraints)
Hence, the required LPP is
Maximise Z = 100x + 170y
Subject to the constraints,
x + 4y  1800, 3x + 2y  3600, x  0, y  0.

Q14. A company manufactures two types of sweaters: type A and
type B. It costs ` 360 to make a type A sweater and ` 120 to make
a type B sweater. The company can make at most 300 sweaters
and spend at most ` 72000 a day. The number of sweaters of

www.mathongo.com 8
 Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

type B cannot exceed the number of sweaters of type A by

more than 100. The company makes a profit of ` 200 for each
sweater of type A and ` 120 for every sweater of type B.
Formulate this problem at a LPP to maximise the profit to the
company.
Sol. Let x and y be the number of sweaters of type A and type B
respectively.
From the given information, we have the following constraints.
360x + 120y  72000 ⇒ 3x + y  600 ...(i)
x + y  300 ...(ii); x + 100  y ⇒ y ≤ x + 100 ...(iii)
Profit (Z) = 200x + 120y
Hence, the required LPP to maximise the profit is
Maximise Z = 200x + 120y subject to the constraints
3x + y  600, x + y  300, y  x + 100, x  0, y  0.
Q15. A man rides his motorcycle at the speed of 50 km/hr. He has to
spend ` 2 per km on petrol. If he rides it at a faster speed of 80
km/hr, 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.
Sol. Let the man covers x km on his motorcycle at the speed of
50 km/hr and covers y km at the speed of 80 km/hr.
So, cost of petrol = 2x + 3y
The man has to spend ` 120 atmost on petrol
\ 2x + 3y  120 ...(i)
Now, the man has only 1 hr time
x y
\ +  1  8x + 5y  400 ...(ii)
50 80
x  0, y  0
To have maximum distance Z = x + y.
Hence, the required LPP to travel maximum distance is
maximise Z = x + y, subject to the constraints
2x + 3y  120, 8x + 5y  400, x  0, y  0.
LONG ANSWER TYPE QUESTIONS
Q16. Refer to Exercise 11. How many of circuits of Type A and of
Type B, should be produced by the manufacturer so as to
maximise his profit? Determine the maximum profit.
Sol. As per the solution of Question No. 11, we have
Maximise Z = 50x + 60y subject to the contraints
2x + y  20 ...(i); x + 2y  12 ...(ii); + 3y  15 ...(iii); x  0, y  0...(iv)
Let us draw the table for the above statements
x 0 10 x 0 12
Table for (i) ; Table for (ii)
y 20 0 y 6 0

www.mathongo.com 9
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

x 0 15
Table for (ii)
y 5 0

Solving eq. (i) and (ii) we get,

28 4 Ê 28 4 ˆ
x=
, y= \ B Á , ˜ is the corner
3 3 Ë 3 3¯
Solving eq. (ii) and (iii) we get,
x = 6, y = 3 \ C(6, 3) is the corner

Solving eq. (i) and (iii) we get,
x = 9, y = 2
(not included in the feasible region)
Here, OABCD is the feasible region.
Ê 28 4 ˆ
So, the corner points are O(0, 0), A(10, 0), B Á , ˜ , C(6, 3)
Ë 3 3¯
and D(0, 5).
Let us evaluate the value of Z
Corner points Corresponding values of Z = 50x + 60y
O(0, 0) Z = 50(0) + 60(0) = 0
A(10, 0) Z = 50(10) + 60(0) = 500
Ê 28 4ˆ Ê 28 ˆ Ê 4 ˆ 1400 + 240
BÁ ,
Ë 3 ˜¯ Z = 50 ÁË ˜¯ + 60 ÁË ˜¯ =
3 3 3 3 3
1640
= = 546.6  Maximum
3
C(6, 3) Z = 50(6) + 60(3) = 480
D(0, 5) Z = 50(0) + 60(5) = 300
Here, the maximum profit is ` 546.6 which is not possible for
number of items in fraction.

www.mathongo.com 10
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

Hence, the maximum profit for the manufacturer is ` 480 at

(6, 3). Type A = 6 and Type B = 3.
Q17. Refer to Exercise 12. What will be the minimum cost?
Sol. As per the solution of Q. 12., we have Z = 400x + 200y
Subject to the constraints
5x + 2y  30 ...(i); 2x + y  15 ...(ii)
x  y, x  0, y  0
x–y0 ...(iii)
Let 5x + 2y = 30
x 0 6
y 15 0
Let 2x + y = 15

x 0 7.5
y 15 0
Let x – y = 0
x 0 1
y 0 1
30 30
Solving eq. (i) and (iii) we get; = and y =
7 7
and on solving eq. (ii) and (iii) we get, x = 5 and y = 5
Here, ABC is the shaded feasible region whose corner points
Ê 30 30 ˆ
are A , , B(5, 5) and C(0, 15)
Ë 7 7¯
Evaluating the value of Z, we have
Corner points Value of Z = 400x + 200y
Ê 30 30 ˆ Ê 30 ˆ Ê 30 ˆ
A , Z = 400 + 200
Ë 7 7¯ Ë 7¯ Ë 7¯
18000
= = 2571.4  Minimum
7
B(5, 5) Z = 400(5) + 200(5) = 3000
C(0, 15) Z = 400(0) + 200(15) = 3000

Ê 30 30 ˆ
Hence, the required minimum cost is ` 2571.4 at Ë , ¯ .
7 7
Q18. Refer to Exercise 13. Solve the linear programming program
and determine the maximum profit to the manufacturer.
Sol. As per the solution

www.mathongo.com 11
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

of Q. 13, we have:

Let 3x + 2y = 3600
x 0 1200
y 1800 0
Let x + 4y = 1800

x 0 1800
y 450 0
Maximise Z = 100x + 170y subject to the constraints
3x + 2y  3600 ...(i); x + 4y  1800 ...(ii)
x  0, y  0
On solving eq. (i) and (ii) we get
x = 1080 and y = 180

OABC is the feasible region whose corner points are O(0, 0),
A(1200, 0), B(1080, 180), C(0, 450).
Let us evaluate the value of Z.
Corner points Value of Z = 100x + 170y
O(0, 0) Z = 100(0) + 170(0) = 0
A(1200, 0) Z = 100(1200) + 0 = 120000
B(1080, 180) Z = 100(1080) + 170(180)  Maximum
= 138600
C(0, 450) Z = 170(450) = 76500
Hence, the maximum value of Z is 138600 at (1080, 180).
Q19. Refer to Exercise 14. How many sweaters of each type should
the company make in a day so as to get a maximum profit?
What is the maximum profit?
Sol. Referring to the solution of Q. 14, we have
Maximise Z = 200x + 120y subject to the constraints
x + y  300 ...(i); 3x + y  600 ...(ii)
x – y  – 100 ...(iii)
x  0, y  0
On solving eq. (i) and (iii) we have
x = 100, y = 200
On solving eq. (i) and (ii) we get
x = 150, y = 150
Let x + y = 300 Let 3x + y = 600 Let x + y = –100
x 0 300 x 0 200 x 0 –100
y 300 0 y 600 0 y 100 0

www.mathongo.com 12
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

Here, the shaded region is the feasible region whose corner
points are O(0, 0), A(200, 0), B(150, 150), C(100, 200), D(0, 100).
Let us evaluate the value of Z.
Corner points Value of Z = 200x + 120y
O(0, 0) Z = 200(0) + 120(0) = 0
A(200,0) Z = 200(200) + 120(0) = 40000
B(150, 150) Z = 200(150) + 120(150) = 48000 Maximum
C(100, 200) Z = 200(100) + 120(200) = 44000
D(0, 100) Z = 200(0) + 120(100) = 12000
Hence, the maximum value of Z is 48000 at (150, 150) i.e., 150
sweaters of each type.
Q20. Refer to Exercise 15, Determine the maximum distance that
the man can travel.
Sol. Referring to the solution of Q. 15, we have
Maximise Z = x + y subject to the constraints
Let 2x + 3y = 120 Let 8x + 5y = 400
x 0 60 x 0 50
y 40 0 y 80 0

www.mathongo.com 13
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

2x + 3y  120 ...(i); 8x + 5y  400 ...(ii)

x  0, y  0
300 80
On solving eq. (i) and (ii) we get; x = and y =
7 7
Here, OABC is the feasible region whose corner points are
Ê 300 80 ˆ
O(0, 0), A(50, 0), B , and C(0, 40).
Ë 7 7¯
Let us evaluate the value of Z
Corner points Value of Z = x + y
O(0, 0) Z=0+0=0
A(50, 0) Z = 50 + 0 = 50 km
Ê 300 80 ˆ 300 80 380
B , Z= + = = 54.3 km  Maximum
Ë 7 7¯ 7 7 7
C(0, 40) Z = 0 + 40 = 40 km
Hence, the maximum distance that the man can travel is
2 Ê 300 80 ˆ
54 km at , .
7 Ë 7 7¯
Q21. Maximise Z = x + y subject to x + 4y  8, 2x + 3y  12, 3x + y  9,
x  0, y  0.
Sol. We are given that Z = x + y subject to the constraints
x 0 8
y 2 0
x + 4y  8 ...(i)
x 0 6
2x + 3y  12 ...(ii)
y 4 0
x 0 3
3x + y  9 ...(iii) y 9 0
x  0, y  0

www.mathongo.com 14
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

On solving eq. (i) and (iii) we get

28 15
x=
and y =
11 11
Here, OABC is the feasible region whose corner points are
Ê 28 15 ˆ
O(0, 0), A(3, 0), B , , C(0, 2)
Ë 11 11 ¯
Let us evaluate the value of Z
Corner points Value of Z = x + y
O(0, 0) Z=0+0=0
A(3, 0) Z=3+0=3
Ê 28 15 ˆ 28 15 43
B , Z= + = = 3.9  Maximum
Ë 11 11 ¯ 11 11 11
C(0, 2) Z=0+2=2

Ê 28 15 ˆ
Hence, the maximum value of Z is 3.9 at Ë , ¯ .
11 11
Q22. 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 ` 2,000 and ` 1,000 per unit for Models X and Y
respectively. The total funds available for these purposes are
` 80,000 per week. Profits per unit for Models X and Y are
` 1,000 and ` 500 respectively. How many bikes of each model
should the manufacturer produce so as to yield a maximum
profit? Find the maximum profit.
Sol. Let x and y be the number of Models of bike produced by the
manufacturer.
Given information is
Model X takes 6 man-hours to make per unit
Model Y takes 10 man-hours to make per unit
Total man-hours available = 450

\ 6x + 10y  450  3x + 5y  225 ...(i)
Handling and marketing cost of Model X and Y are ` 2,000
and ` 1,000 respectively
Total funds available is ` 80,000 per week

\ 2000x + 1000y  80,000

 2x + y  80 ...(ii)

www.mathongo.com 15
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

and x  80, y  0
Profit (Z) per unit of models X and Y are ` 1,000 and ` 500
respectively
So, Z = 1000x + 500y
The required LPP is
Maximise Z = 1000x + 500y subject to the constraints
x 0 75
3x + 5y  225 ...(i)
y 45 0

x 0 40
2x + y  80 ...(ii)
y 80 0
x  0, y  0 ...(iii)

On solving eq. (i) and (ii)

we get, x = 25, y = 30
Here, the feasible region
is OABC, whose corner
points are
O(0, 0), A(40, 0), B(25, 30)
and C(0, 45).
Let us evaluate the value
of Z.

Corner points Value of Z = 1000x + 500y

O(0, 0) Z=0+0=0
A(40, 0) Z = 1000(40) + 0 = 40,000 Maximum
B(25, 30) Z = 1000(25) + 500(30) = 40,000 Maximum
C(0, 45) Z = 0 + 500(45) = 22500

Hence, the maximum profit is ` 40,000 by producing 25 bikes

of Model X and 30 bikes of Model Y.
Q23. In order to supplement daily diet, a person wishes to take
some X and some wishes Y tablets. The contents of iron,
calcium and vitamins in X and Y (in milligram per tablet) are
given as below:

www.mathongo.com 16
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

Tablets Iron Calcium Vitamin

X 6 3 2
Y 2 3 4
The person needs atleast 18 milligrams of iron, 21 milligrams
of calcium and 16 milligrams of vitamin. The price of each
tablet of X and Y is ` 2 and ` 1 respectively. How many tablets
of each should the person take in order to satisfy the above
requirement at the minimum cost?
Sol. Let there be x units of tablet X and y units of tablet Y
So, according to the given information, we have

6x + 2y  18  3x + y  9 ...(i) x 0 3
y 9 0
3x + 3y  21  x+y7 ...(ii) x 0 7
y 7 0
2x + 4y  16  x + 2y  8 ...(iii) x 0 8
y 4 0
x  0, y  0 ...(iv)
The price of each table of X type is ` 2 and that of y is ` 1.
So, the required LPP is
Minimise Z = 2x + y subject to the constraints
3x + y  9, x + y  7, x + 2y  8, x  0, y  0

On solving (ii) and (iii) we get

x = 6 and y = 1

www.mathongo.com 17
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

On solving (i) and (ii) we get x = 1 and y = 6

From the graph, we see that the feasible region ABCD is
unbounded whose corner points are A(8, 0), B(6, 1), C(1, 6)
and D(0, 9).
Let us evaluate the value of Z
Corner points Value of Z = 2x + y
A(8, 0) Z = 2(8) + 0 = 16
B(6, 1) Z = 2(6) + 1 = 13
C(1, 6) Z = 2(1) + 6 = 8  Minimum
D(0, 9) Z = 2(0) + 9 = 9
Here, we see that 8 is the minimum value of Z at (1, 6) but the
feasible region is unbounded. So, 8 may or may not be the
minimum value of Z.
To confirm it, we will draw a graph of inequality 2x + y < 8 and
check if it has a common point.
We see from the graph that there is no common point on the
line.
Hence, the minimum value of Z is 8 at (1, 6).
Tablet X = 1
Table Y = 6.
Q24 A company makes 3 models 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 everyday;
at factory II, 40 calculators of model A, 20 of model B and 40 of
model C are made everyday. It costs ` 12,000 and ` 15000 each
day to operate factory I and II respectively. Find the number
of days each factory should operate to minimise the operating
costs and still meet the demand.
Sol. Let factory I be operated for x days and II for y days
At factory I: 50 calculators of model A and at factory II,
40 calculators of model A are made everyday.
Company has orders of atleast 6400 calculators of model A.

\ 50x + 40y  6400  5x + 4y  640
Also, at factory I, 50 calculators of model B and at factory II,
20 calculators of model B are made everyday.
Company has the orders of atleast 4000 of calculators of
model B.

www.mathongo.com 18
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

\ 50x + 20y  4000  5x + 2y  4000

Similarly for model C,
30x + 40y  4800  3x + 4y  480
and x  0, y  0
It costs ` 12,000 and ` 15000 to operate the factories I and II
each day.
\ Required LPP is
Minimise Z = 12000x + 15000y subject to the constraints
5x + 4y  640 ...(i)
5x + 2y  400 ...(ii)
3x + 4y  480 ...(iii)
x  0, y  0 ...(iv)
Table for (i) equation 5x + 4y = 640
x 0 128
y 160 0
Table for (ii) equation 5x + 2y = 400
x 0 80
y 200 0
Table for (iii) equation 3x + 4y = 480
x 0 160
y 120 0

On solving eq. (i) and (iii), we get

x = 80, y = 60

www.mathongo.com 19
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

On solving eq. (i) and (ii) we get

x = 32 and y = 120

From the graph, we see that the feasible region ABCD is open
unbounded whose corners are A(160, 0), B(80, 60), C(32, 120)
and D(0, 200).
Let us find the values of Z.
Corner points Value of Z = 12000x + 15000y
A(160, 0) Z = 12000(160) + 0 = 1920000
B(80, 60) Z = 12000(80) + 15000(60)
= 1860000  Minimum
C(32, 120) Z = 12000(32) + 15000(120)
= 2184000
D(0, 200) Z = 0 + 15000(200) = 3000000
From the above table, it is clear that the value of Z = 1860000
may or may not be minimum for an open unbounded region.
Now, to decide this, we draw a graph of
12000x + 15000y < 1860000

 4x + 5y < 620
and we have to check whether there is a common point in this
feasible region or not.
So, from the graph, there is no common point.

\ Z = 12000x + 15000y has minimum value 1860000 at (80, 60).
Factory I : 80 days
Factory II: 60 days.
Q25. Maximise and minimise Z = 3x – 4y subject to x – 2y  0,
– 3x + y  4, x – y  6 and x, y  0.
Sol. Given LPP is
Maximise and minimise Z = 3x – 4y subject to
x 0 2
x – 2y  0 ...(i)
y 0 1

x 0 - 4/3
– 3x + y  4 ...(ii)
y 4 0

x 0 6
x–y  6 ...(iii)
y -6 0

and x, y  0 ...(iv)

www.mathongo.com 20
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

From the graph, we see that AOB is open unbounded region

whose corners are O(0, 0), A(0, 4), B(12, 6).
Let us evaluate the value of Z

Corner points Value of Z = 3x – 4y

O(0, 0) Z=0
A(0, 4) Z = 0 – 4(4) = – 16  Minimum
B(12, 6) Z = 3(12) – 4(6) = 12  Maximum

For this unbounded region, the value of Z may or may not be

– 16. So to decide it, we draw a graph of inequality 3x – 4y < – 16
and check whether the open half plane has common points
with feasible region or not. But from the graph, we see that
it has common points with the feasible region, so it will have
not minimum value of Z. Similarly for maximum value, we
draw the graph of inequality 3x – 4y > 12 in which there is no
common point with the feasible region.
Hence, the maximum value of Z is 12.

www.mathongo.com 21
 Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

OBJECTIVE TYPE QUESTIONS

Choose the correct answer from the given four options in each of the
Exercises 26 to 34.
Q26. The corner points of the feasible region determined by the
system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20),
(60, 0). The objective function is Z = 4x + 3y. Compare the
quantity in Column A and Column B
Column A Column B
Maximum of Z 325
(a) The quantity in column A is greater.
(b) The quantity in column B is greater
(c) The two quantities are equal
(d) The relationship cannot be determined on the basis of the
information supplied.

Sol. Corner points Value of Z = 4x + 3y

(0, 0) Z=0
(0, 40) Z = 0 + 3(40) = 120
(20, 40) Z = 4(20) + 3(40) = 200
(60, 20) Z = 4(60) + 3(20) = 300  Maximum
(60, 0) Z = 4(60) + 3(0) = 240
Hence, the correct option is (b).
Q27. The feasible solution for a
LPP is shown in figure. Let
Z = 3x – 4y be the objective
function. Minimum of Z
occurs at
(a) (0, 0) (b) (0, 8)
(c) (5, 0) (d) (4, 10)

Sol. Corner points Value of Z = 3x – 4y

O(0, 0) Z=0
A(5, 0) Z = 3(5) – 0 = 15
B(6, 5) Z = 3(6) – 4(5) = – 2
C(6, 8) Z = 3(6) – 4(8) = – 14
D(4, 10) Z = 3(4) – 4(10) = – 28
E(0, 8) Z = 3(0) – 4(8) = – 32  Minimum
Hence, the correct option is (b).

www.mathongo.com 22
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

Q28. Refer to Exercise 27. Maximum of Z occurs at

(a) (5, 0) (b) (6, 5) (c) (6, 8) (d) (4, 10)
Sol. According to solution of Q. 27, the maximum value of Z is 15
at A (5, 0).
Hence, the correct option is (a).
Q29. Refer to Exercise 27. (Maximum value of Z + Minimum value
of Z) is equal to
(a) 13 (b) 1 (c) – 13 (d) – 17
Sol. According to the solution of Q. 27, Maximum value of Z = 15
and Minimum value of Z = – 32
So, the sum of Maximum value and Minimum value of Z
= 15 + (– 32) = – 17
Hence, the correct option is (d).
Q30. The feasible region for an LPP is shown in the figure. Let
F = 3x – 4y be the objective function. Maximum value of F is
(a) 0 (b) 8 (c) 12 (d) – 18

Sol. The feasible region is shown in the figure for which the
objective function F = 3x – 4y

Corner point Value of F = 3x – 4y

O(0, 0) F=0
A(12, 6) F = 3(12) – 4(6) = 12  Maximum
B(0, 4) F = 0 – 4(4) = – 16  Minimum
Hence, the correct option is (c).
Q31. Refer to Exercise 30. Minimum value of F is
(a) 0 (b) – 16 (c) 12 (d) does not exist
Sol. According to the solution of Q. 30, the minimum value of F
is – 16 at (0, 4).
Hence, the correct option is (b).

www.mathongo.com 23
Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

Q32. Corner points of the feasible region for an LPP are (0, 2), (3, 0),
(6, 0), (6, 8) and (0, 5).
Let F = 4x + 6y be the objective function.
The minimum value of F occurs at
(a) (0, 2) only (b) (3, 0) only
(c) the mid-point of the line segment joining the points (0, 2)
and (3, 0) only
(d) any point on the line segment joining the points (0, 2) and (3, 0)
Sol. Corner points Value of F = 4x + 6y
(0, 2) Z = 4(0) + 6(2) = 12  Minimum
(3, 0) Z = 4(3) + 6(0) = 12  Minimum
(6, 0) Z = 4(6) + 6(0) = 24
(6, 8) Z = 4(6) + 6(8) = 72  Maximum
(0, 5) Z = 4(0) + 6(5) = 30
The minimum value of F occurs at any point on the line
segment joining the points (0, 2) and (3, 0).
Hence, the correct option is (d).
Q33. Refer to Exercise 32, Maximum of F – Minimum of F =
(a) 60 (b) 48 (c) 42 (d) 18
Sol. According to the solution of Q. 32,
Maximum value of F – Minimum value of F = 72 – 12 = 60
Hence, the correct option is (a).
Q34. Corner points of the feasible region determined by the system
of linear constraints are (0, 3), (1, 1) and (3, 0).
Let Z = px + qy, where p, q > 0. Condition on p and q so that the
minimum of Z occurs at (3, 0) and (1, 1) is
q
(a) p = 2q (b) p = (c) p = 3q (d) p = q
2
Sol. Corner points Value of Z = px + qy; p, q > 0
(0, 3) Z = p(0) + q(3) = 3q
(1, 1) Z = p(1) + q(1) = p + q
(3, 0) Z = p(3) + q(0) = 3p
So, condition of p and q so that the minimum of Z occurs at
(3, 0) and (1, 1) is
q
p + q = 3p  p – 3p + q = 0  p = .

2
Hence, the correct option is (b).

www.mathongo.com 24
 Chapter 12 - Linear Programming NCERT Exemplar - Maths - Class 12

Fill in the blanks in each of the Exercises 35 to 41.

Q35. In a LPP, the linear inequalities or restrictions on the variables
are called .................. .
Sol. constraints.
Q36. In a LPP, the objective function is always .................. .
Sol. linear.
Q37. If the feasible region for a LPP is .................. then the optimal
value of the objective function Z = ax + by may or may not exist.
Sol. open unbounded
Q38. In a LPP, if the objective function Z = ax + by has the same
maximum value at two corner points of the feasible region,
then every point on the line segment joining these two points
give the same .................. value.
Sol. maximum
Q39. A feasible region of a system of linear inequalities is said to be
.................. if it can be enclosed within a circle.
Sol. bounded
Q40. A corner point of a feasible region is a point in the region
which is the .................. of two boundary lines.
Sol. intersection
Q41. The feasible region for an LPP is always a.................. polygon.
Sol. convex
State whether the statements in Exercises 42 to 45 are True or False.
Q42. If the feasible region for a LPP is unbounded, maximum or mini-
mum of the objective function Z = ax + by may or may not exist.
Sol. True.
Q43. Maximum value of the objective function
Z = ax + by in a LPP always occurs at only one corner point of
the feasible region.
Sol. False.
Q44. In a LPP, the minimum value of the objective function
Z = ax + by is always 0 if the origin is one of the corner point
of the feasible region.
Sol. False.
Q45. In a LPP, the maximum value of the objective function
Z = ax + by is always finite.
Sol. True.

www.mathongo.com 25