Linear Programming

1) A Person wants to decide the constituents amount of diet

which will fulfill his daily requirements of Protiens,Fats
and Carbohydrates at a Minimum cost. The choice is to
be made from four different types of foods. The yields
per unit of those food are given below. Formulate Linear
programming Model

Food type Yield per unit Cost per

Proteins Fats Carbohydrates unit (Rs)

1 3 2 6 45
2 4 2 4 40
3 8 7 7 85
4 6 5 4 65
Minimum 800 200 700
Requirement

Solution:

Let X1 Amount of Type1 food to be taken, LetX2 Amount of Type2 to be

taken, Let X3 Amount of Type3 to be taken, Let X4 Amount of Type4 to be
taken,

Zmin = 45X1+ 40X2+85X3+65 X4 ----Objective Equation

3X1+ 4X2+8X3+6X4 >= 800 [Protein constrain]
2X1+ 2X2+7X3+5X4 >= 200 [Fats constrain]
6X1+ 4X2+7X3+4X4 >= 700 [Carbohydrates constrain]
X1>=0, X2>=0,X3>=0,X4>=0 { Non negative Constrain}
 Linear Programming
1) Old Hens can be bought for Rs. 300 each , Young one cost Rs.
500 each, Old Hen lay 3 eggs per week and young ones lay 5 eggs
per week, Each egg being worth 6 Rs. A hen costs of Rs. 15 for
feed. If a person has only 15000 to spend on the hens, How many
of each kind should he buy to get a profit of more than 600 Rs.
Per week Assuming that he cannot house more than 30
hens.Formulate Linear programming Model

Solution:

Let X be the number of Old Hens to be brought,

Let Y be the number of Young Hens to be brought
Old Hen Young Hen
Cost 300 500
Egg 3 Egg per week 5 Egg per week
Feed 15 Rs. 15 Rs.
Each Egg 6 6
Selling price
ZMax = SP-CP=
=(6*3)X+(6*5)Y -15*X-15*Y {15* X indicate feed}
=18X+30Y-15X-15Y
ZMax=3X+15Y ----Objective Equation
300X+500Y <= 15000 [Cost constrain]
X+Y <= 30 [Space constrain]
X>=0,Y>=0 [Non Negative]
3X+15Y >=600 [ Income Constrain]
 Linear Programming

1) A farmer has a 100 acre farm, He can sell all the

Tomatoes,Onion, Radishes he can raise, The price he can obtain
is Rs.5 per kg Tomatoes, Rs.10 per kg Onion,Rs. 8 per kg for
Radish,The average yield per acre is 2000 kg of Tomatoes,3000
kg Onion,1000 kg of Radish, Fertilizer is available at RS.5 per
Kg, Amount of fertilizer require for each Tomatoe,Onion-100 Kg
per acre,50 Kg for Radish,Labour require for cultivating per ace
is 5 man day for Tomatoes,6 man day for Onion,5 man day for
Radish. A total 400 mans are available at Rs.500 per day.
Formulate Linear programming Model.
Solution:
Tomatoes Onion Radish
Selling Price Rs.5 per kg Rs.10 per kg Rs. 8 per kg
Yield 2000kg/Acre 3000kg/Acre 1000kg/Acre
Fertilizer 100kg/Acre 100kg/Acre 50kg/Acre
Cultivating 5 Man/Acre 20 Man/Acre 5 Man/Acre
Fertilizer rate: 5 Rs/kg
Each Labour Cost: Rs.500 per Day

X1 X2 X3

Let X1 be the number of acres to be used for growing Tomatoe.

Let X2 be the numbe of acrs to be used for growing Onion.
Let X3 be the numbe of acrs to be used for growing Radishes.
Zmax =(2000*5) X1 + (3000*10) X2 + (1000*8) X3 – (100*5) X1
-(100*5) X2 – (50*5) X3 –(500*5) X1 –(20*500) X2- (500*5) X3
=10000X1 +30000 X2 + 8000 X3 - 500 X1 -500 X2 -250 X3-2500 X1
- 10000 X2 – 2500 X3
Zmax= 7000 X1 + 19500 X2 + 5250 X3 { Objective equation }
Constrains:
5 X1 + 20 X2 + 5 X3 < = 400 {Labour Constrain}
X1 + X2 + X3 <=100 { Land Constrain}
X1 >=0, X2>=0, X3 >=0 { Non negative Constrain }
2) A hospital has the following minimal daily requirement of
nurses

Period Clock time Minimal Number of Nurses

Requaired
1 6 AM to 10 AM 2
2 10 AM to 2 PM 7
3 2 PM to 6 PM 15
4 6 PM to 10 PM 8
5 10 PM to 2 AM 20
6 2 AM to 6 AM 6

Nurses report to the hospital at the beginning of each period and

work for 8 consecutive hours. The hospital wants to determine
the minimal number of nurses to be employed so that there is
sufficient number of nurses available for each period. Formulate
this as Linear programming problem

Solution:
Let X1, X2, X3, X4, X5, X6 number of nurses to be appointed for
period 1,2,3,4,5,6 respectiveley.

Objective equation: Zmin = X1 + X2 + X3 + X4 + X5 + X6

Constrains
X1 + X2 > =7
X2 + X3 > =15
X3 + X4 > =8
X4 + X5 > =20
X5 + X6 > =6
X6+ X1 > =2

X1 >=0, X2 >=0, X3 >=0, X4 >=0, X5 >=0, X6 >=0,

 Linear Programming

1) Consider the following problem faced by a production planner in

a soft drink plant. He has 2 bottling machines A and B. A is
assigned for 8-ounce bottle and B is assigned for 16-ounce bottle.
The following data are available

Machine A 8ounce bottle 16ounce bottle

A 100/ Minute 40/Minute

B 60/Minute 75/Minute

The machines can be run for 8-hours per day,5 days a week, Profit
on 8 ounce bottle is 15 paise and on 16 ounce bottle is 25 paise.
Weekly production of the drink cannot exceed 300000 ounces
and the market can obserb 25000 eight ounce bottle and 7000
sixteen ouce bottles per week. The planner wishes to maximize
his profit,of course,to all the production and marketing
constrains. Formulate Linear programming model.

