Class-XII-Maths Linear Programming

CBSE NCERT Solutions for Class 12 Maths Chapter 12

Back of Chapter Questions

Exercise 𝟏𝟐. 𝟏

Solve the following Linear Programming Problems graphically:

1. Solve the following Linear Programming Problems graphically:

Maximize 𝑍 = 3𝑥 + 4𝑦 subject to the constraints: 𝑥 + 𝑦 ≤ 4, 𝑥 ≥ 0, 𝑦 ≥ 0. [2 Marks]

Solution:
Let us draw the graph for feasible region determined by the constraints, 𝑥 + 𝑦 ≤ 4, 𝑥 ≥ 0, 𝑦 ≥ 0, is
as follows.

[1 Mark]

Thus, the corner points of the feasible region are 𝑂(0, 0), 𝐴 (4, 0) and 𝐵(0, 4).

The values of 𝑍 at these points are as follows:

Corner point 𝑍 = 3𝑥 + 4𝑦
0(0, 0) 0
𝐴(4, 0) 12
𝐵(0, 4) 16 → Maximum
Hence, the maximum value of 𝑍 is 16 at the point 𝐵(0, 4). [1 Mark]

1
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

2. Solve the following Linear Programming Problems graphically:

Minimize 𝑍 = −3𝑥 + 4𝑦 subject to 𝑥 + 2𝑦 ≤ 8, 3𝑥 + 2𝑦 ≤ 12, 𝑥 ≥ 0, 𝑦 ≥ 0. [4 Marks]

Solution:
Let us graph the feasible region determined by the system of constraints, 𝑥 + 2𝑦 ≤ 8, 3𝑥 + 2𝑦 ≤
12, 𝑥 ≥ 0 and 𝑦 ≥ 0 is as follows:

[2 Marks]

Thus, the corner points of the feasible region are 𝑂(0, 0), 𝐴(4, 0), 𝐵(2, 3) and 𝐶(0, 4).

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = −3𝑥 + 4𝑦

