Made with Xodo PDF Reader and Editor

Solutions of
Linear Programming
ISC Class 12 Previous Years Board Questions
2008 to 2020
1. A manufacturer produces two types of steel trunks. He has two machines A and B. The first type of
trunk requires 3 hours on machine A and 3 hours on machine on B. The second type requires 3
hours on machine A and 2 hours on machine B. Machine A and B can work at most for 18 hours and
15 hours per day respectively. He earns a profit of ₹ 30 per trunk on the first type of trunk and ₹ 25
per trunk on the second type. Formulate a linear programming problem to find out how many
trunks of each type he must make each day to maximize his profit. (ISC 2008)

Solution : Let number of first type of trunks made per day

Number of second type of trunk made per day
The mathematical formulation of the given LPP is
Maximize profit (in₹)
Subject to the constraints

The shaded region OABC is feasible region.

The corner points are O(0,0), A(5,0) ,
B(3,3)and C(0,6) .
at O(0,0) , P= 0
at A(5,0) , P = 30 x 5 + 25 x 0= 150
at B(3,3) , P = 30 x3+25 x 3 = 165
at C(0,6) , P = 25 x 6 = 150
So maximum profit is ₹ 165
and it is obtained at B(3,3)
So maximum profit is attained when 3 trunks of 1st type and 3 trunks of 2nd type is made
per day.

2. A new cereal formed of a mixture of bran and rice, containing at least 88 grams of protein and at
least 36 milligrams of iron per kilogram. Knowing that bran contains 80 grams of protein and 40
milligrams of iron per kilogram and that rice contains 100 grams of protein and 30 milligrams of iron
 Made with Xodo PDF Reader and Editor

per kilogram, find the minimum cost of producing a kilogram of this new cereal if bran costs ₹ 28
per kilogram and rice costs ₹ 25 per kilogram. (ISC 2009)
Solution : The given data may be put in the following tabular form :

Protein (g/kg) Iron (mg/kg) Cost (₹ /kg)

Bran 80 40 28
Rice 100 30 25
Requirement 88 36

Let kg of bran and kg of rice be mixed to form the cereal.

Then the problem can be formulated as an L.P.P. as follows :
Minimize total cost (in ₹)
subject to the constraints

The shaded unbounded region is the feasible region.

The corner points are
( ) ( ) ( )
At the corner points ,
the value in ₹ of are :

at ( )
at ( )
at ( )
minimum value of
and it occurs at the point ( )
Let us draw the line (shown
dotted). The half plane has no
common points with the feasible region. So, has
minimum value. Minimum value of is ₹ 8.

Hence when 0.6 kg of bran and 0.4 kg of rice is mixed, so that the weight of mixture is

kg + 0.4 kg = 1 kg, the minimum cost of 1kg of mixture is ₹ 26.8.

3. A company produces two types of items P and Q. Manufacturing of both items requires the metals
gold and copper. Each unit of item P requires 3 gms of gold and 1 gm of copper while that of item Q
requires 1 gm of gold and 2 gms of copper. The company has 9 gms of gold and 8 gms of copper in
its store. If each unit of item P makes a profit of ₹ 50 and each unit of item Q makes a profit of
 Made with Xodo PDF Reader and Editor

₹ 60, determine the number of units of each item that the company should produce to maximize
profit. What is the maximum profit? (ISC 2010)

Solution : Let the number of units of item A to be produced be and that of B to be produced be
Let be the total profit in rupees.

The given data can be put in tabular form as :

Items gold copper Profit per

unit
(₹)
P 3 1 50
Q 1 2 60
availability 9 8

Thus, mathematical formulation of given LPP is

Maximize (in₹)

Subject to the constraints

The shaded region OABC is the feasible region.

The corner points are :

( ) ( ) ( ) ( )

at ( )

at ( )

at ( )

at ( )

is maximum at and

for maximum profit , the company should produce 2 units of item P and 3 units of item Q.

maximum profit is ₹ 280.

tapatisclasses.in
 Made with Xodo PDF Reader and Editor

4. A manufacturer manufactures two types of tea-cups, A and B. Three machines are needed for
manufacturing the teacups. The time in minutes required for manufacturing each cup on the
machines is given below:

Type of cup Times in minutes