Solution

Let X1 be the number of 8 Ounce bottle to be produced on

Machine A, X2 be the number of 16 ounce bottle to be produced
on Machine A.
Let Y1 be the number of 8 ounce bottle to be produced on B, Y2
be the number of 16 ounce bottle to be produced on B.

Zmax = (X1 + Y1) 0.15 +( X2 + Y2 )0.25 [Objective equation]

1 Min----100 products then 1 product 1 duration requires

100
Similarley for X1 products X1 [ 8 Ounce bottles]
100
 1 Min----- 40 products 1 product 1 duration requires
40
Similarley for X2 products X2 [16 Ounce bottles]
40
X1 X2
5*8*60 Y1 Y2
100 40 5*8*60
60 75
2X1 5X2 2400
200

2X1 + 5X2 480000

X1 + Y1 > = 25000[Market Constrain 8 ounce bottle]

X2 + Y2 > = 7000 [Market Constrain 16 ounce bottle]

8(X1 + Y1) + 16(X2 + Y2 )<=300000

X1>=0, X2>=0, Y1>=0, Y2>=0

2) A manufacture of a line of patent medicines is preparing a

production plan on medicines A and B. There are sufficient
ingredient available to make 20,000 bottles of A and 40000
bottles of B but there are only 45000 bottles into which both the
medicines can be put. Further more it take 3 hours to
prepareenough materials to fill 1000 bottles of A, it take 1 hour
to prepare enough materials to fill 1000 bottles of B and there are
66 hours available for this operations. The profit is Rs.8 perbottle
for A and Rs.7 perbottle for B. Formulate the linear programming
model

Solution: Let x be the number of A type medicine to be produced

Let y be the number of B type medicine to be produced
Zmax = 8x + 7y [ objective]

x <=20000 [Bottle A constrain]

y<=40000[Bottle B constrain]
x+y<=45000[Together]

3 x = 3x
*
1000 1000

1 y
* y =
1000 1000

3y
3x
66 hrs Hours constrain
1000 1000

X>=0, Y>=0
 Linear Programming
Q1) A firm can produce 3 types of cloth A,B,C. 3 kinds of wool required for it,
Red wool,green wool, and blue wool.
One unith length of type A cloth needs 2 yards of red Wool and 3 yards of blue
wool.one unit of length of type B cloth need 3 yard of red wool, 2 yards of
green wool and 2 yards of blue wool. One unit of type c cloth needs 5 yards of
green wool and 4 yards of blue wool. The firm has a stock of only 8 yards of red
wool, 10 yads of green wool,and 15 yards of blue wool. It is assumed that the
income obtained from one unit length of type A cloth is Rs 3, of type B cloth is
Rs.5, of type C cloth is Rs. 4. Formulate the problem as a linear programming
problem
Solution:

Let X1 be the number of Type A cloth to be produced

Let X2 be the number of Type B cloth to be produced

Let X3 be the number of Type C cloth to be produced

Zmax = 3X1+ 5X2+4X3 ----Objective Equation

Red Green Blue
Type A 2 Yard ---- 3 Yard
Type B 3 Yard 2 Yard 2 Yard
Type C ----- 5 Yard 4 Yard

Availability 8 Yard 10 Yard 15 Yard

2X1+ 3X2 < = 8 {Red Wool Constrain}

2X1+ 5X3 <= 10 {Green Wool Constrin}
3X1+ 2X2+4X3 <= 15 { Blue Wool Constrain}
X1>=0, X2>=0,X3>=0 { Non negative Constrain}
Q2) A firm Produce 3 Products,these products are processed in 3 different
machine. The time required to manufacture one unit of each product and the
daily capacity of machine 3 machine given below

Machine P1 P2 P3 Machine capacity

M1 2 8 2 940 Min/day

M2 4 --- 8 970 Min/day

M3 2 5 -- 430 Min/day

Profit of product P1,P2,P3 are RS 4, Rs 8, Rs 6 Write a linear programming

model to the given problem
Solution:

Let a be the number of Type P1 Product to be produced

Let b be the number of Type P2Product to be produced
Let c be the number of Type P3 Product to be produced

Zmax = 4a+ 8b+6c ----Objective Equation

2a+8b+2c <=940 { Machine P1 constrain}
4a+8c <=970 { Machine P2 constrain}
2a+5b <=430 { Machine P3 constrain}
a>=0, b>=0, c>=0 { Non negative Constrain}
Q3) A farmer has 1000 acres of land on which he grown corn,wheat, and
soyabeans. Each acre of corn cost Rs. 100 for preparation, requires 7 man days
of work and yields a profit of Rs 30. An acre of wheat costs Rs 120 to prepare,
requires 10 man day of work and yields profit of Rs.40, An acre of soyabean
costs Rs 70 to prepare requires 8 man days of work and yields of profit Rs.20, If
the farmer has Rs. 100000 for preparation and can count on 8000 man days
work, formulate the L.P model to allocate the number of acres to each crop to
maximize the total profit
Solution:

Let X1 be the land to be used to cultivating Corn

Let X2 be the land to be used to cultivating Wheat

Let X3 be the land to be used to cultivating Soyabean

Zmax = 30X1+ 40X2+20X3 ----Objective Equation

Preparation cost Labour
Corn 100 RS. per Acre 7 Man days per Acre
Wheat 120 Rs. per Acre 10 Man days per Acre
Soyabean 70 RS.per Acre 80Man days per Acre

Availability 100000 RS 8000 Mans Available

Acres available: 1000

100X1+ 120X2+70X3 <= 100000 { Preparation cost constrain}

7X1+ 10X2+8X3 <= 8000 {Labour constrain}
X1+ X2+X3 <= 1000 { Acres constrain}
X1>=0, X2>=0,X3>=0 { Non negative Constrain}
 Linear Programming