0(0, 0) 0
𝐴(4, 0) −12 → Maximum
𝐵(2, 3) 6
𝐶(0, 4) 16
Hence, the minimum value of 𝑍 is −12 at the point (4, 0). ` [2 Marks]

3. Solve the following Linear Programming Problems graphically:

Maximise 𝑍 = 5𝑥 + 3𝑦

subject to 3𝑥 + 5𝑦 ≤ 15, 5𝑥 + 2𝑦 ≤ 10, 𝑥 ≥ 0, 𝑦 ≥ 0. [4 Marks]

Solution:

2
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Let us draw the graph for feasible region determined by the system of constraints, 3𝑥 + 5𝑦 ≤
15, 5𝑥 + 2𝑦 ≤ 10, 𝑥 ≥ 0 and 𝑦 ≥ 0 are as follows:

[2 Marks]
20 45
The corner points of the feasible region are 𝑂(0, 0), 𝐴(2, 0), 𝐵(0, 3) and 𝐶 (19 , 19).

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = 5𝑥 + 3𝑦
0(0, 0) 0
𝐴(2, 0) 10
𝐵(0, 3) 9
20 45 235 → Maximum
𝐶( , )
19 19 19
235 20 45
Hence, the maximum value of 𝑍 is at the point ( , ). [2 Marks]
19 19 19

4. Solve the following Linear Programming Problems graphically:

Minimise 𝑍 = 3𝑥 + 5𝑦

such that 𝑥 + 3𝑦 ≥ 3, 𝑥 + 𝑦 ≥ 2, 𝑥, 𝑦 ≥ 0. [6 Marks]

Solution:
Let us draw the graph for feasible region determined by the system of constraints, 𝑥 + 3𝑦 ≥ 3, 𝑥 +
𝑦 ≥ 2 and 𝑥, 𝑦 ≥ 0 is as follows:

3
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

It can be observed that the feasible region is unbounded. [2 Marks]

3 1
The corner points of the feasible region are 𝐴(3, 0), 𝐵 (2 , 2) and 𝐶(0, 2).

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = 3𝑥 + 5𝑦
𝐴(3, 0) 9
3 1 7 → Minimum
𝐵( , )
2 2
𝐶(0, 2) 10
As the feasible region is unbounded,

Thus, 7 may or may not be the minimum value of 𝑍. [2 Marks]

For this, we draw the graph of the inequality, 3𝑥 + 5𝑦 < 7 and check whether the resulting half
plane has points in common with the feasible region or not.

Thus, the feasible region has no common point with 3𝑥 + 5𝑦 < 7

3 1
Hence, the minimum value of 𝑍 is 7 at (2 , 2). [2 Marks]

4
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

5. Solve the following Linear Programming Problems graphically:

Maximise 𝑍 = 3𝑥 + 2𝑦

subject to 𝑥 + 2𝑦 ≤ 10, 3𝑥 + 𝑦 ≤ 15, 𝑥, 𝑦 ≥ 0. [4 Marks]

Solution:
Let us draw the graph for feasible region determined by the constraints, 𝑥 + 2𝑦 ≤ 10, 3𝑥 + 𝑦 ≤
15, 𝑥 ≥ 0 and 𝑦 ≥ 0 is as follows:

The corner points of the feasible region are 𝐴(5, 0), 𝐵(4, 3) and 𝐶(0, 5). [2 Marks]

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = 3𝑥 + 2𝑦
𝐴(5, 0) 15
𝐵(4, 3) 18 → Maximum
𝐶(0, 5) 10
Hence, the maximum value of 𝑍 is 18 at the point (4, 3). [2 Marks]

6. Solve the following Linear Programming Problems graphically:

Minimise 𝑍 = 𝑥 + 2𝑦

subject to 2𝑥 + 𝑦 ≥ 3, 𝑥 + 2𝑦 ≥ 6, 𝑥, 𝑦 ≥ 0. [4 Marks]

Solution:

5
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Let us draw the feasible region determined by the constraints, 2𝑥 + 𝑦 ≥ 3, 𝑥 + 2𝑦 ≥ 6, 𝑥 ≥ 0 and

𝑦 ≥ 0 is as follows:

The corner points of the feasible region are 𝐴(6, 0) and 𝐵(0, 3). [2 Marks]

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = 𝑥 + 2𝑦
𝐴(6, 0) 6
𝐵(0, 3) 6
The value of 𝑍 at points 𝐴 and 𝐵 is same.

If we take any other point such as (2, 2) on the line, 𝑥 + 2𝑦 = 6 then 𝑍 = 6

Thus, the minimum value of 𝑍 occurs for more than 2 points.

Hence, the value of 𝑍 is minimum at every point on the line, 𝑥 + 2𝑦 = 6 [2 Marks]

7. For the given Linear programming problem, show that the minimum of Z occurs at more than two
points.

Minimise and Maximise 𝑍 = 5𝑥 + 10𝑦

subject to 𝑥 + 2𝑦 ≤ 120, 𝑥 + 𝑦 ≥ 60, 𝑥 − 2𝑦 ≥ 0, 𝑥, 𝑦 ≥ 0. [4 Marks]

Solution:
Let us draw the graph for feasible region determined by the constraints, 𝑥 + 2𝑦 ≤ 120, 𝑥 + 𝑦 ≥
60, 𝑥 − 2𝑦 ≥ 0, 𝑥 ≥ 0 and 𝑦 ≥ 0 is as follows:

6
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

The corner points of the feasible region are 𝐴(60, 0), 𝐵(120, 0), 𝐶(60, 30) and 𝐷(40, 20). [2
Marks]

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = 5𝑥 + 10𝑦

𝐴(60, 0) 300 → Minimum
𝐵(120, 0) 600 → Maximum
𝐶(60, 30) 600 → Maximum
𝐷(40, 20) 400
Therefore, the minimum value of 𝑍 is 300 at (60, 0) and the maximum value of 𝑍 is 600 at all the
points on the line segment joining (120, 0) and (60, 30). [2 Marks]

8. For the given Linear programming problem, show that the minimum of Z occurs at more than two
points.

Minimise and Maximise 𝑍 = 𝑥 + 2𝑦

subject to 𝑥 + 2𝑦 ≥ 100, 2𝑥 − 𝑦 ≤ 0, 2𝑥 + 𝑦 ≤ 200; 𝑥, 𝑦 ≥ 0 [4 Marks]

Solution:
Let us draw the graph for feasible region determined by the constraints, 𝑥 + 2𝑦 ≥ 100, 2𝑥 − 𝑦 ≤
0, 2𝑥 + 𝑦 ≤ 200, 𝑥 ≥ 0 and 𝑦 ≥ 0 is as follows:

7
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

The corner points of the feasible region are 𝐴(0, 50), 𝐵(20, 40), 𝐶(50, 100) and 𝐷(0, 200).

[2 Marks]

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = 𝑥 + 2𝑦
𝐴(0, 50) 100 → Minimum
𝐵(20, 40) 100 → Minimum
𝐶(50, 100) 250
𝐷(0, 200) 400 → Maximum
Therefore, the maximum value of 𝑍 is 400 at (0, 200) and the minimum value of 𝑍 is 100 at all the
points on the line segment joining the points (0, 50) and (20, 40). [2 Marks]

9. For the given Linear programming problem, show that the minimum of Z occurs at more than two
points.

Maximise 𝑍 = −𝑥 + 2𝑦, subject to the constraints:

𝑥 ≥ 3, 𝑥 + 𝑦 ≥ 5, 𝑥 + 2𝑦 ≥ 6, 𝑦 ≥ 0 [4 Marks]

Solution:
Let us draw the graph for feasible region determined by the constraints, 𝑥 ≥ 3, 𝑥 + 𝑦 ≥ 5, 𝑥 +
2𝑦 ≥ 6 and 𝑦 ≥ 0 is as follows:

8
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

It can be observed that the feasible region is unbounded. [2 Marks]

The values of 𝑍 at corner points 𝐴(6, 0), 𝐵(4, 1) and 𝐶(3, 2) are as follows:

Corner point 𝑍 = −𝑥 + 2𝑦
𝐴(6, 0) 𝑍 = −6
𝐵(4, 1) 𝑍 = −2
𝐶(3, 2) 𝑍=1
As the feasible region is unbounded,

thus, 𝑍 = 1 may or may not be the maximum value.

So, for this, we graph the inequality, −𝑥 + 2𝑦 > 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, 𝑍 = 1 is not the maximum value. [2 Marks]

Hence, 𝑍 has no maximum value.

10. For the given Linear programming problem, show that the minimum of Z occurs at more than two
points.

Maximise 𝑍 = 𝑥 + 𝑦 subject to 𝑥 − 𝑦 ≤ −1, −𝑥 + 𝑦 ≤ 0, 𝑥, 𝑦 ≥ 0. [2 Marks]

Solution:
The region determined by the given constraints is as follows:

There is no feasible region and thus, 𝑍 has 𝑥 − 𝑦 ≤ −1, −𝑥 + 𝑦 ≤ 0, 𝑥, 𝑦 ≥ 0.

9
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

[1 Mark]

Hence, there is no maximum value of 𝑍. [1 Mark]

Exercise 𝟏𝟐. 𝟐

1. Reshma wishes to mix two types of food 𝑃 and 𝑄 in such a way that the vitamin contents of the
mixture contain at least 8 units of vitamin 𝐴 and 11 units of vitamin 𝐵. Food 𝑃 costs Rs. 60⁄kg and
Food 𝑄 costs Rs. 80⁄kg. Food 𝑃 contains 3 units⁄kg of vitamin 𝐴 and 5 units⁄kg of vitamin 𝐵
while food 𝑄 contains 4 units⁄kg of vitamin 𝐴 and 2 units⁄kg of vitamin 𝐵. Determine the
minimum cost of the mixture?
[6 Marks]

Solution:
Let the mixture contain 𝑥 kg of food 𝑃 and 𝑦 kg of food 𝑄.

Therefore, 𝑥 ≥ 0 and 𝑦 ≥ 0

The given information can be compiled in a table as follows:

Vitamin 𝐴 Vitamin 𝐵 Cost

(units⁄kg) (units⁄kg) (Rs⁄kg)
Food 𝑃 3 5 60
Food 𝑄 4 2 80
Requirement 8 11
(units⁄kg)
The mixture must contain at least 8 units of vitamin 𝐴 and 11 units of vitamin 𝐵.

Therefore, the constraints are:

3𝑥 + 4𝑦 ≥ 8
5𝑥 + 2𝑦 ≥ 11

10
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Total cost of purchasing food is, 𝑍 = 60𝑥 + 80𝑦 [1 Mark]

The mathematical formulation of the given problem is to

Minimise 𝑍 = 60𝑥 + 80𝑦 … (i)

subject to the constraints,

3𝑥 + 4𝑦 ≥ 8 …(ii)

5𝑥 + 2𝑦 ≥ 11 …(iii)

𝑥, 𝑦 ≥ 0 …(iv) [1 Mark]

Thus, the feasible region determined by the system of constraints is as follows:

It can be observed that the feasible region is unbounded.

8 1 11
So, the corner points of the feasible region are 𝐴 (3 , 0) , 𝐵 (2, 2) and 𝐶 (0, 2
). [2 Marks]

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = 60𝑥 + 80𝑦

8 160 } → Minimum
𝐴 ( , 0)
3
1 160
𝐵 (2, )
2
11 440
𝐶 (0, )
2
As the feasible region is unbounded, then 160 may or may not be the minimum value of 𝑍.

Therefore, for this, we graph the inequality, 60𝑥 + 80𝑦 < 160 or 3𝑥 + 4𝑦 < 8 and check whether
the resulting half plane has points in common with the feasible region or not.

Thus, the feasible region has no common point with 3𝑥 + 4𝑦 < 8

Hence, the minimum cost of the mixture will be Rs. 160 at the line segment joining the points
8
( , 0)
3

1
And (2, 2). [2 Marks]

11
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

2. One kind of cake requires 200g of flour and 25g of fat and another kind of cake requires 100g of
flour and 50g of fat. Find the maximum number of cakes which can be made from 5 kg of flour and
1 kg of fat assuming that there is no shortage of the other ingredients used in making the cakes?
[6 Marks]

Solution:
Let there be 𝑥 cakes of first kind and 𝑦 cakes of second kind.

Therefore, 𝑥 ≥ 0 and 𝑦 ≥ 0

Hence, the given information can be complied in a table as follows:

Flour (𝑔) Fat (𝑔)

Cakes of first kind, 𝑥 200 25
Cakes of second kind, 𝑦 100 50
Availability 5000 1000
∴ 200𝑥 + 100𝑦 ≤ 5000
⇒ 2𝑥 + 𝑦 ≤ 50
25𝑥 + 50𝑦 ≤ 1000
⇒ 𝑥 + 2𝑦 ≤ 40
Thus, the total numbers of cakes that can be made is 𝑍 = 𝑥 + 𝑦 [1 Mark]

The mathematical formulation of the given problem is

Maximise 𝑍 = 𝑥 + 𝑦 … (i)

subject to the constraints, we get:

2𝑥 + 𝑦 ≤ 50 …(ii)

𝑥 + 2𝑦 ≤ 40 …(iii)

𝑥, 𝑦 ≥ 0 …(iv) [1 Mark]

So, the feasible region determined by the system of constraints is as follows:

12
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Therefore, the corner points are 𝐴(25, 0), 𝐵(20, 10), 𝑂(0, 0) and 𝐶(0, 20). [2 Marks]

The values of 𝑍 at these above corner points are as follows:

Corner point 𝑍 =𝑥+𝑦

𝐴(25, 0) 25
𝐵(20, 10) 30 → Maximum
𝐶(0, 20) 20
𝑂(0, 0) 0
Number of cakes will be maximum when number of cakes of one kind is 20 and number of cakes of
another kind is 10.

Hence, the maximum numbers of cakes that can be made are 30. [2 Marks]

3. A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time
and 3 hours of craftsman’s time in its making while a cricket bat takes 3 hour of machine time and
1 hour of craftsman’s time. In a day, the factory has the availability of not more than 42 hours of
machine time and 24 hours of craftsman’s time.
(i) What number of rackets and bats must be made if the factory is to work at full capacity?
[2 Marks]

(ii) If the profit on a racket and on a bat is ₹ 20 and ₹ 10 respectively, find the maximum profit of
the factory when it works at full capacity. [4 Marks]

Solution:
(i) Consider the number of rackets and the number of bats to be made be 𝑥 and 𝑦 respectively.

Since, the machine time is not available for more than 42 hours.

13
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

∴ 1.5𝑥 + 3𝑦 ≤ 42 …(i)

And the craftsman’s time is not available for more than 24 hours.

∴ 3𝑥 + 𝑦 ≤ 24 …(ii) [1 Mark]

The factory is to work at full capacity. Hence,

1.5𝑥 + 3𝑦 = 42
3𝑥 + 𝑦 = 24
On solving these equations, we get 𝑥 = 4 and 𝑦 = 12

Hence, 4 rackets and 12 bats must be made. [1 Mark]

(ii) The given information can be complied in a table as follows.

Tennis Racket Cricket Bat Availability

Machine Time (ℎ) 1.5 3 42
Craftsman’s Time (ℎ) 3 1 24
∴ 1.5𝑥 + 3𝑦 ≤ 42
3𝑥 + 𝑦 ≤ 24
𝑥, 𝑦 ≥ 0
The profit on a racket is ₹ 20 and on a bat is ₹ 10.

∴ 𝑍 = 20𝑥 + 10𝑦 [1 Mark]

So, the mathematical formulation of the given problem is

Maximize 𝑍 = 20𝑥 + 10𝑦 … (i)

subject to the constraints,

1.5𝑥 + 3𝑦 ≤ 42 … (ii)

3𝑥 + 𝑦 ≤ 24 … (iii)

𝑥, 𝑦 ≥ 0 … (iv) [1 Mark]

Thus, the feasible region determined by the system of constraints is as follows.

14
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

So, the corner points are 𝐴(8, 0), 𝐵(4, 12), 𝐶(0, 14) and 𝑂(0, 0). [1 Mark]

The values of 𝑍 at these above corner points are as follows:

Corner point 𝑍 = 20𝑥 + 10𝑦

𝐴(8, 0) 160
𝐵(4, 12) 200 → Maximum
𝐶(0, 14) 140
𝑂(0, 0) 0
Therefore, the maximum profit of the factory when it works to its full capacity is ₹ 200. [1 Mark]

4. A manufacturer produces nuts and bolts. It takes 1 hour of work on machine 𝐴 and 3 hours on
machine 𝐵 to produce a package of nuts. It takes 3 hours on machine 𝐴 and 1 hour on machine 𝐵
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 packages of each should be produced each day so as to maximize his
profit, if he operates his machines for at the most 12 hours a day?
[6 Marks]

Solution:
Let the manufacturer produce 𝑥 packages of nuts and 𝑦 packages of bolts.

Therefore, 𝑥 ≥ 0 and 𝑦 ≥ 0

So, the given information can be compiled in a table as follows:

Nuts Bolts Availability

15
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Machine 𝐴(ℎ) 1 3 12
Machine 𝐵(ℎ) 3 1 12
The profit on a package of nuts is ₹ 17.50 and on a package of bolts is ₹ 7.00

Therefore, the constraints are

𝑥 + 3𝑦 ≤ 12
3𝑥 + 𝑦 ≤ 12
Total profit, 𝑍 = 17.5𝑥 + 7𝑦 [2 Marks]

The mathematical formulation of the given problem is to

Maximise 𝑍 = 17.5𝑥 + 7𝑦 …(i)

subject to the constraints,

𝑥 + 3𝑦 ≤ 12 …(ii)

3𝑥 + 𝑦 ≤ 12 …(iii)

𝑥, 𝑦 ≥ 0 …(iv) [1 Mark]

Thus, the feasible region determined by the system of constraints is as follows:

So, the corner points are 𝐴(4, 0), 𝐵(3, 3) and 𝐶(0, 4). [2 Marks]

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = 17.5𝑥 + 7𝑦

𝑂(0, 0) 0
𝐴(4, 0) 70
𝐵(3, 3) 73.5 → Maximum
𝐶(0, 4) 28
The maximum value of 𝑍 is Rs. 73.50 at (3, 3).

16
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Hence, 3 packages of nuts and 3 packages of bolts should be produced each day to get the
maximum profit of Rs. 73.50. [1
Mark]

5. A factory manufactures two types of screws, 𝐴 and 𝐵. Each type of screw requires the use of two
machines, an automatic and a hand operated. It takes 4 minutes on the automatic and 6 minutes
on hand operated machines to manufacture a package of screws 𝐴, while it takes 6 minutes on
automatic and 3 minutes on the hand operated machines to manufacture a package of screws 𝐵.
Each machine is available for at the most 4 hours on any day. The manufacturer can sell a package
of screws 𝐴 at a profit of ₹ 7 and screws 𝐵 at a profit of ₹ 10. Assuming that he can sell all the
screws he manufactures, how many packages of each type should the factory owner produce in a
day in order to maximize his profit? Determine the maximum profit.
[6 Marks]

Solution:
Consider the factory manufacture 𝑥 screws of type 𝐴 and 𝑦 screws of type 𝐵 on each day.

Therefore, 𝑥 ≥ 0 and 𝑦 ≥ 0

So, the given information can be compiled in a table as follows:

Screw 𝐴 Screw 𝐵 Availability

Automatic Machine (min) 4 6 4 × 60 = 120
Hand Operated Machine (min) 6 3 4 × 60 = 120
The profit on a package of screws 𝐴 is ₹7 and on the package of screws 𝐵 is ₹10.

Therefore, the constraints are:

4𝑥 + 6𝑦 ≤ 240
6𝑥 + 3𝑦 ≤ 240
Total profit, 𝑍 = 7𝑥 + 10𝑦 [2 Marks]

The mathematical formulation of the given problem is to

Maximize 𝑍 = 7𝑥 + 10𝑦 … (i)

subject to the constraints,

4𝑥 + 6𝑦 ≤ 240 …(ii)

6𝑥 + 3𝑦 ≤ 240 …(iii)

17
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

𝑥, 𝑦 ≥ 0 …(iv) [1 Mark]

Thus, the feasible region determined by the system of constraints is

So, the corner points are 𝐴(40, 0), 𝐵(30, 20) and 𝐶(0, 40). [2 Marks]

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = 17𝑥 + 10𝑦

𝐴(40, 0) 280
𝐵(30, 20) 410 → Maximum
𝐶(0, 40) 400
The maximum value of 𝑍 is 410 at (30, 20).

Hence, the factory should produce 30 packages of screws 𝐴 and 20 packages of screws 𝐵 to get the
maximum profit of ₹ 410. [1 Mark]

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 hours on grinding/cutting machine and 3 hours
on the sprayer to manufacture a pedestal lamp. It takes 1 hour on the grinding/cutting machine
and 2 hours on the sprayer to manufacture a shade. On any day, the sprayer is available for at the
most 20 hours and the grinding/cutting machine for at the most 12 hours. The profit from the sale
of a lamp is ₹ 5 and that from a shade is ₹ 3. Assuming that the manufacturer can sell all the lamps
and shades that he produces, how should he schedule his daily production in order to maximize his
profit? [6 Marks]

Solution:
18
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Consider the cottage industry manufacture × pedestal lamps and 𝑦 wooden shades.

Hence, 𝑥 ≥ 0 and 𝑦 ≥ 0

So, the given information can be compiled in a table as follows:

Lamps Shades Availability

Grinding/Cutting Machine (ℎ) 2 1 12
Sprayer (ℎ) 3 2 20
The profit on a lamp is ₹ 5 and on the shades is ₹ 3.

Therefore, the constraints are

2𝑥 + 𝑦 ≤ 12
3𝑥 + 2𝑦 ≤ 20
Total profit, 𝑍 = 5𝑥 + 3𝑦 [2 Marks]

Since, the mathematical formulation of the given problem is to

Maximize 𝑍 = 5𝑥 + 3𝑦 …(i)

subject to the constraints,

2𝑥 + 𝑦 ≤ 12 …(ii)

3𝑥 + 2𝑦 ≤ 20 …(iii)

𝑥, 𝑦 ≥ 0 …(iv) [1 Mark]

Thus, the feasible region determined by the system of constraints is as follows:

Hence, the corner points are 𝐴(6, 0), 𝐵(4, 4) and 𝐶(0, 10). [2 Marks]

19
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = 5𝑥 + 3𝑦
𝐴(6, 0) 30
𝐵(4, 4) 32 → Maximum
𝐶(0, 10) 30
The maximum value of 𝑍 is 32 at (4, 4).

Therefore, the manufacturer should produce 4 pedestal lamps and 4 wooden shades to maximize
his profit of ₹ 32. [1
Mark]

7. A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type 𝐴
require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type 𝐵 require
8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours 20 minutes
available for cutting and 4 hours of assembling. The profit is ₹ 5 each for type 𝐴 and ₹ 6 each for
type 𝐵 souvenirs. How many souvenirs of each type should the company manufacture in order to
maximize the profit?

[6 Marks]

Solution:
Consider the company manufacture × souvenirs of type 𝐴 and 𝑦 souvenirs of type 𝐵.

Therefore, 𝑥 ≥ 0 and 𝑦 ≥ 0

The given information can be complied in a table as follows:

Type 𝐴 Type 𝐵 Availability

Cutting (min) 5 8 3 × 60 + 20 = 200
Assembling (min) 10 8 4 × 60 = 240
The profit on type 𝐴 souvenirs is ₹ 5 and on type 𝐵 souvenirs is ₹ 6.

Therefore, the constraints are

5𝑥 + 8𝑦 ≤ 200
10𝑥 + 8𝑦 ≤ 240 i.e., 5𝑥 + 4𝑦 ≤ 120

Total profit, 𝑍 = 5𝑥 + 6𝑦 [2 Marks]

So, the mathematical formulation of the given problem is to

Maximize 𝑍 = 5𝑥 + 6𝑦 …(i)

subject to the constraints,

5𝑥 + 8𝑦 ≤ 200 …(ii)

20
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

5𝑥 + 4𝑦 ≤ 120 …(iii)

𝑥, 𝑦 ≥ 0 …(iv) [1 Mark]

Thus, the feasible region determined by the system of constraints is as follows:

Hence, the corner points are 𝐴(24, 0), 𝐵(8, 20) and 𝐶(0, 25). [2 Marks]

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = 5𝑥 + 6𝑦
𝐴(24, 0) 120
𝐵(8, 20) 160 → Maximum
𝐶(0, 25) 150
The maximum value of 𝑍 is 200 at (8, 20).

Therefore, 8 souvenirs of type 𝐴 and 20 souvenirs of type 𝐵 should be produced each day to get
the maximum profit of ₹ 160. [1 Mark]

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 lakhs and if his profit on the desktop model is ₹ 4500 and on portable model is ₹ 5000. [6
Marks]

Solution:

21
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Let the merchant stock 𝑥 desktop models and 𝑦 portable models.

Therefore, 𝑥 ≥ 0 and 𝑦 ≥ 0

So, the cost of a desktop model is ₹ 25000 and of a portable model is ₹ 4000.

However, the merchant can invest a maximum of ₹ 70 lakhs.

∴ 25000𝑥 + 40000𝑦 ≤ 7000000

5𝑥 + 8𝑦 ≤ 1400
The monthly demand of computers will not exceed 250 units.

∴ 𝑥 + 𝑦 ≤ 250
Since, the profit on a desktop model is Rs. 4500 and the profit on a portable model is Rs. 5000.

Total profit, 𝑍 = 4500𝑥 + 5000𝑦 [2 Marks]

The mathematical formulation of the given problem is

Maximum 𝑍 = 4500𝑥 + 5000𝑦 …(i)

subject to the constraints,

5𝑥 + 8𝑦 ≤ 1400 …(ii)

𝑥 + 𝑦 ≤ 250 …(iii)

𝑥, 𝑦 ≥ 0 …(iv) [1 Mark]

Thus, the feasible region determined by the system of constraints is as follows:

Hence, the corner points are 𝐴(250, 0), 𝐵(200, 50) and 𝐶(0, 175). [2 Marks]

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = 4500𝑥 + 5000𝑦

𝐴(250, 0) 1125000
𝐵(200, 50) 1150000 → Maximum

22
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

𝐶(0, 175) 875000

The maximum value of 𝑍 is 1150000 at (200, 50).

Therefore, the merchant should stock 200 desktop models and 50 portable models to get the
maximum profit of ₹ 1150000. [1
Mark]

9. A diet is to contain at least 80 units of vitamin 𝐴 and 100 units of minerals. Two foods 𝐹1 and 𝐹2
are available. Food 𝐹1 costs ₹ 4 per unit food and F2 costs ₹ 6 per unit. One unit of food F1 contains
3 units of vitamin 𝐴 and 4 units of minerals. One unit of food 𝐹2 contains 6 units of vitamin 𝐴 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?
[6 Marks]

Solution:
Let the diet contain 𝑥 units of food 𝐹1 and 𝑦 units of food 𝐹2 .

Therefore, 𝑥 ≥ 0 and 𝑦 ≥ 0

So, the given information can be complied in a table as follows:

Vitamin 𝐴 (units) Mineral (units) Cost per unit (Rs.)

Food 𝐹1 (𝑥) 3 4 4
Food 𝐹2 (𝑦) 6 3 6
Requirement 80 100
The cost of food 𝐹1 is ₹ 4 per unit and of Food 𝐹2 is ₹ 6 per unit.

Therefore, the constraints are

3𝑥 + 6𝑦 ≥ 80
4𝑥 + 3𝑦 ≥ 100
𝑥, 𝑦 ≥ 0
Total cost of the diet, 𝑍 = 4𝑥 + 6𝑦 [1 Mark]

The mathematical formulation of the given problem is to

Minimise 𝑍 = 4𝑥 + 6𝑦 …(i)

subject to the constraints,

3𝑥 + 6𝑦 ≥ 80 ….(ii)

23
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

4𝑥 + 3𝑦 ≥ 100 …(iii)

𝑥, 𝑦 ≥ 0 …(iv) [1 Mark]

Thus, the feasible region determined by the constraints is as follows:

It can be observed that the feasible region is unbounded.

8 1 11
The corner points of the feasible region are 𝐴 (3 , 0) , 𝐵 (2, 2) and 𝐶 (0, 2
) [2 Marks]

80 4 100
𝐴( , 0) , 𝐵 (24, ) and 𝐶 (0, ).
3 3 3

The corner points are

The values of 𝑍 at these corner points are as follows:

Corner point 𝑍 = 4𝑥 + 6𝑦
80 320
𝐴 ( , 0) = 106.67
3 3
4 104 → Minimum
𝐵 (24, )
3
100 200
𝐶 (0, )
3
As the feasible region is unbounded, then, 104 may or may not be the minimum value of 𝑍.

Therefore, for this, we draw a graph of the inequality, 4𝑥 + 6𝑦 < 104 or 2𝑥 + 3𝑦 < 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 2𝑥 + 3𝑦 < 52

Hence, the minimum cost of the mixture will be ₹ 104. [2 Marks]

24
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

10. There are two types of fertilizers 𝐹1 and 𝐹2 . 𝐹1 consists of 10% nitrogen and 6% phosphoric acid
and 𝐹2 consists of 5% nitrogen and 10% phosphoric acid. After testing the soil conditions, a farmer
finds that she needs at least 14 kg of nitrogen and 14 kg of phosphoric acid for her crop. If 𝐹1 cost
₹ 6⁄kg and 𝐹2 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? [6 Marks]

Solution:
Let the farmer buy 𝑥 kg of fertilizer 𝐹1 and 𝑦 kg of fertilizer 𝐹2 .

Therefore, 𝑥 ≥ 0 and 𝑦 ≥ 0

So, the given information can be complied in a table as follows:

Nitrogen (%) Phosphoric Acid (%) Cost (Rs.⁄kg)

𝐹1 (𝑥) 10 6 6
𝐹2 (𝑦) 5 10 5
Requirement (kg) 14 14
𝐹1 consists of 10% nitrogen and 𝐹2 consists of 5% nitrogen.

However, the farmer requires at least 14 kg of nitrogen.

∴ 10% of 𝑥 + 5% of 𝑦 ≥ 14
𝑥 𝑦
+ ≥ 14
10 20
2𝑥 + 𝑦 ≥ 280
𝐹1 consists of 6% phosphoric acid and 𝐹2 consists of 10% phosphoric acid.

However, the farmer requires at least 14 kg of phosphoric acid.

∴ 6% of 𝑥 + 10% of 𝑦 ≥ 14
6𝑥 10𝑦
+ ≥ 14
100 100
3𝑥 + 56𝑦 ≥ 700
Total cost of fertilizers will be 𝑍 = 6𝑥 + 5𝑦 [2 Marks]

Hence, the mathematical formulation of the given problem is to

Minimize 𝑍 = 6𝑥 + 5𝑦 …(i)

subject to the constraints,

2𝑥 + 𝑦 ≥ 280 …(ii)

3𝑥 + 5𝑦 ≥ 700 …(iii)

25
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

𝑥, 𝑦 ≥ 0 …(iv) [1 Mark]

Thus, the feasible region determined by the system of constraints is as follows:

It can be observed that the feasible region is unbounded.

700
The corner points are 𝐴 ( 3
, 0) , 𝐵(100, 80) and 𝐶(0, 280) [2 Marks]

The values of 𝑍 at these points are as follows:

Corner point 𝑍 = 6𝑥 + 5𝑦
700 1400
𝐴( , 0)
3
𝐵(100, 80) 1000 → Minimum
𝐶(0, 280) 1400
As the feasible region is unbounded, then, 1000 may or may not be the minimum value of 𝑍.

Therefore, for this, we draw a graph of the inequality, 6𝑥 + 5𝑦 < 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 6𝑥 + 5𝑦 < 1000

Hence, 100 kg of fertilizer 𝐹1 and 80 kg of fertilizer 𝐹2 should be used to minimize the cost.

The minimum cost is ₹ 1000. [1 Mark]

11. The corner points of the feasible region determined by the following system of linear inequalities:

26
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

2𝑥 + 𝑦 ≤ 10, 𝑥 + 3𝑦 ≤ 15, 𝑥, 𝑦 ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5)

Let 𝑍 = 𝑝𝑥 + 𝑞𝑦, where 𝑝, 𝑞 > 0.

Condition on 𝑝 and 𝑞 so that the maximum of 𝑍 occurs at both (3, 4) and (0, 5) is [2 Marks]

(A) 𝑝 = 𝑞

(B) 𝑝 = 2𝑞

(C) 𝑝 = 3𝑞

(D) 𝑞 = 3𝑝

Solution:
(D)

The maximum value of 𝑍 is unique.

Since, it is given that the maximum value of 𝑍 occurs at two points (3, 4) and (0, 5).

∴ Value of 𝑍 at (3, 4) = Value of 𝑍 at (0, 5) [1 Mark]

⇒ 𝑝(3) + 𝑞(4) = 𝑝(0) + 𝑞(5)

⇒ 3𝑝 + 4𝑞 = 5𝑞
⇒ 𝑞 = 3𝑝
Therefore, the correct answer is 𝐷. [1 Mark]

Miscellaneous

1. A diet is to contain at least 80 units of vitamin 𝐴 and 100 units of minerals. Two foods 𝐹1 and 𝐹2
are available. Food 𝐹1 costs ₹ 4 per unit food and F2 costs ₹ 6 per unit. One unit of food F1 contains
3 units of vitamin 𝐴 and 4 units of minerals. One unit of food 𝐹2 contains 6 units of vitamin 𝐴 and 3
units of minerals. Formulate this as a linear programming problem. How many packets of each food
should be used to maximize the amount of vitamin 𝐴 in the diet? What is the maximum amount of
vitamin 𝐴 in the diet?
[4 Marks]

Solution:
Let the diet contain 𝑥 and 𝑦 packets of foods 𝑃 and 𝑄 respectively.

Therefore, 𝑥 ≥ 0 and 𝑦 ≥ 0

The mathematical formulation of the given problem is as follows.

27
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Maximize 𝑧 = 6𝑥 + 3𝑦 …(i)

subject to the constraints,

4𝑥 + 𝑦 ≥ 80 …(ii)

𝑥 + 5𝑦 ≥ 115 …(iii)

3𝑥 + 2𝑦 ≤ 150 …(iv)

𝑥, 𝑦 ≥ 0 …(v) [1 Mark]

Thus, the feasible region determined by the system of constraints is as follows:

So, the corner points of the feasible region are 𝐴(15, 20), 𝐵(40, 15) and 𝐶(2, 72). [2 Marks]

The values of 𝑧 at these corner points are as follows:

Corner point 𝑧 = 6𝑥 + 3𝑦
𝐴(15, 20) 150
𝐵(40, 15) 285 → Maximum
𝐶(2, 72) 228
Therefore, the maximum value of 𝑧 is 285 at (40, 15).

Hence, to maximize the amount of vitamin 𝐴 in the diet, 40 packets of food 𝑃 and 15 packets of
food 𝑄 should be used.

The maximum amount of vitamin 𝐴 in the diet is 285 units. [1 Mark]

28
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

2. A farmer mixes two brands 𝑃 and 𝑄 of cattle feed. Brand 𝑃, costing ₹ 250 per bag contains 3 units
of nutritional element 𝐴, 2.5 units of element 𝐵 and 2 units of element 𝐶. Brand 𝑄 costing ₹ 200
per bag contains 1.5 units of nutritional elements 𝐴, 11.25 units of element 𝐵, and 3 units of
element 𝐶. The minimum requirements of nutrients 𝐴, 𝐵 and 𝐶 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? [6 Marks]

Solution:
Consider the farmer mix 𝑥 bags of brand 𝑃 and 𝑦 bags of brand 𝑄.

So, the given information can be compiled in a table as follows:

Vitamin 𝐴 Vitamin 𝐵 Cost

(units⁄kg) (units⁄kg) (Rs.⁄kg)
Food 𝑃 3 5 60
Food 𝑄 4 2 80
Requirement 8 11
(units⁄kg)
Since, the given problem can be formulated as follows:

Minimize 𝑧 = 250𝑥 + 200𝑦 …(i)

subject to the constraints,

3𝑥 + 1.5𝑦 ≥ 18 …(ii)

2.5𝑥 + 11.25𝑦 ≥ 45 …(iii)

2𝑥 + 3𝑦 ≥ 24 …(iv)

𝑥, 𝑦 ≥ 0 …(v) [2 Marks]

Thus, the feasible region determined by the system of constraint is as follows:

29
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Hence, the corner points of the feasible region are 𝐴(18, 0), 𝐵(9, 2), 𝐶(3, 6), and 𝐷(0, 12).[2
Marks]

The values of 𝑧 at these corner points are as follows:

Corner point 𝑧 = 250𝑥 + 200𝑦

𝐴(18, 0) 4500
𝐵(9, 2) 2650
𝐶(3, 6) 1950 → Minimum
𝐷(0,12) 2400
As the feasible region is unbounded, then, 1950 may or may not be the minimum value of 𝑧.

Therefore, for this, we draw a graph of the inequality, 250𝑥 + 200𝑦 < 1950 or 5𝑥 + 4𝑦 < 39 and
check whether the resulting half plane has points in common with the feasible region or not.

It can be observed that the feasible region has no common point with 5𝑥 + 4𝑦 < 39.

Thus, the minimum value of 𝑧 is 2000 at (3, 6).

Hence, 3 bags of brand 𝑃 and 6 bags of brand 𝑄 should be used in the mixture to minimize the cost
to ₹ 1950. [2
Marks]

3. A dietician wishes to mix together two kinds of food 𝑋 and 𝑌 in such a way that the mixture
contains at least 10 units of vitamin 𝐴, 12 units of vitamin 𝐵 and 8 units of vitamin 𝐶. The vitamin
content of one kg food is given below:

Food Vitamin 𝐴 Vitamin 𝐵 Vitamin 𝐶

𝑥 1 2 3
𝑦 2 2 1
One kg of food 𝑋 costs ₹ 16 and one kg of food 𝑌 costs ₹ 20. Find the least cost of the mixture
which will produce the required diet? [6
Marks]

Solution:
Consider the mixture contain 𝑥 kg and 𝑦 kg of food 𝑋 and 𝑌 respectively.

So, the mathematical formulation of the given problem is as follows:

Minimize 𝑧 = 16𝑥 + 20𝑦 … (i)

subject to the constraints,

𝑥 + 2𝑦 ≥ 10 …(ii)

30
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

𝑥 + 𝑦 ≥ 6 …(iii)

3𝑥 + 𝑦 ≥ 8 …(iv)

𝑥, 𝑦 ≥ 0 …(v) [2 Marks]

Thus, the feasible region determined by the system of constraints is as follows.

The corner points of the feasible region are 𝐴(10, 0), 𝐵(2, 4), 𝐶(1, 5) and 𝐷(0, 8). [2 Marks]

The values of 𝑧 at these corner points are as follows:

Corner point 𝑧 = 16𝑥 + 20𝑦

𝐴(10, 0) 160
𝐵(2, 4) 112 → Minimum
𝐶(1, 5) 116
𝐷(0, 8) 160
As the feasible region is unbounded, then, 112 may or may not be the minimum value of 𝑧.

Thus, for this, we draw a graph of the inequality, 16𝑥 + 20𝑦 < 112 or 4𝑥 + 5𝑦 < 28 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 4𝑥 + 5𝑦 < 28.

Therefore, the minimum value of 𝑧 is 112 at (2, 4).

Hence, the mixture should contain 2 kg of food 𝑋 and 4 kg of food 𝑌.

The minimum cost of the mixture is ₹ 112. [2 Marks]

4. A manufacturer makes two types of toys 𝐴 and 𝐵. Three machines are needed for this purpose and
the time (in minutes) required for each toy on the machines is given below:

31
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Machines
Type of toys
𝐼 𝐼𝐼 𝐼𝐼𝐼
𝐴 12 18 6
𝐵 6 0 9
Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type 𝐴 is
₹ 7.50 and that on each toy of type 𝐵 is ₹ 5, show that 15 toys of type 𝐴 and 30 of type 𝐵 should
be manufactured in a day to get maximum profit. [4 Marks]

Solution:
Consider 𝑥 and 𝑦 toys of type 𝐴 and type 𝐵 be manufactured in a day respectively.

So, the given problem can be formulated as follows:

Maximize 𝑧 = 7.5𝑥 + 5𝑦 … (i)

subject to the constraints,

2𝑥 + 𝑦 ≤ 60 …(ii)

𝑥 ≤ 20 …(iii)

2𝑥 + 3𝑦 ≤ 120 …(iv)

𝑥, 𝑦 ≥ 0 …(v) [1 Mark]

Thus, the feasible region determined by the constraints is as follows:

Hence, the corner points of the feasible region are

𝐴(20, 0), 𝐵(20, 20), 𝐶(15, 30) and 𝐷(0, 40). [2 Marks]

The values of 𝑧 at these corner points are as follows:

Corner point 𝑧 = 7.5𝑥 + 5𝑦

𝐴(20, 0) 150
𝐵(20, 20) 250

32
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

𝐶(15, 30) 262.5 → Maximum

𝑂(0, 40) 200
The maximum value of 𝑧 is 262.5 at (15, 30).

Therefore, the manufacturer should manufacture 15 toys of type 𝐴 and 30 toys of type 𝐵 to
maximize the profit of ₹ 262.50.
[1 Mark]

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 at least 20 seats for executive class. However, at least 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?
[4 Marks]

Solution:
Let the airline sell 𝑥 tickets of executive class and 𝑦 tickets of economy class.

The mathematical formulation of the given problem is as follows:

Maximize 𝑧 = 1000𝑥 + 600𝑦 … (i) subject to the constraints,

𝑥 + 𝑦 ≤ 200 …(ii)

𝑥 ≥ 20 …(iii)

𝑦 − 4𝑥 ≥ 0 …(iv)

𝑥, 𝑦 ≥ 0 …(v) [1 Mark]

Thus, the feasible region determined by the constraints is as follows:

33
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Hence, the corner points of the feasible region are 𝐴(20, 80), 𝐵(40, 160) and 𝐶(20, 180).[2
Marks]

The values of 𝑧 at these corner points are as follows:

Corner point 𝑧 = 1000𝑥 + 600𝑦

𝐴(20, 80) 68000
𝐵(40, 160) 136000 → Maximum
𝐶(20, 180) 128000
The maximum value of 𝑧 is 136000 at (40, 160).

Therefore, 40 tickets of executive class and 160 tickets of economy class should be sold to
maximize the profit and the maximum profit is ₹ 136000.
[1 Mark]

6. Two godowns 𝐴 and 𝐵 have grain capacity of 100 quintals and 50 quintals respectively. They
supply to 3 ration shops, 𝐷, 𝐸 and 𝐹 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 Rs.)

From/To 𝐴 𝐵
𝐷 6 4

34
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

𝐸 3 2
𝐹 2.50 3
How should the supplies be transported in order that the transportation cost is minimum? What is
the minimum cost? [6
Marks]

Solution:
Let godown 𝐴 supply 𝑥 and 𝑦 quintals of grain to the shops 𝐷 and 𝐸 respectively.

Then, (100 − 𝑥 − 𝑦) will be supplied to shop 𝐹.

The requirement at shop 𝐷 is 60 quintals since 𝑥 quintals are transported from godown 𝐴.

Therefore, the remaining (60 − 𝑥) quintals will be transported from godown 𝐵.

Similarly, (50 − 𝑦) quintals and 40 − (100 − 𝑥 − 𝑦) = (𝑥 + 𝑦 − 60) quintals will be transported

from godown 𝐵 to shop 𝐸 and 𝐹 respectively.

So, the given problem can be represented diagrammatically as follows:

[2 Marks]

𝑥 ≥ 0, 𝑦 ≥ 0 and 100 − 𝑥 − 𝑦 ≥ 0

⇒ 𝑥 ≥ 0, 𝑦 ≥ 0 and 𝑥 + 𝑦 ≤ 100

60 − 𝑥 ≥ 0, 50 − 𝑦 ≥ 0 and 𝑥 + 𝑦 − 60 ≥ 0

⇒ 𝑥 ≤ 60, 𝑦 ≤ 50 and 𝑥 + 𝑦 ≥ 60

∴ Total transportation cost 𝑧 is given by,

𝑧 = 6𝑥 + 3𝑦 + 2.5(100 − 𝑥 − 𝑦) + 4(60 − 𝑥) + 2(50 − 𝑦) + 3(𝑥 + 𝑦 − 60)

= 6𝑥 + 3𝑦 + 250 − 2.5𝑥 − 2.5𝑦 + 240 − 4𝑥 + 100 − 2𝑦 + 3𝑥 + 3𝑦 − 180

35
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

= 2.5𝑥 + 1.5𝑦 + 410

Since, the given problem can be formulated as

Minimize 𝑧 = 2.5𝑥 + 1.5𝑦 + 410 …(i)

subject to the constraints,

𝑥 + 𝑦 ≤ 100 …(ii)

𝑥 ≤ 60 …(iii)

𝑦 ≤ 50 …(iv)

𝑥 + 𝑦 ≥ 60 …(v)

𝑥, 𝑦 ≥ 0 …(vi) [1 Mark]

Thus, the feasible region determined by the system of constraints is as follows:

Hence, the corner points are 𝐴(60, 0), 𝐵(60, 40), 𝐶(50, 50) and 𝐷(10, 50). [2 Marks]

The values of 𝑧 at these corner points are as follows:

Corner point 𝑧 = 2.5𝑥 + 1.5𝑦 + 410

𝐴(60, 0) 560
𝐵(60, 40) 620
𝐶(50, 50) 610
𝐷(10, 50) 510 → Minimum
The minimum value of 𝑧 is 510 at (10, 50).

36
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Therefore, the amount of grain transported from 𝐴 to 𝐷, 𝐸 and 𝐹 is 10 quintals, 50 quintals and 40
quintals respectively and from 𝐵 to 𝐷, 𝐸 and 𝐹 is 50 quintals, 0 quintals and 0 quintals respectively.

The minimum cost is ₹ 510. [1 Mark]

7. An oil company has two depots 𝐴 and 𝐵 with capacities of 7000 L and 4000 L respectively. The
company is to supply oil to three petrol pumps, 𝐷, 𝐸 and 𝐹 whose requirements are 4500L, 3000L
and 3500L respectively. The distance (in km) between the depots and the petrol pumps is given in
the following table:

Distance in (km)
From/To 𝐴 𝐵
𝐷 7 3
𝐸 6 4
𝐹 3 2
Assuming that the transportation cost of 10 litres of oil is ₹ 1 per km, how should the delivery be
scheduled in order that the transportation cost is minimum? What is the minimum cost? [6 Marks]

Solution:
Let 𝑥 and 𝑦 litres of oil be supplied from 𝐴 to the petrol pumps, 𝐷 and 𝐸.

Then, (7000 − 𝑥 − 𝑦) will be supplied from 𝐴 to petrol pump 𝐹.

The requirement at petrol pump 𝐷 is 4500 L.

Since 𝑥 𝐿 are transported from depot 𝐴, the remaining (4500 − 𝑥) 𝐿 will be transported from
petrol pump 𝐵.

Similarly, (3000 − 𝑦) 𝐿 and 3500 − (7000 − 𝑥 − 𝑦) = (𝑥 + 𝑦 − 3500) 𝐿 will be transported from

depot 𝐵 to petrol pump 𝐸 and 𝐹 respectively.

So, the given problem can be represented diagrammatically as follows:

37
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

[2 Marks]

𝑥 ≥ 0, 𝑦 ≥ 0 and (7000 − 𝑥 − 𝑦) ≥ 0

⇒ 𝑥 ≥ 0, 𝑦 ≥ 0 and 𝑥 + 𝑦 ≤ 7000

4500 − 𝑥 ≥ 0, 3000 − 𝑦 ≥ 0 and 𝑥 + 𝑦 − 3500 ≥ 0

⇒ 𝑥 ≤ 4500, 𝑦 ≤ 3000 and 𝑥 + 𝑦 ≥ 3500

The cost of transporting 10 L of petrol = ₹ 1

1
The cost of transporting 1 L of petrol = ₹ 10

Hence, total transportation cost is given by,

7 6 3 3 4 2
𝑧= × 𝑥 + 𝑦 + (7000 − 𝑥 − 𝑦) + (4500 − 𝑥) + (3000 − 𝑦) + (𝑥 + 𝑦 − 3500)
10 10 10 10 10 10
= 0.3𝑥 + 0.1𝑦 + 3950
Since, the problem can be formulated as follows:

Minimize 𝑧 = 0.3𝑥 + 0.1𝑦 + 3950 …(i)

subject to the constraints,

𝑥 + 𝑦 ≤ 7000 …(ii)

𝑥 ≤ 4500 …(iii)

𝑦 ≤ 3000 …(iv)

𝑥 + 𝑦 ≥ 3500 …(v)

𝑥, 𝑦 ≥ 0 …(vi) [1 Mark]

Thus, the feasible region determined by the constraints is as follows:

38
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Hence, The corner points of the feasible region are

𝐴(3500, 0), 𝐵(4500, 0), 𝐶(4500, 2500), 𝐷 (4000, 3000) and 𝐸(500, 3000). [2 Marks]

The values of 𝑧 at these corner points are as follows:

Corner Point 𝑧 = 0.3𝑥 + 0.1𝑦 + 3950

𝐴(3500, 0) 5000
𝐵(4500, 0) 5300
𝐶(4500, 2500) 5550
𝐷(4000, 3000) 5450
𝐸(500, 3000) 4400 → Minimum
The minimum value of 𝑧 is 4400 at (500, 3000).

Therefore, the oil supplied from depot 𝐴 is 500L, 3000L and from 3500 L and from depot 𝐵 is
4000 L, 0 L and 0 L to petrol pumps 𝐷, 𝐸 and 𝐹 respectively.

Thus, the minimum transportation cost is ₹ 4400. [1 Mark]

8. A fruit grower can use two types of fertilizer in his garden, brand 𝑃 and brand 𝑄. 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 at least 240 kg of phosphoric acid at least 270 kg of potash
and at most 310 kg of chlorine.

39
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

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? [6
Marks]

kg per bag
Brand 𝑃 Brand 𝑄
Nitrogen 3 3.5
Phosphoric acid 1 2
Potash 3 1.5
Chlorine 1.5 2

Solution:
Let the fruit grower use 𝑥 bags and 𝑦 bags of brand 𝑃 and 𝑄 respectively.

So, the problem can be formulated as follows:

Minimize 𝑧 = 3𝑥 + 3.5𝑦 …(i)

subject to the constraints,

𝑥 + 2𝑦 ≥ 240 …(ii)

𝑥 + 0.5𝑦 ≥ 90 …(iii)

1.5𝑥 + 2𝑦 ≤ 310 …(iv)

𝑥, 𝑦 ≥ 0 …(v) [1.Mark]

Thus, the feasible region determined by the system of constraints is as follows:

Hence, the corner points are 𝐴(240, 0), 𝐵(140, 50) and 𝐶(20, 140). [2 Marks]

The values of 𝑧 at these corner points are as follows:

40
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

Corner point 𝑧 = 3𝑥 + 3.5𝑦

𝐴(140, 50) 595
𝐵(20, 140) 550
𝐶(40, 100) 470 → Minimum
The maximum value of 𝑧 is 470 at (40, 100).

Therefore, 40 bags of brand 𝑃 and 100 bags of brand 𝑄 should be added to the garden to minimize
the amount of nitrogen.

Thus, the minimum amount of nitrogen added to the garden is 470 kg. [1 Mark]

9. 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? [4 Marks]

Solution:
Consider the fruit grower use 𝑥 bags of brand 𝑃 and 𝑦 bags of brand 𝑄.

So, the problem can be formulated as follows:

Maximize 𝑧 = 3𝑥 + 3.5𝑦 …(i)

subject to the constraints,

𝑥 + 2𝑦 ≥ 240 …(ii)

𝑥 + 0.5𝑦 ≥ 90 …(iii)

1.5𝑥 + 2𝑦 ≤ 310 …(iv)

𝑥, 𝑦 ≥ 0 …(v) [1 Mark]

Thus, the feasible region determined by the system of constraints is as follows:

41
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

The corner points are 𝐴(140, 50), 𝐵(20, 140) and 𝐶(40, 100). [2 Marks]

The values of 𝑧 at these corner points are as follows:

Corner point 𝑧 = 3𝑥 + 3.5𝑦

𝐴(140, 50) 595 → Maximum
𝐵(20, 140) 550
𝐶(40, 100) 470
The maximum value of 𝑧 is 595 at (140, 50).

Therefore, 140 bags of brand 𝑃 and 50 bags of brand 𝑄 should be used to maximize the amount of
nitrogen.

Hence, the maximum amount of nitrogen added to the garden is 595 kg. [1 Mark]

10. A toy company manufactures two types of dolls, 𝐴 and 𝐵. 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 𝐵 is at most half of that for dolls of type 𝐴. Further, the production level of
dolls of type 𝐴 can exceed three times the production of dolls of other type by at most 600 units. If
the company makes profit of ₹ 12 and ₹ 16 per doll respectively on dolls 𝐴 and 𝐵, how many of
each should be produced weekly in order to maximize the profit?
[4 Marks]

Solution:
Consider 𝑥 and 𝑦 be the number of dolls of type 𝐴 and 𝐵 that are produced per week respectively.

42
Practice more on Linear Programming www.embibe.com
Class-XII-Maths Linear Programming

So, the given problem can be formulated as follows:

Maximize 𝑧 = 12𝑥 + 16𝑦 … (i)

subject to the constraints,

𝑥 + 𝑦 ≤ 1200 …(ii)
𝑥
𝑦 ≤ 2 ⇒ 𝑥 ≥ 2𝑦 …(iii)

𝑥 − 3𝑦 ≤ 600 …(iv)

𝑥, 𝑦 ≥ 0 …(v) [1 Mark]

Thus, the feasible region determined by the system of constraints is as follows:

Hence, the corner points are 𝐴(600, 0), 𝐵(1050, 150) and 𝐶(800, 400). [2 Marks]

The values of 𝑧 at these corner points are as follows:

Corner point 𝑧 = 12𝑥 + 16𝑦

𝐴(600, 0) 7200
𝐵(1050, 150) 15000
𝐶(800, 400) 16000 → Maximum
The maximum value of 𝑧 is 16000 at (800, 400).

Therefore, 800 and 400 dolls of type 𝐴 and type 𝐵 should be produced respectively to get the
maximum profit of Rs. 16000. [1
Mark]

43
Practice more on Linear Programming www.embibe.com