Class 12

Linear programming

Mathematics
Question 1.A small firm manufactures necklaces and bracelets. The total number of
necklaces and bracelets that it can handle per day is at most 24. It takes one hour to
make a bracelet and half an hour to make a necklace. The maximum number of hours
available per day is 16. If the profit on a necklace is ₹ 100 and that on a bracelet is ₹
300. Formulate on L.P.P. for finding how many of each should be produced daily to
maximise the profit? It is being given that at least one of each must be produced. (Delhi
2017)
Answer:
Let number of necklaces and bracelets produced by firm per day be x and y,
respectively.

∵ Total number of necklaces and bracelets that the firm can handle per day is atmost
Clearly, x ≥ 0, y ≥ 0

∴ x + y ≤ 24
24.

Since it takes one hour to make a bracelet and half an hour to make a necklace and

∴ x + y ≤ 16
maximum number of hours available per day is 16.

⇒ x + 2y ≤ 32
Let Z be the profit function.

∴ The given LPP reduces to

Then, Z = 100x + 300y

Maximise Z = 100x + 300y subject to,

x + y ≤ 24
x + 2y ≤ 32
and x, y ≥ 0

Question 2.
Two tailors A and B, earn ₹ 300 and ₹ 400 per day respectively. A can stitch 6 shirts
and 4 pairs of trousers while B can stitch 10 shirts and 4 pairs of trousers per day. To
find how many days should each of them work and if it is desired to produce at least 60
shirts and 32 pairs of trousers at a minimum labour cost, formulate this as an LPP. (All
India 2017 )
Answer:
The given data can be summarised as follows
Let tailor A and tailor B works for x days and y days, respectively.
Then, x ≥ 0, y ≥ 0

6x + 10y ≥ 60 ⇒ 3x + 5y ≥ 30
v Minimum number of shirts = 60

4x+ 4y ≥ 32 ⇒ x + y ≥ 8
Minimum number of trousers = 32

Let Z be the total labour cost.

Then, Z = 300x + 400y
So, the given LPP reduces to Z = 300x + 400y
x ≥ 0, y ≥ 0, 3x + 5y ≥ 30 and x + y ≥ 8

Question 3.
Solve the following LPP graphically:
Minimise Z = 5x + 10y subject to the constraints
x + 2y ≤ 120
x + y ≥ 60,
x – 2y > 0 and x, y ≥ 0 (Delhi 2017)
Answer:
Our problem is to minimise
Z = 5x + 10y … (i)
Subject to constraints
x + 2y ≤ 120 …(ii)
x + y ≥ 60 …(iii)
x – 2y ≥ 0 … (iv)
and x ≥ 0, y ≥ 0
Table for line x + 2y = 120 is

Put (0, 0) in the inequality x + 2y ≤ 120, we get

⇒ 0 ≤ 120 (which is true)

0 + 2x ≤ 120

So, the half plane is towards the origin. Secondly, draw the graph of the line x + y = 60

0 + 0 ≥ 60 ⇒ 0 ≥ 60 (which is false)
On putting (0, 0) in the inequality x + y ≥ 60, we get

So, the half plane is away from the origin.

Thirdly, draw the graph of the line x – 2y = 0.
5 – 2 × 0 ≥ 0 ⇒ 5 ≥ 0 (which is true)
On putting (5, 0) in the inequality x – 2y ≥ 0, we get

∴ The feasible region lies in the first quadrant.

Thus, the half plane is towards the X-axis. Since, x, y ≥ 0

Clearly, 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 = 5x + 10y

A (60, 0) 300 (minimum)

8(120,0) 600

C (60, 30) 600

D (40, 20) 400

Clearly, the minimum value of Z is 300 at the points (60, 0)

Question 4.
Maximise and minimise Z = x + 2y subject to the constraints
x + 2 y ≥ 100
2x – y ≤ 0
2x+ y ≤ 200
x, y ≥ 0
Solve the above LPP graphically. (All India 2017)
Answer:
Our problem is to minimise and maximise
Z = x + 2y ……(i)
Subject to constraints,
x + 2y ≥ 100 ………..(ii)
2x – y ≤ 0 ………..(iii)
2x + y ≤ 200 ……..(iv)
and x ≥ 0, y ≥ 0 ……….(v)

Table for line x + 2y = 100 is

x 0 100

y 50 0