Q1) A firm can produce 3 types of cloth A,B,C. 3 kinds of wool required for it,
Red wool,green wool, and blue wool.
One unith length of type A cloth needs 2 yards of red Wool and 3 yards of blue
wool.one unit of length of type B cloth need 3 yard of red wool, 2 yards of
green wool and 2 yards of blue wool. One unit of type c cloth needs 5 yards of
green wool and 4 yards of blue wool. The firm has a stock of only 8 yards of red
wool, 10 yads of green wool,and 15 yards of blue wool. It is assumed that the
income obtained from one unit length of type A cloth is Rs 3, of type B cloth is
Rs.5, of type C cloth is Rs. 4. Formulate the problem as a linear programming
problem
Solution:

Let X1 be the number of Type A cloth to be produced

Let X2 be the number of Type B cloth to be produced

Let X3 be the number of Type C cloth to be produced

Zmax = 3X1+ 5X2+4X3 ----Objective Equation

Red Green Blue
Type A 2 Yard ---- 3 Yard
Type B 3 Yard 2 Yard 2 Yard
Type C ----- 5 Yard 4 Yard

Availability 8 Yard 10 Yard 15 Yard

2X1+ 3X2 < = 8 {Red Wool Constrain}

2X1+ 5X3 <= 10 {Green Wool Constrin}
3X1+ 2X2+4X3 <= 15 { Blue Wool Constrain}
X1>=0, X2>=0,X3>=0 { Non negative Constrain}
Q2) A firm Produce 3 Products,these products are processed in 3 different
machine. The time required to manufacture one unit of each product and the
daily capacity of machine 3 machine given below

Machine P1 P2 P3 Machine capacity

M1 2 8 2 940 Min/day

M2 4 --- 8 970 Min/day

M3 2 5 -- 430 Min/day

Profit of product P1,P2,P3 are RS 4, Rs 8, Rs 6 Write a linear programming

model to the given problem
Solution:

Let a be the number of Type P1 Product to be produced

Let b be the number of Type P2Product to be produced
Let c be the number of Type P3 Product to be produced

Zmax = 4a+ 8b+6c ----Objective Equation

2a+8b+2c <=940 { Machine P1 constrain}
4a+8c <=970 { Machine P2 constrain}
2a+5b <=430 { Machine P3 constrain}
a>=0, b>=0, c>=0 { Non negative Constrain}
Q3) A farmer has 1000 acres of land on which he grown corn,wheat, and
soyabeans. Each acre of corn cost Rs. 100 for preparation, requires 7 man days
of work and yields a profit of Rs 30. An acre of wheat costs Rs 120 to prepare,
requires 10 man day of work and yields profit of Rs.40, An acre of soyabean
costs Rs 70 to prepare requires 8 man days of work and yields of profit Rs.20, If
the farmer has Rs. 100000 for preparation and can count on 8000 man days
work, formulate the L.P model to allocate the number of acres to each crop to
maximize the total profit
Solution:

Let X1 be the land to be used to cultivating Corn

Let X2 be the land to be used to cultivating Wheat

Let X3 be the land to be used to cultivating Soyabean

Zmax = 30X1+ 40X2+20X3 ----Objective Equation

Preparation cost Labour
Corn 100 RS. per Acre 7 Man days per Acre
Wheat 120 Rs. per Acre 10 Man days per Acre
Soyabean 70 RS.per Acre 80Man days per Acre

Availability 100000 RS 8000 Mans Available

Acres available: 1000

100X1+ 120X2+70X3 <= 100000 { Preparation cost constrain}

7X1+ 10X2+8X3 <= 8000 {Labour constrain}
X1+ X2+X3 <= 1000 { Acres constrain}
X1>=0, X2>=0,X3>=0 { Non negative Constrain}
 LinearProgramming

1) A computer manufacturing company purchases components parts and make 2models of

moniters A and B. The components are assembled by the company to produce model A and
B. Model A requires 28 hours of labour to assemble from component part, while model B
requires 42 hours. After assembly each monitor is tested in inspection department. Model A
requires 12 hours of inspection time while B requires 6 hours. The company employs 400
peoples in the assembly department, each working 7 hours a day, 6 days a week. 100
peoples are presently employed in the inspection department, each working 8 hours a day, 6
days a week. Currently wages rate are Rs. 50 per hour in assembly and Rs.75 per hour in
inspection. Model A cost 1850 and Model B cost Rs.3250 to produce. Currently two models
sell for Rs. 6400 and Rs. 8300. The supplier of these chip can provide no more than 660 in
any one working week

Solution: Monitor A Monitor B Assemble for per monitor A

type requires 28 hour labour,
Component Cost 1850 3250
1 hour labour cost for
Assemble Cost 1400 2100 assemble =50
Inspection Cost 900 450 for 28 hours =28* 50 =1400
Cost Price 4150 5800 Type B requires 42 hour
labour for assemble
Selling price 6400 8300
For 42 hours= 42*50 =2100
Profit 6400-4150= 2250 8300-5800=2500
Inspection cost per hour=75
Let X be the number of type A to be produced,
Type A—12= 12*75=900
Let Y be the number of type B to be produced
Type B---- 6=6*75= 450
Zmax = 2250 X + 2500 Y [Objective equation]

Monitor A Monitor B Employees working total day Total hour

Assemble 28 hours 42hours 400 7 hour/day 6 400*7*6= 16800

Inspection 12 hours 6 hours 100 8 hour/day 8 100*8*6= 4800

One Monitor Type A require 28 hour for assemble, So X monitor requires X* 28=28 X

One Monitor Type B require 42 hour for assemble, So Y monitor requires Y*42= 42 Y

Available hour in assemble department =16800 28 X +42Y <=16800 [ Assemble constrain]

Similarly

One Monitor Type A require 12 hour for inspection, So X monitor requires X* 12=12 X

One Monitor Type B require 6 hour for assemble, So Y monitor requires Y*6=6 Y

Available hour in assemble department =4800 12X+6Y<=4800[ Inspection dept. hour constrain]

Chip available 660

