Linear Programming

1. Maximise 3 4 Z x y = +
Subject to the constraints: 4, 0, 0 x y x y + s > >
Sol:
The corner points are ( ) ( ) ( ) 0, 0 , 4, 0 , 0, 4
( ) 0,0 0
Z
=

( ) 4,0
12 Z =
( ) 0,4
16 Z =
Thus maximum value of Z is16at ( ) 0, 4
2. Minimize 3 4 Z x y = +
Subject to the constraints 2 8, 3 2 12, 0, 0 x y x y x y + s + s > >
Sol:
Corner points are (4, 0), (0, 4), (2, 3)
( ) 4,0
12 Z =
( ) 2,3
6 Z =
Thus minimum value of Z is 12 at ( ) 4, 0
3. Maximise 5 3 Z x y = +
Subject to 3 5 15, 5 2 10, 0, 0 x y x y x y + s + s > >
x
-10 -5 5 10
y
-10
-5
5
10
(4,0)
(0,4)
x
-10 -5 5 10
y
-10
-5
5
10
(2,3)
(4,0)
(0,4)
( ) 0,4
16 Z =
Corner points are( ) ( )
20 45
2, 0 , 0, 3 , ,
19 19
| |
|
\ .
( ) 2,0
10 Z =
( ) 0,3
9 Z =
20 45
,
19 19
100 135 235
19 19 19
Z
| |
|
\ .
= + =
Thus maximum value of Z is
235 20 45
at ,
19 19 19
| |
|
\ .
4. Minimize 3 5 Z x y = +
Subject to: 3 3, 2, 0, 0 x y x y x y + > + > > >
Corner points are( ) ( )
3 1
3, 0 , 0, 2 , ,
2 2
| |
|
\ .
( ) 3,0
9 Z =
( ) 0, 3
( ) 2, 0
20 45
,
19 19
| |
|
\ .
x
-10 -5 5 10
y
-10
-5
5
10
x
-10 -5 5 10
y
-10
-5
5
10
(1.5,0.5)
(0,2)
(3,0)
( ) 0,2
10 Z =
3 1 9 5
, 7
2 2 2 2
Z
| |
= + =
|
\ .
Thus 7 is the smallest value of Z . This may or may not be minimum value of Z .
Let us draw the region 7 or 3 5 7 Z x y < + <
Since 7 Z < has no point in common with feasible region therefore 7 is the minimum value
of Z at
3 1
,
2 2
| |
|
\ .
5. Maximize 2 Z x y = +
Subject to: 2 10,3 15, , 0 x y x y x y + s + s >
Corner points are ( ) ( ) (5, 0), 0,5 , 4, 3 A B C
( ) 5,0
15 Z =
( ) 0,5
10 z =
( ) 4,3
18 Z =
x
-10 -5 5 10
y
-10
-5
5
10
(1.5,0.5)
(0,2)
(3,0)
x
-10 -5 5 10
y
-10
-5
5
10
C(4,3)
B(0,5)
A(5,0)
Thus maximum value of Z is 18 at ( ) 4, 3
6. Minimize 2 Z x y = +
Subject to: 2 3, 2 6, 0, 0 x y x y x y + > + > > >
Corner points are ( ) ( ) 0, 3 & 6, 0 A B
( ) 0,3
6 Z =
( ) 6,0
6 Z =
Thus 6 is the smallest value of Z .
Now let us draw the region 6 or 2 6 Z x y < + <
Since 6 Z < has no common point with feasible region, therefore 6 is the minimum value
of Z .
Since this minimum value is occurring at ( ) ( ) 0, 3 & 6, 0 A B .
Thus minimum value of Z is 6 at all the points on the line segment joining( ) ( ) 6, 0 & 0, 3
x
-10 -5 5 10
y
-10
-5
5
10
A(0,3)
B(6,0)
x
-10 -5 5 10
y
-10
-5
5
10
A(0,3)
B(6,0)
7. Minimise and Maximise 5 10 Z x y = +
subject to 2 120, 60, 2 0, , 0 x y x y x y x y + s + > > >
Sol:
Corner points are ( ) ( ) ( ) ( ) 40, 20 , 60, 0 , 120, 0 , 60, 30 A B C D
( ) 40,20
400 Z =
( ) 60,0
300 Z =
( ) 120,0
600 Z =
( ) 60,30
600 Z =
Thus minimum value of Z is 300 at ( ) 60, 0 and maximum value of Z is 600 at all the
points of line segment joining( ) ( ) 120, 0 and 60, 30
8. Maximise and Minimise 2 Z x y = +
Subject to: 2 100, 2 0, 2 200, 0, 0 x y x y x y x y + > s + s > >
Sol:
Corner points are (20, 40), (0, 50), (0, 200), (50,100) .
( ) 20,40
100 Z =
( ) 0,50
100 Z =
(0,200)
400 Z =
x
20 40 60 80 100 120
y
-60
-40
-20
20
40
60
A(40,20
B(60,0)
D(60,30)
C(120,0)
x
20 40 60 80 100 120
y
-50
50
100
150
200
(50,100)
(0,200)
(0,50)
(20,40)
(50,100)
250 Z =
Thus minimum value of Z is 100 at all the points of the line segment
joining ( ) (20, 40) & 0, 50 and maximum value of Z is 400 at ( ) 0, 200
9. Maximise 2 Z x y = +
subject to constraints: 3, 5, 2 6, 0 x x y x y y > + > + > >
Corner points are( ) ( ) ( ) 6, 0 , 4,1 , 3, 2
( ) 6,0
6 Z =
( ) 4,1
2 Z =
( ) 3,2
1 Z =
Thus the greatest value of Z is1. But this may or may not be the maximum value.
Let us draw 1 or 2 1 Z x y > + >
Since 2 1 x y + > has common points with feasible region therefore there is no maximum
value and hence no solution.
10. Maximize Z x y = + subject to 1, 0, 0, 0 x y x y x y s + s > >
x
-10 -5 5 10
y
-10
-5
5
10
(3,2)
(4,1)
(6,0)
x
-10 -5 5 10
y
-10
-5
5
10
(3,2)
(4,1)
(6,0)
As there is no feasible region therefore there is no maximum value of Z
Exercise 12.2
1. Reshma wishes to mix two types of food P and Q in such a way that the vitamin
contents of the mixture contains at least 8 units of vitamin A and 11 units of vitamin B.
Food P costs Rs 60/kg and Food Q costs Rs 80/kg. Food P contains 3 units/kg of Vitamin
A and 5 units/kg of Vitamin B while Q contains 4 units/kg of Vitamin A and 2 units/kg of
Vitamin B. Determine the minimum cost of the mixture.
Sol: Let mixture contains x kg of food P and y kg of food Q. Let Z be the cost of the
mixture. Thus mathematical model of the given problem is
Minimise 60 80 Z x y = +
Subject to: 3 4 8, 5 2 11, 0, 0 x y x y x y + > + > > >
Corner points are
5 1 11
, 0 , 2, , 0,
3 2 2
| | | | | |
| | |
\ . \ . \ .
x
-10 -5 5 10
y
-10
-5
5
10
x
-10 -5 5 10
y
-10
-5
5
10
8/3,0)
(2,1/2)
(0,5.5)
8 1 11
,0 2, 0,
3 2 2
160, 160, 440 Z Z Z
| | | | | |
| | |
\ . \ . \ .
= = =
Thus smallest value of Z is 160. Let us draw 160 or 60 80 160 Z x y < + <
Since 60 80 160 x y + < has no common points with feasible region therefore the minimum
cost is Rs 160 at all the points lying on the line segment joining
8 1
, 0 and 2,
3 2
| | | |
| |
\ . \ .
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.
Sol: Let x cakes of first kind and y cakes of second type are produced and let Z be the
number of cakes. Thus mathematical model of the given problem is
Maximise Z x y = +
Subject to constraints:
200 100 5000 2 50 x y x y + s + s
25 50 1000 2 40 x y x y + s + s
0, 0 x y > >
x
-10 -5 5 10
y
-10
-5
5
10
8/3,0)
(2,1/2)
(0,5.5)
x
-10 10 20 30 40
y
-40
-20
20
40
(20,10)
(25,0)
(0,20)
Corner points are( ) ( ) ( ) 25, 0 , 20,10 , 0, 20
( ) 25,0
25 Z =
( ) 20,10
30 Z =
( ) 0,20
20 Z =
Thus maximum number of cakes is 30 when 20 cakes of first kind and 10 cakes of second
kind are produced.
3. A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of
machine time and 3 hours of craftsmans time in its making while a cricket bat takes 3
hours of machine time and 1 hour of craftsmans time. In a day, the factory has the
availability of not more than 42 hours of machine time and 24 hours of craftsmans time.
(i) What number of rackets and cricket bats must be made if the factory is to work at full
capacity?
(ii) If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the
maximum profit of the factory when it works at full capacity.
Sol: Let x tennis rackets and y cricket bats are produced in a day and let Z be the total
profit.
Then mathematical model of the given problem is
Maximise 20 10 Z x y = +
Subject to constraints: 1.5 3 42,3 24, , 0 x y x y x y + s + s >
Sol:
Corner points are( ) ( ) ( ) 8, 0 , 0,14 , 4,12
( ) 8,0
160 Z =
( ) 0,14
140 Z =
( ) 4,12
200 Z =
Thus 4 tennis rackets and 12 cricket bats must be produced and maximum profit is Rs
200.
4. A manufacturer produces nuts and bolts. It takes 1 hour of work on machine A and 3
hours on machine B to produce a package of nuts. It takes 3 hours on machine A and 1
hour on machine B to produce a package of bolts. He earns a profit of Rs 17.50 per
package on nuts and Rs 7.00 on per package on bolts. How many packages of each type
should be produced each day so as to maximise his profit, if he operates his machines for
at most 12 hours a day?
Sol: Let x packages of nuts and y packages of bolts are produced each day and let Z be
his total profit. Then mathematical model for the given problem is
Maximise 17.5 7 Z x y = +
x
-10 -5 5 10 15 20 25
y
-60
-40
-20
20
(4,12)
(8,0)
(0,14)
Subject to: 3 12, 3 12, 0, 0 x y x y x y + s + s > >
Cornet points are (0,0),(4,0),(0,4),(3,3)
( ) ( ) ( ) ( ) 0,0 4,0 0,4 3,3
0, 70, 28, 73.50 Z Z Z Z = = = =
Thus maximum profit is Rs 73.50 if 3 packages of nuts and 3 packages of bolts are
produced.
5. A factory manufactures two types of screws, A and B. Each type of screws requires the
use of two types of machines, an automatic and hand operated. It takes 4 minutes on the
automatic and 6 minutes on hand operated machines to manufacture a package of screws
A, while it takes 6 minutes on automatic and 3 minutes on hand operated machines to
manufacture a package of screws B. Each machine is available for at the most 4 hours on
any day. The manufacturer can sell a package of screws A at a profit of Rs 7 and screws
B at a profit of Rs 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
maximise his profit? Determine the maximum profit.
Sol: Let x packages of screws A and y packages of screw B are produced and let Z be
his total profit. Then mathematical model of the problem is
Maximise 7 10 Z x y = +
Subject to: 4 6 240, 6 3 240, 0, 0 x y x y x y + s + s > > .
Corner points are (0,0),(40,0),(0,40),(30,20)
( ) ( ) ( ) ( ) 0,0 40,0 0,40 30,20
0, 280, 400, 410 Z Z Z Z = = = =
x
-10 -5 5 10
y
-10
-5
5
10
(0,4)
(4,0)
(3,3)
x
-10 10 20 30 40 50 60
y
-40
-20
20
40
60
80
(30,20)
(0,40)
(40,0)
Thus maximum profit is Rs 410 when 30 packages of screw A and 20 packages of screw
B are manufactured.
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 girding/cutting machine for at the
most 12 hours. The profit from the lamp is Rs 5 and from a shade is Rs 3. Assuming that
the manufacturer can sell all the lamps and shades he produces, how should he schedule
his daily production in order to maximise his profit?
Sol: Let he produce x pedestal lamps and y wooden shades in a day and let Z be his total
profit. Then the mathematical model of the problem is:
Maximise 5 3 Z x y = +
Subject to: 2 12,3 2 20, 0, 0 x y x y x y + s + s > >
Corner points are (0,0),(6,0),(0,10),(4,4)
( ) ( ) ( ) ( ) 0,0) 0 6,0 0,10 4,4
, 30, 30, 32 Z Z Z Z
=
= = =
Thus maximum profit is Rs 32 when 4 pedestal lamps and 4 wooden shades are
manufactured.
7. A company manufactures two types of novelty souvenirs made of plywood. Souvenirs
of type A require 5 minutes each for cutting and 10 minutes for each for assembling.
Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for
assembling. There are 3 hours 20 minutes available for cutting and 4 hours for
assembling. The profit is Rs 5 each for type A and Rs 6 each for type B souvenirs. How
many souvenirs of each type should the company manufacture in order to maximise the
profit?
Sol: Let x souvenirs of type A and y souvenirs of type B are manufactured and let Z be
total profit. The mathematical model of the given problem is
Maximise 5 6 Z x y = +
Subject to: 5 8 200,10 8 240, 0, 0 x y x y x y + s + s > >
x
-10 -5 5 10
y
-10
-5
5
10
(4,4)
(0,10)
(6,0)
Corner points are (0,0),(24,0),(0,25),(8,20)
( ) ( )
(0,0 (0,25) 24,0) 8,20
0, 120, 150, 160 Z Z Z Z = = = =
Thus maximum profit is R160 when 8 souvenirs of type A and 20 souvenirs of type B are
manufactured.
8. A merchant plans to sell two types of personal computers- a desktop model and a
portable model that will cost Rs 25000 and Rs 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 Rs 70 lakhs and if his profit on the desktop model
is Rs 4500 and on portable model is Rs 5000.
Sol: Let he stocks x units of desktop computers and y units of portable computers and
let Z be his total profit. Mathematical model for the given problem is
Maximise 4500 5000 Z x y = +
Subject to: 250, 25000 40000 7000000, 0, 0 x y x y x y + s + s > >
Corner points are (0,0), (250, 0), (200,50), (0,175)
( ) ( ) ( ) ( ) 0,0 250,0 200,50) 0,175
0, 1125000, 1150000, 875000 Z Z Z Z = = = =
Thus maximum profit is Rs 1150000 when 200 units of Desktop-model and 50 unit of
Portable models are stocked.
x
-10 10 20 30 40
y
-20
-10
10
20
30
(8,20)
(0,25)
(24,0)
x
50 100 150 200 250 300
y
-50
50
100
150
200
250
(200,50)
(250,0)
(0,175)
9. A diet is to contain at least 80 units of vitamin A and 100 units of minerals. Two foods
F
1
and F
2
are available. Food F
1
costs Rs 4 per unit of food and F
2
costs Rs 6 per unit.
One unit of food F
1
contains 3 units of vitamin A and 4 units of minerals. One unit of
food F
2
contains 6 units of vitamin and 3 units of minerals. Formulate this as a linear
programming problem. Find the minimum cost of the diet that consists of mixture of
these foods and also meet the minimum nutritional requirements.
Sol: Let the diet contains x unit of food F
1
and y units of food F
2
and let Z be total cost.
The linear programming problem is
Minimise 4 6 Z x y = +
Subject to: 3 6 80, 4 3 100, 0, 0 x y x y x y + > + > > >
Corner points are
80 100 4
, 0 , 0, , 24,
3 3 3
| | | | | |
| | |
\ . \ . \ .
80 100 4
,0 0, 24,
3 3 3
320
, 200, 104
3
Z Z Z
| | | | | |
| | |
\ . \ . \ .
= = =
Now 104 is the smallest value of Z . This may or may not be the minimum value of Z .
Let us graph the inequality 104 or 4 6 104 Z x y < + <
Since 104 Z < has no common points with feasible region therefore minimum cost of the
diet is Rs 104 when 24 units of food F
1
and 4/3 units of food F
2
are mixed.
x
-10 -5 5 10 15 20 25
y
-10
10
20
30
(24,4/3)
(0,100/3)
(80/3/0)
x
-10 -5 5 10 15 20 25
y
-10
10
20
30
(24,4/3)
(0,100/3)
(80/3/0)
10. There are two types of fertilisers F
1
and F
2
. F
1
consists of 10% nitrogen and 6%
phosphoric acid and F
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 F
1
costs Rs 6/kg and F
2
costs Rs 5/kg, determine how
much of each type of fertiliser should be used so that nutrient requirements are met at
minimum cost. What is the minimum cost.
Sol: Let she mixes x kg of fertiliser F
1
with y kg of fertiliser F
2
and let Z be total cost.
Then mathematical model of the given problem is
Minimise 6 5 Z x y = +
Subject to:
3
14, 14, 0, 0
10 20 50 10
x y x y
x y + s + s > >