So, the line x + 2y = 100 is passing through the points (0, 50) and (100, 0).
On putting (0, 0) in the inequality x + 2y ≥ 100, we get

⇒ 0 ≥ 100 (which is false)

0 + 2 × 0 ≥ 100

So, the half plane is away from the origin.

Table for line 2x – y = 0 is

x 0 10

y 0 20
So, the line 2x – y = 0 is passing through the points (0, 0) and (10, 20).
On putting (5, 0) in the inequality 2x – y ≤ 0, we get

⇒ 10 ≤ 0 (which is false)
2×5–0≤0

So, the half plane is towards Y-axis.

Table for line 2x + y = 200 is

x 0 100

y 200 0

So, the line 2x + y = 200 is passing through the points (0, 200) and (100, 0).
On putting (0, 0) in the inequality 2x + y ≤ 200, we get

⇒ 0 ≤ 200 (which is true)

2 × 0 + 0 ≤ 200

So, the half plane is towards the origin.

Also, x, y ≥ 0.
So, the region lies in the I quadrant.

Clearly, feasible region is ABCDA.

On solving equations 2x – y = 0 and x + 2y = 100, we get B(20, 40).
Again, solving the equations 2x – y = 0 and 2x + y = 200, we get C(50, 100).
The comer points of the feasible region are
A(0, 50), B(20, 40), C(50, 100) and D(0, 200).
The values of Z at corner points are given below:
Comer points Z = x + 2y

A(0, 50) Z = 0 + 2 × 50 = 100

B(20, 40) Z = 20 + 2 × 40 = 100

C(50, 100) Z = 50 + 2 × 100 = 250

O(0, 200) Z = 0 + 2 × 200 = 400