Assume that 1 monitor require 1 chip of any type X number of Type A require X number of chip, Y
number of type B requires Y number of chip

X+Y<=660 [Chip Constarin] X>=0,Y>=0 [Non negative Constrain]

2) A confectionery company mixes 3 types of toffees ingredients to form one kg of toffee
packs. The pack is sold at Rs. 170, The 3 types of toffees ingredients cost Rs.200, Rs.100 and
Rs.50 per kg. The mixture must contain at least 0.3kg of the first type of toffees and the
weight of first first two types of toffees almost be equal to the weight of third type.
Determine the optimal mix for maximum profit

Solution : Let X, Y,Z be the number of KG ingredients of 3 types is mixed to prepare 1 KG

toffees
Zmax = 170- 200 *X-100*Y- 50*Z [Objective equation]

X>=0.30 [ First type ingredients constrain]

X+Y<=Z [type1 and 2 almost equal to third type]
X+Y+Z=1 [ To add all that to form only 1 kg, not exceed or less than 1]
X>=0, Y>=0, Z>=0
 Simplex Method

Q1) ZMax= 3X1+ 4X2

X1+X2<=4
X1-X2<=2

Solution: Zmax-3X1-4X2=0
X1+X2+S1=4
X1-X2+S2=2

Basic Variable: Unique, Unit, Positive Co-efficient : S1, S2, ZMax

Basic
X1 X2 S1 S2 ZMax RHS Ratio=
variable

S1
1 1 1 0 0 4 =4

2
S2 1 -1 0 1 0 2 = −2
−1
ZMax -3 -4 0 0 1 0

Pivoting Column [ P C] = Entering variable [ E V] = Maximum Negative in ZMax x2 = -4

Pivoting Row [P R]= Leaving Variable [LV]= Minimum Positive Ratio = 4

Pivoting Element =Intersecting of Row and Column= 1

New Pivoting Row= X2 = ∗ Old Row

X2 = *[ 1, 1, 1, 0, 0, 4]

X2 = [ 1, 1, 1, 0, 0, 4]

Key Element for S2 = -1

New Row S2 = - Key * NPR + Old row

= -(-1) 1, 1, 1, 0, 0, 4 + 1, -1, 0, 1, 0, 2

= 1 1, 1, 1, 0, 0, 4 + 1, -1, 0, 1, 0, 2

= 1, 1, 1, 0, 0, 4 + 1, -1, 0, 1, 0, 2

= 1+1, 1-1, 1+0, 0+1, 0+0, 4+2

= 2 0 1 1 0 6

Problem No.1 Page 1 of 2

 Simplex Method

Key Element for ZMax = -4

ZMax = - Key * NPR + Old row
= -(-4) 1, 1, 1, 0, 0, 4 + -3, -4, 0, 0, 1, 0

= 4 1, 1, 1, 0, 0, 4 + -3, -4, 0, 0, 1, 0

= 4, 4, 4, 0, 0, 16 + -3, -4, 0, 0, 1, 0

= 4-3, 4-4, 4+0, 0+0, 0+1, 16+0

= 1 0 4 0 1 16

Basic
X1 X2 S1 S2 ZMax RHS Ratio=
variable

X2 1 1 1 0 0 4

S2 2 0 1 1 0 6

ZMax 1 0 4 0 1 16

Stop the Process because there is no negative in Zmax row.

1X2= 4 1ZMax=16
X2=4 ZMax= 16

There is no X1 is present in Basic Variable Column So X1=0

Verification:

X1 + X2 <=4 X1 - X2 <= 2 ZMax = 3X1 + 4X2

0 + 4 <=4 0-4 <= 2 =3(0)+4(4)
4 <=4 -4 <= 2 = 0+16
ZMax =16

Problem No.1 Page 2 of 2

 Simplex Method
Q4) Zmin = X1-3X2+2X3
3X1 – X2 + 3X3 < = 7
4X1 + 3X2+8X3 < = 10
- 2X1 + 4X2 < = 12

Solution : 3X1- X2 +3X3 +S1 = 7

4X1 + 3X2 + 8X3+S2 = 10
- 2X1 + 4X2+S3 = 12

Convert Zmin to Zmax

I.e. Zmax = - Zmin
Zmax = -[ X1 – 3X2 +2X3 ]
Zmax = - X1+ 3x2 – 2X3
Zmax + X1- 3X2 + 2X3 = 0
I. B.F.S.
Let X1 = 0, X2 = 0, X3 = 0, then S1 = 7, S2 = 10, S3 = 12
Basic variable :Unique, Unit, +ve Co-effcient
S1, S2, S3, Zmax

B.V X1 X2 X3 S1 S2 S3 Zmax RHS Ratio=RHS/P.C

S1 3 -1 3 1 0 0 0 7 7/-1=-7
S2 4 3 8 0 1 0 0 10 10/3
S3 -2 4 0 0 0 1 0 12 3
Zmax 1 -3 2 0 0 0 1 0

Problem No 4 Page 1 of 5
 Simplex Method

Pivoting Element [P.E] = Intersting of row and column = 4

New Pivoting row = * [Old row]

= -2, 4, 0, 0, 0, 1, 0, 12

= − ,1, 0, 0, 0, , 0, 3
Key element for S1 = -1
New row S1 = -Key *NPR+ Old row
= -(-1) , 1, 0, 0, 0, , 0, 3 + 3, -1, 3, 1, 0, 0, 0, 7

= 1 , 1, 0, 0, 0, , 0, 3 + 3, -1, 3, 1, 0, 0, 0, 7

= − , 1, 0, 0, 0, , 0, 3 + 3, -1, 3, 1, 0, 0, 0, 7

= − +3, 1-1, 0+3, 0+1, 0+0, +0, 0+0, 3+7

= , 0 3 1 0 0 10

Key element for S2 = 3

New row = S2 = -Key *NPR +old row
= -3 − , 1, 0, 0, 0, 0, 3 + 4, 3, 8, 0, 1, 0, 0, 10

= , -3, 0, 0, 0, − , 0, -9, + 4, 3, 8, 0, 1, 0, 0,10

