Scribd
Upload
9 views39 pages

Transportation Problem

Uploaded by

Dejene Tsegaye
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
9 views39 pages

Transportation Problem

Uploaded by

Dejene Tsegaye
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 39

Northwest Corner Method

Find the Optimum Transportation Cost


N Demand
2 7 4
W 5 Check the minimum of demand and supply
3 3 1 and take the minimum and assign the min. value to N
8
5 4 7
7
1 6 2
14 34
Balanced
Transportation
Supply 7 9 18 34 Problem
34

Step 1
N Demand
2 7 4
W 5 0 0 0 The demand satisfied
cancel the row
3 3 1
0 0 0 8
5 4 7
0 0 0 7

0 0 0 14
Supply 2 9 18 0 34

Step 2
N Demand
2 7 4
W 5 0 0 0 The demand satisfied
cancel the row
3 3 1
2 0 0 6
5 4 7
0 0 0 7
1 6 2
0 0 0 14
Supply 0 9 18 0 0

Step 4
N Demand
2 7 4
W 5 0 0 0 The demand satisfied
cancel the row
3 3 1
2 6 0 0
5 4 7
0 3 0 4
1 6 2
0 0 0 14
Supply 0 0 18 0 0

Step 6
N Demand
2 7 4
W 5 0 0 0 The demand satisfied
cancel the row
3 3 1
2 6 0 0
5 4 7
0 3 4 0
1 6 2
0 0 0 14
Supply 0 0 14 0 0
mand and supply
assign the min. value to NW cell

Step 3
N Demand
2 7 4
W 5 0 0 0 The demand
satisfied cancel the
3 3 1 row
2 6 0 0
5 4 7
0 0 0 7
1 6 2
0 0 0 14
Supply 0 3 18 0 0

Step 5
N Demand
2 7 4
W 5 0 0 0 The demand
satisfied cancel the
3 3 1 row
2 6 0 0
5 4 7
0 3 0 4
1 6 2
0 0 0 14
Supply 0 0 18 0 0

Step 7
N Demand
2 7 4
W 5 0 0 0 The demand
satisfied cancel the
3 3 1 row
2 6 0 0
5 4 7
0 3 4 0
1 6 2
0 0 14 0
Supply 0 0 0 0 0
The minimum Transportation cost 102.00
Northwest Corner Method
Find the Optimum Transportation Cost
N Demand
5 4 3
W 100 Check the minimum of demand and supply
8 4 3 and take the minimum and assign the min. value to N
300
9 7 5
300

700
Balanced
Transportation
Supply 300 200 200 700 Problem
700

Step 1
N Demand
5 4 3
W 100 0 0 0 The demand satisfied
cancel the row
8 4 3
0 0 0 300
9 7 5
0 0 0 300

0 0 0 0
Supply 200 200 200 0 700

Step 2
N Demand
5 4 3
W 100 0 0 0 The demand satisfied
cancel the row
8 4 3
200 0 0 100
9 7 5
0 0 0 300
0 0 0
0 0 0 0
Supply 0 200 200 0 0

Step 4
N Demand
5 4 3
W 100 0 0 0 The demand satisfied
cancel the row
8 4 3
200 100 0 0
9 7 5
0 0 300
0 0 0
0 0 0 0
Supply 0 100 200 0 0

Step 6
N Demand
5 4 3
W 100 0 0 0 The demand satisfied
cancel the row
8 4 3
200 100 0 0
9 7 5
0 100 0 200
0 0 0
0 0 0 0
Supply 0 0 200 0 0
mand and supply
assign the min. value to NW cell

Step 3
N Demand
5 4 3
W 100 0 0 0 The demand
satisfied cancel the
8 4 3 row
200 100 0 0
9 7 5
0 0 0 300
0 0 0
0 0 0 0
Supply 0 100 200 0 0

Step 5
N Demand
5 4 3
W 100 0 0 0 The demand
satisfied cancel the
8 4 3 row
200 100 0 0
9 7 5
0 100 0 200
0 0 0
0 0 0 0
Supply 0 0 200 0 0

Step 7
N Demand
5 4 3
W 100 0 0 0 The demand
satisfied cancel the
8 4 3 row
200 100 0 0
9 7 5
0 100 200 0
0 0
0 0 0 0
Supply 0 0 0 0 0
The minimum Transportation cost 4,200.00
Find the Optimum Transportation Cost
Demand
5 4 3
100 Check the minimum of demand and supply
8 4 3 and take the minimum and assign the min. value to
300
9 7 5
300