Machine  Machine  Machine 
A 12 18 6
B 6 0 9
Each machine is available for a maximum of six hours per day. If the profit on each cup of type A is
₹ 1.50, and that on each cup of type B is ₹ 1.00, find the number of cups of each type that should be
manufactured in a day to get maximum profit. (ISC 2011)

Solution : Let and be the number of tea-cups of types A and B respectively.

The problem can be formulated as an L.P.P. as follows:

Maximize the profit (in ₹)

subject to the constraints ,

The feasible region is the polygon OABCD.

The values (in ₹) of
at the corner points are :
at O(0,0),
at ( )

at ( )
at ( )
at ( )
Maximum profit = ₹ 5 when
15 cups of type A and 30 cups of type B are manufactured.

5. The tailors P and Q earn ₹ 150 and ₹ 200 per day respectively. P can stitch 6 shirts and 4 trousers a
day, while Q can stitch 10 shirts and 4 trousers per day. How many days should each work to
produce at least 60 shirts and 30 trousers at minimum labour cost? (ISC 2012)
Solution : Let the tailor P work for days and tailor Q work for days.
We prepare a table from the given data.
 Made with Xodo PDF Reader and Editor

Tailor No of days No of shirts No of Earning (₹)

trousers
P 6 4 150
Q 10 4 200
Requirements 60 32

The mathematical formulation of the given LPP is

Minimize total labour cost (in ₹)
Subject to the constraints

The diagrammatic representation of the problem is given in the figure below.

The shaded unbounded region ABC is the feasible region.

The corner points are A(10, 0), B(5, 3), C(0, 8) .

The value of
at A(10, 0) ,
at B(5, 3),

at C(0, 8), .
Among these values of , the minimum
value is 1350.
Let us draw the line:
(shown dotted).
The half plane
has no common point with the
feasible region. Therefore has
minimum value. Minimum value of
is 1350 and it occurs at the point (5,3).
Hence , the labour cost is minimum when P works for 5 days and Q works for 3 days
and the minimum labour cost is ₹ 1350.

6. A mill owner buys two types of machines A and B for his mill. Machine A occupies 1000 sq. m of
area and requires 12 men to operate; while machine B occupies 1200 sq. m of area and requires 8
men to operate it. The owner has 7600 sq. m of area available and 72 men to operate the machines.
If machine A produces 50 units and machine B produces 40 units daily, how many machines of each
 Made with Xodo PDF Reader and Editor

type should he buy to maximize the daily output? Use linear programming to find the solution.
(ISC 2013)

Solution : Let and be the number of machines of type A and B respectively which the mill

owner should buy. The daily production (units).

The information may be stated as follows.

Machines No of Area (sq. m) No of men No of units

machines
A 1000 12 50
B 1200 8 40
Availability 7600 72
The problem can be formulated as an LPP as follows:
Maximize
Subject to the constraints

Shaded portion represents the

feasible region.

The corner points are :

( ) ( ) ( ) ( )
At ( ) ,
at ( ) ,
at ( ) ,
at ( ) .
Hence maximum production P is 320 units
at B(4, 3) .

Hence the mill owner should buy 4 machines

of type A and 3 machines of type B.

tapatis classes.in
 Made with Xodo PDF Reader and Editor

7. A company manufactures two types of toys A and B. A toy of type A requires 5 minutes for cutting
and 10 minutes for assembling. A toy of type B requires 8 minutes for cutting and 8 minutes for
assembling. There are 3 hours available for cutting and 4 hours available for assembling the toys in a
day. The profit is ₹ 50 each on a toy of type A and ₹ 60 each on a toy of type B. How many toys of
each type should the company manufacture in a day to maximize the profit? Use linear
programming to find the solution. (ISC 2014)

Solution : Let the number of toys of type A be and the number of toys of type B be
The information is given below in tabular form.

Type of toys Number of toys Time for cutting Time for Profit (₹)
assembling
A 5 minutes 10 minutes 50
B 8 minutes 8 minutes 60
Time available 180 minutes 240 minutes
(minutes)
The problem can be formulated as an LPP as follows.
Maximize profit (in ₹)
Subject to

The feasible region is the polygon OABC.

The corner points are :

O(0,0), A(0, 45/2), B(12,15), C(24,0).