Problem No 4 Page 2 of 5
 Simplex Method
= +4, -3+3, 0+8, 0+0, 0+1, − +0, 0+0, -9+10

S2 = , 0, 8, 0, 1, − , 0, 1

Key Element of Zmax = -3

New row Zmax = - Key * NPR +Old row

= -(-3) , 1, 0, 0, 0, , 0, 3 + 1, -3, 2, 0, 0, 0, 1, 0

= 3 , 1, 0, 0, 0, , 0, 3 + 1, -3, 2, 0, 0, 0, 1, 0

= − , 3, 0, 0, 0, , 0, 9 + 1, -3, 2, 0, 0, 0, 1, 0

= − +1, 3-3, 0+2, 0+0, 0+0, +0, 0+1, 9+0

= − , 0 2 0 0 1 9

B.V X1 X 2 X 3 S1 S2 S3 Zmax RHS Ratio

S1 5 0 3 1 0 1 0 10 10 =10*2 =4
2 4
5

S2 11 0 8 0 1 3 0 1 1 = 1*11 =11
−
2 4 2 2

X2 1 1 0 0 0 1 0 3 3 = -6
− −
2 4
Zmax 1 0 2 0 0 3 1 9
−
2 4

Problem No 4 Page 3 of 5
 Simplex Method
Pivoting Element [P.E] = Intersting of row and column =

New Pivoting row = X1 = [Old row ]

= , 0, 8, 0, 1, , 0, 1

= , 0, 8, 0, 1, , 0, 1

NPR = X1 = 1, 0, , 0, , , 0,

Key Element of X2 = −
New row X2 = - Key * NPR +Old row

= 1, 0, , 0, , − , 0, + − , 1, 0, 0, 0, , 0, 3

= 1, 0, , 0, , − , 0, + − , 1, 0, 0, 0, , 0, 3

= , 0, , 0, , − , 0, + − , 1, 0, 0, 0, , 0, 3

= - , 0+1, +0, 0+0, +0, − + , 0+0, +3

= 0 1 0 0

Problem No 4 Page 4 of 5
 Simplex Method

B.V X1 X2 X3 S1 S2 S3 Zmax RHS Ratio

7 5 26 105
S1 0 0 − 1 − 0
11 11 44 11

16 2 3 2
X1 1 0 0 − 0
11 11 22 11
8 1 8 34
X2 0 1 0 0
11 11 44 11

30 1 30 100
Zmax 0 0 0 1
11 11 44 11

X1= X2= Zmax=

Problem No 4 Page 5 of 5
 Simplex Method

Q2) Solve : Zmax= x1+ 2x2

S.T - x1+2x2< =8
x1-2x2< =3
x1+2x2< =12

Solution: - x1+2x2+ s1=8

x1-2x2+ s2=3
x1+2x2 +s3=12
Zmax - x1-2x2= 0

Pivoting Column Simplex Table

BV X1 X2 S1 S2 S3 Zmax RHS Ratio=RHS/PC
S1 -1 2 1 0 0 0 8 4
LV S2 1 -2 0 1 0 0 3 -3/2
S3 1 2 0 0 1 0 12 6
zmax -1 -2 0 0 0 1 0

Pivoting column [P.C] = Maximum – ve value in Zmax row = X2 Column

Pivoting row [ L.V] = Minimum +ve Ratio.=S1 Row
Pivoting element[P.E]= Intersecting of row and column = 2

N.P.R = X2= x [old row]

= x [-1, 2, 1, 0, 0, 0, 8]

= ,1, , 0, 0, 0, 4

Key Element =Number marked by Pivoting column in the particular row

Key element for S2 is -2
New Row[NR] S2 = -Key x NPR +Old row
= -(-2) [ ,1, , 0,0 ,0 ,4] +[1,-2, 0, 1, 0,0,3]

= 2 [ ,1, , 0,0 ,0 ,4 ] +[1,-2, 0, 1, 0 ,0 ,3]

= [ ,2, , 0, 0, 0, 8] +[1, -2, 0, 1, 0, 0, 3]

= [-1, 2, 1, 0, 0, 0,8] + [1, -2, 0, 1, 0, 0, 3]
= [-1+1, 2-2, 1+0, 0+1, 0+0, 0+0, 8+3]

New Row[NR] S2 = [0, 0, 1, 1, 0, 0,11]

New row =NR=S3

Problem No.2 Page 1 of 3

 Simplex Method

Key element for S3 is 2

New Row[NR]=S3= - Key x NPR+ Old row

= -2 ,1, , 0, 0, 0, 4 + 1, 2, 0, 0, 1, 0, 12

= 1, -2, -1, 0, 0, 0, -8 + 1, 2, 0, 0, 1, 0, 12

= 1+1, -2+2, -1+0, 0+0, 0+1, 0+0, -8+12

= [2, 0, -1, 0, 1, 0, 4]

New row = NR = Zmax

Key element for Z max is -2

Zmax = -Key x NPR+ old row

= -(-2) 1, , 0, 0, 0, 4 + -1,-2, 0, 0, 0, 1, 0

= 2 , 1, , 0, 0, 0, 4 + -1,-2, 0, 0, 0, 1, 0

= -1, 2, 1, 0, 0, 0, 8 + -1, -2,0, 0, 0, 1, 0

= -1-1, 2-2, 1+0, 0+0, 0+0, 0+1, 8+0

= -2, 0, 1, 0, 0, 1, 8

PC

BV X1 X2 S1 S2 S3 Zmax RHS Ratio=RHS/PC

X2 -1 1 1 0 0 0 4 ∗
= = = -8
2 2 /

S2 0 0 1 1 0 0 11
LV S3 2 0 -1 0 1 0 4 2
zmax -2 0 1 0 0 1 8
Pivoting element [P.E] =2

N.P.R = X1= *[Old Row]

X1 = *[2, 0,−1, 0, 1, 0, 4]

X1= [ 1, 0, ,0, , 0, 2]

Key element of x2 =

Problem No.2 Page 2 of 3

 Simplex Method