The maximum value of Z is 400 at 0(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 5.
A manufacturer has employed 5 skilled men and 10 semi-skilled men and makes two
models A and B of an article. The making of one item of model A requires
2 h work by a skilled man and 2 h work by a semi-skilled man. One item of model B
requires 1 h by a skilled man and 3 h by a semi-skilled man. No man is expected to
work more than 8 h per day. The manufacturer profit on an item of model A is t 15 and
on an items of model B is ? 10. How many of items of each models should be made per
day in order to maximize daily profit? Formulate the above LPP and solve it graphically
and find the maximum profit. (Delhi 2019)
Answer:
Let the company produce x items of A model and y items of B model.
Maximize profit is P = 15x + 10y
Now, total time spent by 5 skilled men = 2x + y

∴ 2x + y ≤ 40 …(i)
and it should be less than 40.

Also, the total time spent by 10 semi-skilled men = 2x + 3y and it should be less than

∴ 2x + 3y ≤ 80 …(ii)
80.

Also, x ≥ 0 and y ≥ 0
Now, our problem is to maximise Z = 15x + 10y
Subject to the constraints
2x + y ≤ 40
2x+ 3y ≤ 80
and x, y ≥ 0
Let us draw all the 4 lines on the graph and find the common area.

From above we get the region OABC is the feasible region with A (o, 80/3)B(10, 20),
C(20, 0), O(0, 0)
Since, the feasible is a bounded region, we can check the profit function at all the
vertices to find the maxima.
At point A : Z = 15(0) + 10
At point B : Z = 15(10) + 10(20) = 350
At point C : Z = 15(20) + 10(0) = 300
At point O : Z = 15(0) +10(0) = 0
Thus, the maxima lies at point B having coordinates x = 10 and y = 20 and the
maximum profit = ₹ 350.
Hence, the manufacturer should makes 10 items of A model and 20 items of B model
for maximum profit of ₹ 350.

Question 6.
A company produces two types of goods, A and B, that require gold and silver. Each
unit of type A requires 3 g of silver and 1 g of gold while that of type B requires 1 g of
silver and 2 g of gold. The company can use at the most 9 g of silver and 8 g of gold. If
each unit of type A brings a profit of ₹ 40 and that of type B ₹ 50, find the number of
units of each type that the company should produce to maximize profit. Formulate the
above LPP and solve it graphically and also find the maximum profit. (All India 2019,
CBSE 2018C)
Answer:
Let number of goods A = x units,
and number of goods B = y units
Now, the given LPP is to maximise profit:
P = 40x + 50y
Subject to following constraints
3x + y ≤ 9
x + 2y ≤ 8
and x ≥ 0, y ≥ 0
To solve this LPP, we first draw the following lines
3x + y – 9 and x + 2y = 8
The line 3x + y = 9 meets the coordinate axes at A(3, 0) and B(0, 9). Join these points
to obtain the line represented by 3x + y = 9.
The line x + 2y = 8 meets the coordinate axes at C(8, 0) and D(0, 4). Join these points
to obtain the line represented by x + 2y = 8.
Clearly, x ≥ 0and y ≥ 0represents the first quadrant.

Thus, the shaded region in figure is the feasible region of the LPP. The coordinates of
the comer points of this region are 0(0, 0), A (3, 0), E(2,3) and 0(0, 4), where the point E
(2, 3) is obtained by solving 3x + y = 9 and x + 2y = 8 simultaneously.(1) The value of
the objective function P = 40x + 50y at the corner points of the feasible region are given
in the following table:

Points (x, y) Value of the objective function P = 40x + 50y

0(0, 0) P = 40 × 0 + 50 × 0 = 0

A (3,0) P = 40 × 3 + 50 × 0 = ₹ 120

E (2, 3) P = 40 × 2 + 50 × 3 = ₹ 230

D (0, 4) P = 40 × 0 + 50 × 4 = ₹ 200
∴ The maximum value of P is ₹ 230.
Clearly, P is maximum at x = 2 and y = 3

Question 7.
A factory manufactures two types of screws A and B, each type requiring the use of two
machines, an automatic and a hand-operated. It takes 4 min on the automatic and 6 min
on the hand-operated machines to manufacture a packet of screw ‘A’ while it takes 6
min on the automatic and 3 min on the hand-operated machine to manufacture a packet
of screw ‘B’. Each machine is available for atmost 4 h on any day. The manufacturer
can sell a packet of screw A’ at a profit of 70 paise and screw ‘B’ at a profit of U.
Assuming that he can sell all the screws he manufactures, how many packets of each
type should the factory owner produce in a day in order to maximise his profit?
Formulate the above LPP and solve it graphically and find the maximum profit. (CBSE
2010)
Answer:
Let x be the number of packets of screw ‘A and y be the number of packets of screw ‘B’.
Then, we have the following table from the given data.

Now, the mathematical model of the given problem is

Maximize Z = 0.7x + y
Subject to the constraints,
4x + 6y ≤ 240
or 2x + 3y ≤ 120 …(i)
6x + 3y ≤ 240
or 2x + y ≤ 80 …(ii)
and x, y ≥ 0 …(iii)Now let us draw the graph of inequalities (i) to (iii).
Clearly, the feasible region is the shaded region, whose comer points are O, A, B andC.
The coordinates of 0, A and C are (0, 0), (40,0) and (0, 40) respectively.

Let us find the coordinates of B which is the intersection point of 2x + y = 80 and 2x + 3y

= 120.
On solving these two equations, we get x = 30 and y = 20
Thus, the coordinates of B are (30, 20).

Now, let us find the value of Z at corner points, as shown in the following table.

Comer Points Value of Z = 0.7x + y

O(0,0) 0

A (40,0) 28

B (30, 20) 41 ← maximum

C (0, 40) 40
We find that maximum value of Z is 41 at B (30, 20).
Hence, the manufacturer should produce 30 packets of screw A and 20 packets of
screw B to get a maximum profit of ₹ 41.

Question 8.
A manufacturer produces two products A and B. Both the products are processed on
two different machines. The available capacity of first machine is 12 h and that of
second machine is 9 h per day. Each unit of product A requires 3 h on both machines
and each unit of product B requires 2 h on first machine and 1 h on second machine.
Each unit of product A is sold at a profit of ₹ 7 and B at a profit of ₹ 4. Find the
production level per day for maximum profit graphically. (Delhi 2016)
Answer:
Let the manufacturer produces x units of product A and y units of product B.
Let us construct the following table.

Here, total profit Z = 7x + 4y

So, our problem is to maximise Z = 7x + 4y …(i)
Subject to the constraints,
3x + 2y ≤ 12
3x + y ≤ 9
and x ≥ 0, y ≥ 0
Now, consider the given inequations as equations
3x + 2y = 12 … (ii)
3x + y = 9 …(iii)

Table for line 3x + 2y = 12 or y = 9-3x is

x 0 4

Y 6 0
It passes through the points (0, 6) and (4, 0).
On putting (0, 0) in the inequality 3x + 2y ≤ 12, we get

⇒ 0 ≤ 12 [true]
0 + 0 ≤ 12

So, the half plane is towards the origin.

Table for line 3x + y = 9 or y = 9 – 3x is

x 0 3

y 9 0

It passes through the points (0, 9) and (3, 0).

On putting (0, 0) in the inequality 3x + y ≤ 9, we get

⇒ 0 ≤ 9 [true]
0+ 0 ≤ 9

So, the half plane is towards the origin.

Also, x ≥ 0 and y ≥ 0, so the region lies in 1st quadrant.
Now, on subtracting Eq. (iii) from Eq. (ii), we get

⇒y=3
(3x + 2y) – (3x + y) = 12- 9

Now, 3x = 12 – 2y = 12 – 2 × 3 = 6 ⇒ x = 2
Thus, the point of intersection is B(2, 3).
The graph of above inequations is shown below

Here, we see that OABC is the required feasible region, whose comer points are 0(0,0),
A(3, 0), B(2,3) and C(0,6).
The values of Z at these comer points are as follows

Comer points Z = 7x + 4y

O(0, 0) Z=0+0=0

A(3, 0) Z = 7 × 3 + 0 = 21

B(2, 3) Z = 7 × 2 + 4 × 3 = 26 (maximum)

C(0, 6) Z = 7 × 0 + 4 × 6 = 24

Hence, for maximum profit, the manufacturer should produce 2 units of product A and 3
units of product B.
Question 9.
A retired person wants to invest an amount of ₹ 50000. His broker recommends
investing in two types of bonds A’ and ‘B’ yielding 10% and 9% return respectively on
the invested amount. He decides to invest at least ₹ 20000 in bond A’ and at least ₹
10000 in bond ‘B’. He also wants to invest at least as much in bond A’ as in bond ‘B’.
Solve this linear programming problem graphically to maximise his returns. (All Indio
2016)
Answer:
Let the amounts invested by the person in bonds A and B are respectively, ₹ x and ₹ y.
Our problem is to maximise
Z = 10% of x + 9% of y or Z = 0.1x + 0.09y
Subject to constraints, x + y = 50000
x ≥ y or x – y ≥ 0
x ≥ 20000 and y ≥ 10000

Now, consider the given inequations as equations

x + y = 50000 …(i)
x – y = 0 …….(ii)
x = 20000 …(iii)
and y = 10000 …(iv)

The table for line x + y = 50000 is

x 0 50000

y 50000 0

∴ It passes through the points (0, 50000) and (50000, 0).

The table for line x – y = 0 is

x 0 20000

Y 0 20000
∴ It passes through the points (0, 0) and (20000, 20000).
On putting (10000, 0) in the inequality x ≥ y,
we get 10000 ≥ 0 (true)
So, the half plane is towards the X-axis.

The line x = 20000 is perpendicular to the X-axis.

On putting (0, 0) in the inequality x ≥ 20000, we cet
0 ≥ 20000 (false)
So, the half plane is away from the origin.

The line y = 10000 is perpendicular to the Y-axis.

On putting (0, 0) in the inequality y ≥ 10000, we get
0 ≥ 10000 (false)
So, the half plane is away from the origin.
Now, draw the graph of given system of inequalities as shown below.

From the graph, it is clear that feasible region lies on the line segment BF. The corner
points of feasible region are B (40000,10000) and F(25000, 25000).
The values of Z at comer points are given below:

Comer Points Z = 0.1x + 0.09y

B (40000,10000) Z = 01 × 40000 + 0.09 × 10000 = 4900 (maximum)

P (25000, 25000) Z = 02 × 25000 + 0.09 × 25000 = 4750

Hence, to get a maximum returns, he has to invest ₹ 40000 in bond A and ₹ 10000 in
bond B.

Question 10.
A manufacturer produces nuts and bolts. It take 2 hours work on machine A and 3 hours
on machine B to produce a package of nuts. It takes 3 hours on machine A and 2 hours
on machine B to produce a package of bolts. He earns a profit of ₹ 24 per package on
nuts and ₹ 18 per package on bolts. How many package of each should be produced
each day so as to maximise his profit, if he operates his machines for at most 10 hours
a day? Make an LPP and solve it graphically. (All India 2015C)
Answer:
Let x and y respectively denotes the number of packages of nuts and bolts
manufactured by the manufacturer. Then, given data can be summarised in tabular form
as follows.