At O(0,0),
at A(0, 45/2),
at B(12,15),
at C(24,0),
Hence maximum profit is ₹ 1500 and is obtained when 12 units of type A and 15 units of type
B is produced.

8. A dietician wishes to mix two kinds of food X and Y in such a way that the mixture contains at least
10 units of element A, 12 units of vitamin B and 8 units of vitamin C. The vitamin contents of one kg
food is given below:
 Made with Xodo PDF Reader and Editor

Food Vitamin A Vitamin B Vitamin C

X 1 unit 2 units 3 units

Y 2 units 2 units 1 unit

One kg of food costs ₹ 24 and one kg of food Y costs ₹ 36. Using linear programming, find the least
cost of the total mixture which will contain the required vitamins. (ISC 2015)

Solution : Let kg of food X and kg of food Y be mixed and (in ₹) be the total cost of the
(mixture) food. Hence , the problem can be formulated as an LPP as follows :
Minimize
Subject to the constraints

The feasible unbounded region is shown in

the figure.
The corner points are A(10,0), B(2,4), C(1,5),
D(0,8).
At A(10, 0),
at B(2,4),
at C(1,5),
at D(0,8),
Among this value of the minimum value
is 192.
We draw the line, i.e,
(shown dotted in the figure)
We see that the half plane has no common point with the feasible region.
Hence, has minimum value and minimum value of is ₹ 192 and it occurs at B(2,4).
Hence, least cost of the mixture is ₹ 192 when 2 kg of food X is mixed with 4 kg of food Y.

9. A company manufactures two types of product A and B. Each unit of A requires 3 grams of nickel
and 1 gram of chromium, while each unit of B requires 1 gram of nickel and 2 grams of chromium.
The firm can produce 9 grams of nickel and 8 grams of chromium. The profit is ₹ 40 on each unit of
product A and ₹ 50 on each unit of type B. How many unit of each type should the company
manufacture so as to earn maximum profit? Use linear programming to find the solution.
(ISC 2016)

Solution : Let and be the number of products of types A and B respectively manufactured by
the company. Let be the total profit in ₹.
 Made with Xodo PDF Reader and Editor

The information given in the problem may be stated as follows:

Product No of products Materials used per unit (in gms) Profit in ₹.

produced Nickel Chromium
A 3 1 40

B 1 2 50
Materials 9 8
available
The mathematical formulation of the given LPP is given below:
Maximize (in ₹)
subject to the constraints
,
,

OABC is the shaded bounded feasible region.

The corner points are O(0, 0), A(3, 0), B(2, 3)
and C(0, 4).
At O(0, 0),
at A(3, 0),
at B(2, 3),
at C(0, 4),

Hence the maximum value of is ₹ 230 which

is attained at B(2, 3).
Hence , the company should manufacture 2
products of type A and 3 products of type B to get a
maximum profit of ₹ 230.

10. A farmer has a supply of chemical fertilizer of type A which contains 10% nitrogen and 6%
phosphoric acid and of type B which contains 5% nitrogen 10% phosphoric acid. After soil test , it is
found that at least 7 kg of nitrogen and same quantity of phosphoric acid is required for a good
crop. The fertilizer of type A costs ₹ 5 per kg and the type B cost ₹ 8 per kg. Using linear
programming, find how many kilograms of each type of the fertilizer should be bought to meet the
requirement and for the cost to be minimum. Find the feasible region in the graph.
(ISC 2017)

Solution : Let the fertilizers of type A and type B be kg and kg respectively.

The given information is tabulated as follows:
 Made with Xodo PDF Reader and Editor

Fertilizer Amount in kg Nitrogen Phosphoric acid Costs in ₹

A 10% 6% 5

B 5% 10% 8
Minimum 7 kg 7 kg
requirement
Mathematical formulation of the given LPP is given below:
Minimize cost (in ₹)
subject to the constraints

The feasible unbounded region is shown

in the figure.

The corner points are A(350/3, 0),

B(50, 40), C(0, 140).
At ( )
At ( )
At ( )
Among these value of C, minimum value of C
is ₹ 570.
Let us draw the line (shown
dotted).
The half plane has no common
point with the feasible region. Therefore, has
minimum value.
The minimum value of C is ₹ 570 and it occurs
at (50, 40).
Hence, the farmer should bought 50 kg of type A fertilizer and 40 kg of type B fertilizer so that the
cost is minimum and minimum cost is ₹ 350.