New Row x2= -Key x NPR +Old Row

=-( ) 1, 0, , 0, , 0, 2 + , 1, , 0, 0, 0, 4

= 1, 0, , 0, , 0, 2 + , 1, , 0, 0, 0, 4

= , 0, 0, , 0,1 + , 1, , 0, 0,0, 4

= − , 0+1, + , 0+0, +0, 0+0, 1+4

= 0 , 1, , 0, , 0, 5

New Row S2 = Key element = 0

New Row S2 = -Key x NPR + Old Row
= 0 1, 0, , 0, , 0, 2 + 0, 0, 1, 1, 0, 0, 11
= 0,0,0,0,0,0,0 + 0, 0, 1, 1, 0, 0, 11
= 0,0,1,1,0,0,11
New Row = Zmax key element = -2
New Row =Zmax = -Key x NPR + Old
= -(-2) 1, 0, , 0, , 0, 2 + -2, 0, 1, 0, 0, 1, 8

= 2 1, 0, , 0, , 0, 2 + -2, 0, 1, 0, 0, 1, 8
= 2, 0, -1, 0, 1, 0, 4, + -2, 0, 1, 0, 0, 1, 8
= 2-2, 0+0, -1+1, 0+0, 1+0, 0+1, 4+8
= 0 0 0 0 1 1 12

BV X1 X2 S1 S2 S3 Zmax RHS Ratio=RHS/PC

X2 0 1 1 0 1 0 5
4 4
S2 0 0 1 1 0 0 11
X1 1 0 -1 0 1 0 2
2 2
zmax 0 0 0 0 1 1 12

1X2= 5, 1X1=2 , 1Zmax=12

X1=2 X2=5 Zmax=12

Problem No.2 Page 3 of 3

 Simplex Method
Q3) Solve : Zmax= 2x1+ 4x2+3x3
S.T x1+x2+ x3 < =18
4x1 +2x2+x3 < =35

Solution: x1+x2+ x3+ s1=18

4x1+ 2x2+ x3+ s2=35
Zmax - 2x1- 4x2- 3x3= 0

Basic variable Unique,Unit ,+ve co-efficient S1 , S2, Zmax

I.B.F.S Let x1, x2, x 3 are zero then S1 =18, S2=35, Zmax= 0

Pivoting Column PC Simplex Table

BV X1 X2 X3 S1 S2 Zmax RHS Ratio=RHS/PC
S1
1 1 1 1 0 0 18 =18
LV
S2
4 2 1 0 1 0 35 =17.5
Zmax -2 -4 -3 0 0 1 0

Pivoting Element[P.E]= Intersecting of row and column = 2

New Pivoting Row [N.P.R] = x [Old row]

= x 4, 2, 1, 0, 1, 0, 35

= , , , , , ,

NPR = x2 = 2, 1, , 0, , 0,

Key Element of S1 is 1
New Row[NR] S1 = -Key x NPR +Old row

= -1 [ 2 ,1, , 0, ,0 , ] + [1,1, 1, 1, 0,0,18]

= [−2, −1 , , 0, , 0, ] +[1,1, 1, 1, 0,0,18]

= [-2+1, -1+1, +1, 0+1, +0, 0+0, +18]

= [-1 0 1 0 ]

Problem No. 3 Page 1

 Simplex Method
Key element of Zmax is -4

New Row[NR]= Zmax = - Key x NPR+ Old row

= -(-4) x 2, 1, , 0, , 0, + -2, -4, -3, 0, 0, 1, 0

= 4 2, 1, , 0, , 0, + -2, -4, -3, 0, 0, 1, 0

= 8, 4, 2, 0, 2, 0, 70 + -2, -4, -3, 0, 0, 1, 0

= 8-2, 4-4, 2-3, 0+0, 2+0, 0+1, 70+0

= [6 0 -1 0 2 1 70 ]

Simplex Table
P.E

BV X1 X2 X3 S1 S2 Zmax RHS Ratio=RHS/PC

S1 -1 0 1 1 -1 0 1 = * =1
2 2 2 1
2
X2 2 1 1 0 1 0 35 = * =35
2 2 2 1
2
zmax 6 0 -1 0 2 1 70 -71
Pivoting Element = [P.E] = Intersect of Row column =

New Pivoting Row [ NPR] = X3

X3 = x [ old row]

= 1 −1, 0, , 1, , 0,

= 2 -1, 0, , 1, , 0,

= -2, 0, 1, 2, -1, 0, 1

Problem No. 3 Page 2

 Simplex Method

Key Element of X2 =

New Row [NR] =X1= -Key x NPR +Old Row

=− -2, 0, 1, 2, -1, 0, 1 + 2, 1, , 0, , 0,

= 1, 0, ,-1, , 0, + 2, 1, , 0, , 0,

= 1+2, 0+1, + , -1+0, + , 0+0, +

X2 = 3 1 0 -1 1 0 17

Key Element 0f Zmax = -1

NR = Zmax= -Key x NPR + Old Row
= -(-1) -2, 0, 1, 2, -1, 0, 1 + 6, 0, -1, 0, 2, 1, 70
= 1 -2, 0, 1, 2, -1, 0, 1 + 6, 0, -1, 0, 2, 1, 70
= -2, 0, 1, 2, -1, 0, 1 + 6, 0, -1, 0, 2, 1, 70
= -2+6, 0+0, 1-1, 2+0, -1+2, 0+1, 1+70
= 4 0 0 2 1 1 71

BV X1 X2 X3 S1 S2 Zmax RHS Ratio=RHS/PC

X3 -2 0 1 2 -1 0 1
X2 3 1 0 -1 1 0 17
Zmax 4 0 0 2 1 1 71

X2 =17 X3=1 X1=0 Zmax=71

Problem No. 3 Page 3

 UV Method

Transportation Problem

S1 S2 S3 S4 Available
Production
Unit
P1 6 4 1 5 14
P2 8 9 2 7 16
P3 4 3 6 2 5
Demand 6 10 15 4