700
Supply 300 200 200 700
700

Demand
5 4 3
100 0 Check the minimum of demand and supply
8 4 3 and take the minimum and assign the min. value to

300
9 7 5
300
0 0 0
0 600
Supply 300 200 100 0 600
600

Demand
5 4 3
100 0 Check the minimum of demand and supply
8 4 3 and take the minimum and assign the min. value to
100 200
9 7 5
300
0 0 0
0 500
Supply 300 200 0 0 500
500

Demand
5 4 3
100 0 Check the minimum of demand and supply
8 4 3 and take the minimum and assign the min. value to
200 100 0
9 7 5
300
0 0 0
0 300
Supply 300 0 0 0 300
300

Demand
5 4 3
100 0 Check the minimum of demand and supply
8 4 3 and take the minimum and assign the min. value to
200 100 0
9 7 5
300 0
0 0 0
0 0
Supply 0 0 0 0 0
0
Demand
5 4 3
100 0 Check the minimum of demand and supply
8 4 3 and take the minimum and assign the min. value to
200 100 0 m-no. row n-no. of c
9 7 5 No. of allotment=
300 0 5=
0 0 0 5=
0 0 The solution is non de
Supply 0 0 0 0 0
0
The minimum Transportation cost 4,100.00 unit
mand and supply
d assign the min. value to NW cell

mand and supply

d assign the min. value to NW cell

mand and supply

d assign the min. value to NW cell


mand and supply

d assign the min. value to NW cell

mand and supply

d assign the min. value to NW cell


mand and supply

d assign the min. value to NW cell


n-no. of column
m+n-1
3+3-1
5
olution is non degenerat basic feasible solution
Find the Optimum Transportation Cost
Demand
2 1 3
10 Check the minimum of demand and supply
4 5 7 and take the minimum and assign the min. value to NW
20
1 8 6
15

45
Supply 12 18 15 45
45

Demand
2 1 3
10 0 Check the minimum of demand and supply
4 5 7 and take the minimum and assign the min. value to NW

20
1 8 6
15

0 35
Supply 12 8 15 0 35
35

Demand
2 1 3
10 0 Check the minimum of demand and supply
4 5 7 and take the minimum and assign the min. value to NW

20
1 8 6
12 3

0 23
Supply 0 8 15 0 23
23

Demand
2 1 3
10 0 Check the minimum of demand and supply
4 5 7 and take the minimum and assign the min. value to NW
8 12
1 8 6
12 3

0 15
Supply 0 0 15 0 15
15

Demand
2 1 3
10 0 Check the minimum of demand and supply
4 5 7 and take the minimum and assign the min. value to NW
8 12
1 8 6
12 3 0

0 12
Supply 0 0 12 0 12
12
Demand
2 1 3
10 0 Check the minimum of demand and supply
4 5 7 and take the minimum and assign the min. value to NW
8 12 0 m-no. row n-no. of colu
1 8 6 No. of allotment = m+n-1
12 3 0 5 = 3+3-1
5= 5
0 0 The solution is non degen
Supply 0 0 0 0 0
0
The minimum Transportation cost 164.00 unit
d and supply
ign the min. value to NW cell

d and supply

ign the min. value to NW cell

d and supply

ign the min. value to NW cell


d and supply

ign the min. value to NW cell

d and supply

ign the min. value to NW cell


d and supply

ign the min. value to NW cell


n-no. of column
m+n-1

tion is non degenerat basic feasible solution


Find the Optimum Transportation Cost
Supply
10 4 11
70
12 5 8
50
9 7 6
30 150
Demand 40 50 60 150
150
D= the difference between least two
Supply D1
10 4 11 0 6
50 20
12 5 8 0 3
50
9 7 6 0 1
30 100
Demand 40 0 60 0
40 -50 60 0 100
D1 1 1 2 0
Maximum of the difference

Supply D1 D2
10 4 11 0 6 7
0 30 40
12 5 8 0 3 3
50
9 7 6 0 1 1
30 120
Demand 40 -80 60 0 Unbalanced
20
D1 1 1 2 0
Maximum of the difference
D2 - 1 2 0

Supply D1 D2 D3
10 4 11 0 6 7 -
30 40
12 5 8 0 3 3 3
20 30
9 7 6 0 1 1 1
30 100
Demand 40 -100 60 Unbalanced
0
D1 1 1 2 0
Maximum of the difference
D2 - 1 2 0
D3 - 2 2 0