11. A manufacturing company makes two types of teaching aids A and B of Mathematics for class X.
Each type of A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each type of B
requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and
finishing, the maximum labour hours available per week are 180 and 30 respectively. The company
makes a profit of ₹ 80 on each piece of type of A and ₹ 120 on each piece of type B. How many
 Made with Xodo PDF Reader and Editor

pieces of type A and type B should be manufactured per week to get a maximum profit? Make it as
an LPP and solve graphically. What is the maximum profit per week? (ISC 2018)

Solution : Let and be the number of teaching aids of type A and B respectively.
The given information may be tabulated as below:

Teaching aids Number of Time in hours Profit (₹)

pieces Fabricating finishing
A 9 1 80

B 12 3 120
Available time 180 30
(in hours)
The problem can be formulated as an LPP as follows:
Maximize Profit (in ₹)
Subject to the constraints

The shaded region shows the feasible region

which is bounded.

The corner points of the feasible region OABC

are O(0, 0), A(20, 0), B(12, 6), C(0, 10).

At O(0, 0),
At A(20, 0) ,
At B(12, 6),
At C(0, 10),
Hence value of is maximum at B(12, 6) .
Hence, the manufacturer should produce 12 teaching aids of type A and 6 teaching aids of type B to
get a maximum of profit ₹ 1680.

12. A carpenter has 90, 80 and 50 running feet respectively of teak wood, plywood and rosewood which
is used to produce product A and product B. Each unit of product A requires 2, 1 and 1 running feet
and each unit of product B requires 1, 2 and 1 running feet of teak wood, plywood and rosewood
respectively. If product A is sold for ₹ 48 per unit and product B is sold for ₹ 40 per unit, how many
 Made with Xodo PDF Reader and Editor

units of product A and product B should be produced and sold by the carpenter , in order to obtain
the maximum gross income?
Formulate the above as a Linear Programming Problem and solve it, indicating clearly the feasible
region in the graph. (ISC 2019)

Solution : Let the number of units of the product A to be made be and that of the product B to be
made be Let be the gross income in ₹. The information may be given as a tabular form as
follows:

Product No of units Wood used per unit (ft.) Income per

to be made unit (₹)
Teak Plywood rosewood
A 2 1 1 48

B 1 2 1 40
Available 90 80 50
stock

Mathematical formulation of the LPP :

Maximize (in ₹)

Subject to the constraints :

The shaded convex polygon OABCD

is the feasible region.

The corner points are :

O(0, 0), A(45, 0), B(40, 10), C(20, 30),

D(0, 40).

At O(0, 0), tapatisclasses.in

 Made with Xodo PDF Reader and Editor

At A(45, 0),

At B(40, 10),

At C(20, 30),

At D(0, 40),

Hence maximum value of is ₹ 2320 and it is obtained at B(40, 10). Hence for maximum

gross income , the carpenter should make 40 units of product A and 10 units of product B.

13. A company uses three machines to manufacture two types of shirts, half sleeves and full sleeves.
The number of hours required per week on machine M1 , M2 and M3 for one shirt of each type is
given in the following table :
M1 M2 M3
Half sleeves 1 2 8/5
Full sleeves 2 1 8/5
None of the machines can be in operation for more than 40 hours per week. The profit on each half
sleeve shirt is ₹ 1 and the profit on each full sleeve shirt is ₹ . How many of each type of shirts
should be made per week to maximixe the company’s profit?
Solution : Let and be the number of half sleeves and full sleeves shirts manufactured by the
company per week respectively to maximize the profit.
Mathematical formulation of the LPP :
Maximize profit (in ₹)
subject to the constraints

and
The feasible region is the polygon
OABCD which is bounded.
The corner points are O(0, 0), A(20, 0),
B(15, 10), C(10, 15) and D(0, 20).
The values (in ) of at
corner points are :
At O(0, 0),
At A(20, 0),
At B(15, 10),
At C(10, 15),
At D(0, 20),
Maximum profit = ₹ and is obtained at C(10, 15) i.e., when 10 half sleeves shirts and 15 full
sleeves shirts are made by the company per week.
tapatis classes.in