Solution:
Allotment for the above problem using Matrix minima method

Production S1 S2 S3 S4 Available
Unit
P1 6 4 14 1 5 14

P2 6 8 9 9 1 2 7 16

P3 4 1 3 6 4 2 5
Demand 6 10 15 4

T.T.C:- 14 * 1 + 6 * 8 + 9 * 9 + 15 * 2 + 1 * 3 + 4 * 2
14 + 48 + 81 + 30 + 3 + 8
= 156
m= Number of rows=3
n=Number of columns=4
m+n–1
3+4-1 = 6

Page 1 of 8
 UV Method

U .V Method
Ui
7 8 1 7

0 1
Vj Cij = (ui + vj)
1 8 9 2

-5 3 2

Cij = ui + vj Cij = ui +vj Cij = ui +vj Cij = ui +vj Cij = ui +vj

1 = ui + 0 2 = 1 + vj 8 = ui+1 9 = ui+1 3 = 8 +vj
ui = 1 vj = 1 ui= 7 ui = 8 vj = - 5
Cij = ui + vj
2 = ui -5
ui =7

Cij – (ui + vj) > 0

7 8 1 7 6 – (7+0) 4 – (8 + 0)

0 6 4 5 6–7 = -1 > 0 4 – 8 = -4 > 0

False False
1 7 Negative
Negative
-5 4 6
5 – (7 + 0) 7 – (1 + 7)

5 – 7 = -2 > 0 7 – 8 = -1 > 0
False False
Negative Negative

4 – (-5 + 7) 6 – (-5 + 1)

4 – (2) = 2 > 0 6 –(-4) = 6+4 =10 > 0

Page 2 of 8
 UV Method

Modi Method
Choose Maximum Negative cell (Here 1st row second column)

+Ө Min 14 – Ө , 9 – Ө
14 - Ө
4 9–Ө =0
1
6 9- Ө 1+ Ө Ө=9
8
9
2
1 4
3 2

6 9 5 1
4 5
6 10
8 9 2 7
4 1 3 6 4 2

T.T.C = 9 * 4 + 5 * 1 + 6 * 8 + 10 * 2 + 1 * 3 + 4 * 2

= 36 + 5 + 48 + 20 + 3 + 8

= 120

UV method

6 9 5 1
4 5 14 M+N–1
6 10 3 +4 –1
8 9 2 7 16
5 = 6
4 1 3 6 4 2

6 10 15 4
Page 3 of 8
 UV Method

Cij = ui + vj
Ui
7 4 1 3
Vj
0 4 1

1 8 2

-1 3 2

Cij = ui + vj Cij = ui +vj Cij = ui +vj Cij = ui +vj Cij = ui +vj

4 = ui + 0 1 = ui + 0 2 = 1+ vj 8= ui+1 3 = 4 +vj
ui = 4 vj = 1 vj = 1 ui = 7 vj = - 1

Cij = ui + vj
2 = ui +(-1)
2= ui -1
ui = 3

7 4 1 3

0 6 5

1 9 7

-1 4 6 Cij – ( ui + vj ) > 0

6 – (0 + 7) 5 – (3 + 0)
6– 7=-1>0
False, 5–3=2>0
Negative
4 – (-1 + 7)
9 – (4 + 1) 7 – (1 + 3) 4–6=-2>0
9–5=4>0 7–4=3>0 False, Negative
6 – (-1 + 1)
= 6 Page
> 0 4 of 8
 UV Method

Modi Method
Min 6- Ө , 5 – Ө , 1 - Ө
9+Ө
5- Ө
4 1–Ө =0
1 Ө=1
6-Ө
10+ Ө
8
8
2

+Ө 1-Ө 4
2
4 3

6 10 4 4 1 5 14
5 8 9 11 2 7 16
5
1
4 3 6 4 2

6 10 15 4

T.T.C = 10 * 4 + 4 * 1 + 5 * 8 + 11 * 2 + 1 * 4 + 4 * 2
= 40 + 4 + 40 + 22 + 4 + 8
= 118

Page 5 of 8
 UV Method

U V method

6 10 4 4 1 5 14 M+N–1
5 8 9 11 2 7 16 3+4–1
5 =6
1
4 3 6 4 2

6 10 15 4

Ui Cij = (ui + vj)

7 4 1 5
Vj
0 4 1

1 8 2

-3 4 2

Cij = ui + vj Cij = ui +vj Cij = ui +vj Cij = ui +vj Cij = ui +vj

4 = ui + 0 1 = ui + 0 2 = 1+ vj 8= ui+1 4 = 7+vj
ui = 4 vj = 1 vj = 1 ui = 7 vj = - 3
Cij = ui + vj
2 = ui +(-3)
2= ui -3
ui = 5
7 4 1 5
6 – (0 + 7) 5 – (5 + 0)
0 6 5
6– 7=-1>0 5–5=0>0
1 9 7 False Negative

-3 3 6 9 – (1 + 4) 7 – (1 + 5)
9–5=4>0 7–6=1>0
Page 6 of 8 3 – (-3 + 4) 6 – (-3 + 1)
3 – (1) = 2 > 0 6 – (-2) = 8 > 0
 UV Method

Modi Method

+Ө 10
4-Ө
6 Min 4–Ө,5–Ө
4
1
4–Ө=0
5-Ө 11+ Ө
Ө=4
8
2
1 4
4 2

4 6 10 4 1 5 14
1 8 9 15 2 7 16
5
1
4 3 6 4 2

6 10 15 4

T.T.C = 4 * 6 + 10 * 4 + 1 * 8 + 15* 2 + 1 * 4 + 4 * 2
= 24 + 40 + 8 + 30 + 4 + 8
= 114

Page 7 of 8
 UV Method

UV method
Ui
6 4 0 4
Vj
0 6 4 M+N–1

2 8 2 3+4–1

-2 4 2 =6

Cij = ui + vj Cij = ui +vj Cij = ui +vj Cij = ui +vj Cij = ui +vj