Corner points are ( ) ( )
700
, 0 , 0, 280 , 100,80
3
| |
|
\ .
( )
(100,80) 700 0,280
,0
3
1400, 1400, 1000 Z Z Z
| |
|
\ .
= = =
Thus smallest value of Z is 1000. But this may or may not be the minimum value of Z .
Let us now draw the region for 1000 or 6 5 1000 Z x y < + <
x
50 100 150 200 250
y
-200
-100
100
200
(100,80)
(700/3,0)
(0,280)
x
50 100 150 200 250
y
-200
-100
100
200
(100,80)
(700/3,0)
(0,280)
Since 6 5 1000 x y + < has no common points with feasible region therefore the minimum
value of Z is Rs 1000 when 100 kg of fertiliser F
1
and 80 kg of fertiliser F
2
are mixed.
Miscellaneous
2. A farmer mixes two brand P and Q of cattle feed. Brand P, costing Rs 250 per bag,
contains 3 units of nutritional element A, 2.5 units of element B and two units of C.
Brand Q costing Rs 200 per bag contains 1.5 units of nutritional element A, 11.25 units
of element B, and 3 units of element C. The minimum requirements of nutrients A,B and
C are 18 units, 45 units and 24 units respectively. Determine the number of bags of each
brand which should be mixed in order to produce a mixture having a minimum cost per
bag? What is the minimum cost of the mixture per bag?
Sol: Let x bags of brand P are mixed with y bags of brand Q and let Z be the total cost of
the mixture. The mathematical model of the problem is:
Minimise 250 200 Z x y = +
Subject to: 3 1.5 18, 2.5 11.25 45, 2 3 24, 0, 0 x y x y x y x y + > + > + > > >
Corner points are (18,0),(9,2),(3,6),(0,12)
( ) ( ) ( ) ( ) 18,0 9,2 3,6 0,12
4500, 2650, 1950, 2400 Z Z Z Z = = = =
Thus smallest value of Z is 1950. This may or may not be the minimum value of Z . Let
us draw the region 250 200 1950 x y + <
Since 250 200 1950 x y + < has no common points with feasible region.
x
-10 -5 5 10 15
y
-25
-20
-15
-10
-5
5
10
(9,2)
(3,6)
(18,0)
(0,12)
x
-10 -5 5 10 15
y
-25
-20
-15
-10
-5
5
10
(9,2)
(3,6)
(18,0)
(0,12)
Thus the minimum cost of the mixture is Rs 1950 when 3 bags of brand P and 6 bags of
brand Q are mixe3d.
3. A dietician wishes to mix together two kind of food X and Y in such a way that the
mixture contains at least 10 units of vitamin A, 12 units of vitamin B and 8 units of
vitamin C. The vitamin contents of one kg of food is given below:
Food Vitamin A Vitamin B Vitamin C
X 1 2 1
Y 2 2 1
One kg of food X costs Rs 16 and one kg of food Y costs Rs 20. Find the least cost of the
mixture which will produce the required diet.
Sol: Let x kg of food X and y kg of food Y are mixed to prepare the diet and let Z be the
total cost of the diet. The mathematical model of the given problem is
Minimise 16 20 Z x y = +
Subject to: 2 10, 2 2 12, 3 8, 0, 0 x y x y x y x y + > + > + > > >
Corner points are (10,0),(2,4),(1,5),(0,8)
( )
(2,4) (1,5) (0,8) 10,0
160, 112, 116, 160 Z Z Z Z = = = =
The smallest value of Z is 112. But this may or may not be the minimum value of Z . Let
us draw 112 or 16 20 112 Z x y < + <
Since 16 20 112 x y + < has no common point with feasible region therefore the minimum
cost of the diet is Rs 112 when 2 kg of food X is mixed with 4 kg of food Y.
x
-10 -5 5 10
y
-10
-5
5
10
(1,5)
(2,4)
(0,8)
(10,0)
x
-10 -5 5 10
y
-10
-5
5
10
(1,5)
(2,4)
(0,8)
(10,0)
4. A manufacturer makes two types of toys A and B. Three machines are needed for this
purpose and the time(in minutes) required for each toy on the machines is given below:
Types of
Toys
Machines
I II III
A 12 18 6
B 6 0 9
Each machine is available for a maximum of 6 hours per day. If the profit on each toy of
type A is Rs 7.50 and that on each toy of type B is Rs 5, show that 15 toys of type A and
30 toys of type B should be manufactured in a day to get the maximum profit.
Sol: Let x toys of type A and y toys of type B are manufactured per day and let Z be the
total profit. Then mathematical model of the problem is
Maximise 7.5 5 Z x y = +
Subject to: 12 6 360,18 360, 6 9 360, 0, 0 x y x x y x y + s s + s > >
The corner points are (0,0),(20,0),(20,20),(15,30),(0,40)
( )
(0,0) (20,0) (20,20) (0,40) 15,30
0, 150, 250, 262.5, 200 Z Z Z Z Z = = = = =
Thus maximum profit is Rs 262.50 when 15 toys of type A and 30 toys of type B are
manufactured per day.
5. An aeroplane can carry a maximum of 200 passengers. A profit of Rs 1000 is made on
each executive class ticket and a profit of Rs 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 maximise the profit for
the airline.
Sol: Let x tickets of executive class and y tickets of economy class must be sold and
let Z be the total profit. Mathematical model of the problem is
Maximise 1000 600 Z x y = +
Subject to: 200, 20, 4 , 0, 0 x y x y x x y + s > > > >
x
20 40 60
y
-80
-60
-40
-20
20
40
60
(20,0)
(20,20)
(15,30)
(0,40)
x
50 100 150 200
y
200
400
600
800
(40,160)
(20,180)
(20,80)
The corner points are (20,80), (20,180), (40,160)
( ) ( ) ( ) 20,80 20,180 40,160
68000, 128000, 136000 Z Z Z = = =
Thus maximum profit is Rs 136000 when 40 tickets of executive class and 160 tickets of
economy class are sold.
6. To godowns A and B have grain capacity of 100 quintals and 50 quintals respectively.
They supply to three ration shops D,E and F whose requirements are 60,50, and 40
quintals respectively. The cost of transportation per quintal from the godowns to the
shops are given below in the following table:
How should the supplies be transported in order that the transportation cost is minimum?
What is the minimum cost?
Sol: Let and x y quintals be transported from the godown at A to the shops at D and E
respectively. Then 100 x y quintals will be transported to the shop at F.
Thus from B 60 x quintals will be transported to D, 50 y quintals to E and 60 x y +
quintals to F.
Transportation cost per quintal (in Rs)
From/To A B
D 6 4
E 3 2
F 2.50 3
50 (60 50 ) 40 (100 )
60
x y x y
x y
+ =
= +
50 y 60 x
100 x y
y
x
F
E
D
B
A
50 quintals
100 quintals
40 quintals
50 quintals
60 quintals
Let Z be the total cost of transportation. Then
( ) ( ) 6 3 2.5(100 ) 4(60 ) 2 50 3 60 2.5 1.5 410 Z x y x y x y x y x y = + + + + + + = + +
Thus mathematical model of the given problem is
Minimise 2.5 1.5 180 Z x y = + +
Subject to: 0, 0, 100, 60, 50, 60 x y x y x y x y > > + s s s + >
Corner points are (10,50),(60,0),(60,40),(50,50)
( ) 10,50
25 75 410 510 Z = + + =
( ) 60,0
150 410 560 Z = + =
( ) 60,40
150 60 410 620 Z = + + =
( ) 50,50
125 75 410 610 Z = + + =
Thus minimum cost of transportation is Rs 510 if A supply to D,E and F 10,50,40
quintals and B supply to D,E and F 50,0,0 quintals respectively.
7. An oil company has two depots A and B with capacities 7000 L and 4000 L
respectively. The company is to supply oil to three petrol pumps D,E and F whose
requirements are 4500L,3000L and 3500L respectively. The distances(in km) between
the depots and the petrol pumps is given in the following table:
Assuming that the transportation cost of 10 litres of oil is Re 1 per km, how should the
delivery be scheduled in order that the transportation cost is minimum? What is the
minimum cost?
Sol: Let and x y litres be transported from A to D and E respectively. Thus A will
transport to F 7000 x y litres. Now B will transport to D 4500 x litres, to E
3000 y litres and to F 3500 (7000 ) 3500 x y x y = + litres. Let Z be the total cost
of transportation. Then
( ) ( ) ( ) ( ) 3 7000 3 4500 4 3000 2 3500
7 6
10 10 10 10 10 10
x y x y x y
x y
Z
+
= + + + + +
3
or 3950
10 10
x y
Z = + +
Distance in (km)
From/To A B
D 7 3
E 6 4
F 3 2
x
20 40 60 80 100
y
-40
-20
20
40
60
80
100
(10,50)
(50,50)
(60,40)
(60,0)
Thus mathematical model of the problem is minimize
3
3950
10 10
x y
Z = + +
Subject to: 4500, 3000, 3500, 7000, 0, 0 x y x y x y x y s s + > + s > >
Corner points are (3500,0),(4500,0),(4500,2500),(4000,3000),(500,3000)
( ) ( ) ( ) ( )
(4500,2500) 4500,0 4000,3000 500,300 3500,0
5300, 5550, 5450, 4400, 1050 3950 5000 Z Z Z Z Z = = = = = + =
Thus minimum cost of transportation is Rs 4400, when from the godown A, 500 litre of
oil is transported to pump D, 3000 litre is transported to E and 3500 litre is transported to
F. Hence from the godown B, 4000 litre of oil is transported to D, 0 litre is transported to
E and 0 litre is transported to F.
8. A fruit owner can use two types of fertilizer in his garden, brand P and brand Q. The
amounts(in kg) of nitrogen, phosphoric acid, potash and chlorine in a bag of each mixture
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. If the grower wants to
minimize the amount of nitrogen added to the garden, how many of each mix should be
used? What is the amount of nitrogen added in the ground?
kg per bag
Brand P Brand Q
Nitrogen
Phosphoric Acid
Potash
Chlorine
3
1
3
1.5
3.5
2
1.5
2
Sol: Let the fruit owner mix x bags of brand P and y bags of brand Q and let Z be the total
amount of nitrogen. Then mathematical model of the given problem is
Minimize 3 3.5 Z x y = +
Subject to constraints: 2 240, 3 1.5 270,1.5 2 310, 0, 0 x y x y x y x y + > + > + s > >
(4000,3000)
(4500,2500)
(500,3000)
(3500,0) (4500,0)
y
x
x
50 100 150 200 250
y
-300
-200
-100
100
(40,100)
(20,140)
(140,50)
Thus corner points are (40,100),(140,50),(20,140).
( ) ( ) ( ) 40,100 140,50 20,140
470, 595, 550 Z Z Z = = .
Thus minimum amount of nitrogen is 470 kg when 40 kg of brand P and 100 kg of brand
Q are mixed.
9. Refer to Question 8. 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?
Sol: Here we have to maximize 3 3.5 Z x y = +
Thus maximum amount of nitrogen is 595 kg when 140 bags of brand P and 40 bags of
brand Q are mixed.
10. A toy company manufactures two types of dolls, A and B. Market tests and available
resources have indicated that the combined production level should not exceed 1200 dolls
per week and demand for dolls of type B is at most half that for dolls of type A. Further,
the production level of dolls of type A can exceed three times the production of dolls of
other type by at most by 600 units. If the company makes profit of Rs 12 and Rs 16 per
doll respectively on dolls A and B, how many of each should be produced in weekly in
order to maximize profit?
Sol: Let x dolls of type A and y dolls of type are produced per week. Let Z be the total
profit. Then mathematical model of the given problem is
Maximize 12 16 Z x y = +
Subject to:
1
1200, , 3 600, 0, 0
2
x y y x x y x y + s s s + > >
500 1000 1500 2000
y
200
400
600
800
1000
1200
(800,400)
(1050,150)
(600,0)
Corner points are (600,0),(1050,150),(800,400)
( ) ( ) ( ) 600,0 1050,150 800,400
7200, 15000, 16000 Z Z Z = =
Thus maximum profit is Rs 16000 when 800 dolls of type A and 400 dolls of type B are
produced.