Supply D1 D2 D3
10 4 11 0 6 7 -
30 40
12 5 8 0 3 3 3
20 30 0
9 7 6 0 1 1 1
30 0 40
Demand 40 -100 0 0 Unbalanced
-60
D1 1 1 2 0
Maximum of the difference
D2 - 1 2 0
D3 - 2 2 0
D4

Supply D1 D2 D3
10 4 11 0 -7 0 11
30 ###
12 5 8 0 -3 0 8
20 30 ###
9 7 6 0 1 0 6
30 ### ###
Demand ### ### ### ### ###
###
D1 1 1 2 0
Maximum of the difference
D2 - 1 2 0
D3 - 2 2 0
D4 0 0 0 0
e between least two number in the row
D4
-
D4 D5
0 0

0 0

0 0
Find the Optimum Transportation Cost
Supply
5 4 3
100
8 4 3
300
9 7 5
300 700
Demand 300 200 200 700
700
D= the difference between least two
Supply D1
5 4 3 0 1
100 0
8 4 3 0 1
300
9 7 5 0 2
300 600
Demand 200 200 200 0 600
600
D1 3 0 0 0
Maximum of the difference

Supply D1 D2
5 4 3 0 1 -
100 0
8 4 3 0 1 1
200 100
9 7 5 0 2 2
300 400
Demand 200 0 200 0 400
400
D1 3 0 0 0
Maximum of the difference
D2 1 3 0 0

Supply D1 D2 D3
5 4 3 0 1 - -
100 0
8 4 3 0 1 1 5
200 100 0
9 7 5 0 2 2 2
300 300
Demand 200 0 100 0 300
300
D1 3 0 0 0
Maximum of the difference
D2 1 3 0 0
D3 1 - - 0

Supply D1 D2 D3
5 4 3 0 1 - -
100 0 0 0 0
8 4 3 0 1 1 5
200 100 0 0
9 7 5 0 2 2 2
200 0 100 0 0
Demand 0 0 0 0
0
D1 3 0 0 0
Maximum of the difference
D2 1 3 0 0
D3 1 - - 0
D4

Supply D1 D2 D3
5 4 3 0 1 0 3
100 0 0 0 0
8 4 3 0 1 0 3
0 200 100 0 0
9 7 5 0 2 0 5
200 0 100 0 0 0
Demand 0 0 0 0 0
0
D1 3 0 0 0
Maximum of the difference
D2 1 3 0 0
D3 1 - - 0
D4 0 0 0 0
e between least two number in the row
D4
-
D4 D5
0 0

0 0

0 0
Find the Optimum Transportation Cost
Supply
19 30 50 10
7
70 30 40 60
9
40 8 70 20
18 34
Demand 5 8 7 14 34
34
D= the difference between least two number
Supply D1
19 30 50 10 9
7
70 30 40 60 10
9
40 8 70 20 12
8 10 26
Demand 5 0 7 14 26
26
D1 21 22 10 10
Maximum of the difference

Supply D1 D2
19 30 50 10 9 9
5 2
70 30 40 60 10 10
9
40 8 70 20 12 20
8 10 21
Demand 0 0 7 14 21
21
D1 21 22 10 10
Maximum of the difference
D2 21 - 10 10

Supply D1 D2 D3
19 30 50 10 9 9 40
5 2
70 30 40 60 10 10 20
9
40 8 70 20 12 20 50
8 10 0 11
Demand 0 0 7 4 11
11
D1 21 22 10 10
Maximum of the difference
D2 21 - 10 10
D3 - - 10 10

Supply D1 D2 D3 D4
19 30 50 10 9 9 40 40
5 2 0
70 30 40 60 10 10 20 20
9
40 8 70 20 12 20 50 -
8 10 0 9
Demand 0 0 7 2 9
9
D1 21 22 10 10
Maximum of the difference
D2 21 - 10 10
D3 - - 10 10
D4 - - 10 50

Supply D1 D2 D3 D4
19 30 50 10 9 9 40 40
5 2 0
70 30 40 60 10 10 20 20
7 2 0
40 8 70 20 12 20 50 -
8 10 0 0
Demand 0 0 0 0 0
0
D1 21 22 10 10
Maximum of the difference
D2 21 - 10 10
D3 - - 10 10
D4 - - 10 50
D5 - - 40 60
n least two number in the row
D5
-

20

You might also like