6= ui + 0 4 = ui + 0 8 = 6+ vj 2= ui+2 4 = 6+vj
ui = 6 vj = 4 vj = 2 ui = 0 vj = - 2
Cij = ui + vj
2 = ui +(-2)
ui = 4

6 4 0 4

0 1 5 Cij – (ui + vj) > 0

2 9 7

-2 3 6

1 – (0 + 0) 5 – (0 + 4) 9 – (2 + 4) 7 – (2 + 4)

1–0=1>0 5–4=1>0 9–6=3>0 7–6=1>0

3 – (-2 + 4) 6 – (-2 + 0)

3 – (2) = 1 > 0 6+2=8>0

All values are possitive, so answer obtain is optimal.

Answer 114
Page 8 of 8
 Transportation Problem – VAM Method

Voggel’s Approximation Method[ V.A.M ]

Steps:
1) Calculating Penalty
It is an absolute difference between 2 Least cells in each Row and Column
2) Allot in the column / Row which is having highest penalty, in that allot
the cell which is having least value
( If the tie between penalty, then choose the cell where we can assign
maximum units)
3) Re caluclate penalty before going to next allotment
4) Repeat step 1 to 3 untill supply and demand fullfill.

Production
Maddur K.R Nagar N. Gudu P. Pura Available Penalty
unit

Mysuru 6 4 1 5 14

C. H. Nagar 8 9 2 7 16

Mandya 4 3 6 2 5

Demand 6 10 15 4

Production
Maddur K.R Nagar N. Gudu P. Pura Available Penalty
Unit

Mysuru 6 4 1 5 14 3

C. H. Nagar 8 9 2 7 16 5
Mandya 4 3 6 2 5 1

Demand 6 10 15 4

Penalty 2 1 1 3

VAM Problem 1 Page 1 of 5

 Transportation Problem – VAM Method

Production
Maddur K.R Nagar N. Gudu P. Pura Available Penalty
Unit

Mysuru 6 4 1 5 14
2
C. H. Nagar 8 9 15 7 16 1 5

Mandya 4 3 6 2 5

Demand 6 10 15 0 4

Penalty

Production
Maddur K.R Nagar N. Gudu P. Pura Available Penalty
Unit

Mysuru 6 4 X 1 5 14 1

2
C. H. Nagar 8 9 15 7 16 1 1

Mandya 4 3 X 6 2 5 1

Demand 6 10 15 0 4

Penalty 2 1 X 3

Production
Maddur K.R Nagar N. Gudu P. Pura Available Penalty
Unit
Mysuru 6 4 X 1 5 14
2
C. H. Nagar 8 9 15 7 16 1
2
Mandya 4 3 X 6 4 5 1

Demand 6 10 15 0 4 0

Penalty 3

VAM Problem 1 Page 2 of 5

 Transportation Problem – VAM Method

Production
Maddur K.R Nagar N. Gudu P. Pura Available Penalty
Unit

Mysuru 6 4 X 1 X 5 14 2
2
C. H. Nagar 8 9 15 X 7 16 1 1

2
Mandya 4 3 X 6 4 5 1 1

Demand 6 10 15 0 4 0
Penalty 2 1 X X

Production
Unit
Maddur K.R Nagar N. Gudu P. Pura Available Penalty

4
Mysuru 6 10 X 1 X 5 14 4 2
2
C. H. Nagar 8 9 15 X 7 16 1
2
Mandya 4 3 X 6 4 5 1

Demand 6 10 0 15 0 4 0
Penalty

Production
Maddur K.R Nagar N. Gudu P. Pura Available Penalty
Unit
4
Mysuru 6 10 X 1 X 5 14 4 6

2
C. H. Nagar 8 X 9 15 X 7 16 1 8
2
Mandya 4 X 3 X 6 4 5 1 4

Demand 6 10 0 15 0 4 0
Penalty 2 X X X

VAM Problem 1 Page 3 of 5

 Transportation Problem – VAM Method

Production
Maddur K.R Nagar N. Gudu P. Pura Available Penalty
Unit
4
Mysuru 6 10 X 1 X 5 14 4
2
1 8 15
C. H. Nagar X 9 X 7 16 1 0 8
2
Mandya 4 X 3 X 6 4 5 1 0

Demand 6 5 10 0 15 0 4 0
Penalty

Production
Maddur K.R Nagar N. Gudu P. Pura Available Penalty
Unit
4
Mysuru 6 10 X 1 X 5 14 4 6

2
C. H. Nagar 1 8 X 9 15 X 7 16 1 0 X

2
Mandya 4 X 3 X 6 4 5 1 4

Demand 6 5 10 0 15 0 4 0
Penalty 2 X X X

Production
Unit
Maddur K.R Nagar N. Gudu P. Pura Available Penalty

6 4
Mysuru 4 10 X 1 X 5 14 4 0 6
8 2
C. H. Nagar 1 X 9 15 X 7 16 1 0
2
Mandya 4 X 3 X 6 4 5 1
Demand 6 5 1 10 0 15 0 4 0
Penalty

VAM Problem 1 Page 4 of 5

 Transportation Problem – VAM Method

Production
Unit
Maddur K.R Nagar N. Gudu P. Pura Available Penalty

6 4
Mysuru 4 10 X 1 X 5 14 4 0 X

8 2
C. H. Nagar 1 X 9 15 X 7 16 1 0 X

2
Mandya 4 X 3 X 6 4 5 1 4

Demand 6 5 1 10 0 15 0 4 0
Penalty 4 X X X

Production
Unit
Maddur K.R Nagar N. Gudu P. Pura Available Penalty

6 4
Mysuru 4 10 X 1 X 5 14 4 0
8 2
C. H. Nagar 1 X 9 15 X 7 16 1 0
4 2
Mandya 1 X 3 X 6 4 5 1 0 4
6 5 1
Demand 10 0 15 0 4 0
0
Penalty 4

Total transportation cost

4*6 + 10*4 + 1*8 + 15*2+ 1*4+ 4*2= 24 + 40 + 8 + 30 + 4 +8 = 114

VAM Problem 1 Page 5 of 5