Print This Solution Close This Solution

Find Solution of Transportation Problem using North-West Corner method

TOTAL no. of supply constraints : 3
TOTAL no. of demand constraints : 3
Problem Table is
GudangXGudang GudangYGudang
X
Y

GudangZGudan
gZ

Suppl
y

Pabrik1Pabrik
680
1

640

660

106

Pabrik2Pabrik
760
2

720

840

132

Pabrik3Pabrik
800
3

680

740

127

Demand

122

152

91

The rim values for Pabrik1Pabrik1=106 and GudangXGudangX=91 are

compared.
The smaller of the two i.e. min(106,91) = 91 is assigned
to Pabrik1Pabrik1 GudangXGudangX
This meets the complete demand of GudangXGudangX and leaves 106 - 91 = 15
units with Pabrik1Pabrik1
Table-1
GudangXGudang GudangYGudang
X
Y

GudangZGudan
gZ

Suppl
y

Pabrik1Pabrik
680 (91)
1

640

660

15

Pabrik2Pabrik
760
2

720

840

132

Pabrik3Pabrik
800
3

680

740

127

Demand

122

152

The rim values for Pabrik1Pabrik1=15 and GudangYGudangY=122 are

compared.
The smaller of the two i.e. min(15,122) = 15 is assigned
to Pabrik1Pabrik1 GudangYGudangY
This exhausts the capacity of Pabrik1Pabrik1 and leaves 122 - 15 = 107 units
with GudangYGudangY
Table-2
GudangXGudang GudangYGudang
X
Y

GudangZGudan
gZ

Suppl
y

Pabrik1Pabrik
680 (91)
1

640 (15)

660

Pabrik2Pabrik
760
2

720

840

132

Pabrik3Pabrik
800
3

680

740

127

Demand

107

152

The rim values for Pabrik2Pabrik2=132 and GudangYGudangY=107 are

compared.
The smaller of the two i.e. min(132,107) = 107 is assigned
to Pabrik2Pabrik2 GudangYGudangY
This meets the complete demand of GudangYGudangY and leaves 132 - 107 = 25
units with Pabrik2Pabrik2
Table-3
GudangXGudang GudangYGudang
X
Y
Pabrik1Pabrik 680 (91)

640 (15)

GudangZGudan
gZ

Suppl
y

660

Pabrik2Pabrik
760
2

720 (107)

840

25

Pabrik3Pabrik
800
3

680

740

127

Demand

152

The rim values for Pabrik2Pabrik2=25 and GudangZGudangZ=152 are

compared.
The smaller of the two i.e. min(25,152) = 25 is assigned
to Pabrik2Pabrik2 GudangZGudangZ
This exhausts the capacity of Pabrik2Pabrik2 and leaves 152 - 25 = 127 units
with GudangZGudangZ
Table-4
GudangXGudang GudangYGudang
X
Y

GudangZGudan
gZ

Suppl
y

Pabrik1Pabrik
680 (91)
1

640 (15)

660

Pabrik2Pabrik
760
2

720 (107)

840 (25)

Pabrik3Pabrik
800
3

680

740

127

Demand

127

The rim values for Pabrik3Pabrik3=127 and GudangZGudangZ=127 are

compared.
The smaller of the two i.e. min(127,127) = 127 is assigned
to Pabrik3Pabrik3 GudangZGudangZ

Table-5
GudangXGudang GudangYGudang
X
Y

GudangZGudan
gZ

Suppl
y

Pabrik1Pabrik
680 (91)
1

640 (15)

660

Pabrik2Pabrik
760
2

720 (107)

840 (25)

Pabrik3Pabrik
800
3

680

740 (127)

Demand

Final Allocation Table is

GudangXGudang GudangYGudang
X
Y

GudangZGudan
gZ

Suppl
y

Pabrik1Pabrik
680 (91)
1

640 (15)

660

106

Pabrik2Pabrik
760
2

720 (107)

840 (25)

132

Pabrik3Pabrik
800
3

680

740 (127)

127

Demand

122

152

91

The minimum total transportation

cost =68091+64015+720107+84025+740127=263500=68091+64015+7
20107+84025+740127=263500
Here, the number of allocated cells = 5 is equal to m + n - 1 = 3 + 3 - 1 = 5
This solution is non-degenerate

Optimality test using modi method...

Allocation Table is
GudangXGudang GudangYGudang
X
Y

GudangZGudan
gZ

Suppl
y

Pabrik1Pabrik
680 (91)
1

640 (15)

660

106

Pabrik2Pabrik
760
2

720 (107)

840 (25)

132

Pabrik3Pabrik
800
3

680

740 (127)

127

Demand

122

152

91

Step-1 of optimality test

1. Find uiui and vjvj for all occupied cells(i,j), where cij=ui+vjcij=ui+vj
Substituting, u1u1 = 0, we get
Pabrik1GudangX:c11=u1+v1680=0+v1v1=680Pabrik1GudangX:c11=u1+v1

680=0+v1v1=680
Pabrik1GudangY:c12=u1+v2640=0+v2v2=640Pabrik1GudangY:c12=u1+v2

640=0+v2v2=640
Pabrik2GudangY:c22=u2+v2720=u2+640u2=720640=80Pabrik2GudangY:c

22=u2+v2720=u2+640u2=720-640=80
Pabrik2GudangZ:c23=u2+v3840=80+v3v3=84080=760Pabrik2GudangZ:c2

3=u2+v3840=80+v3v3=840-80=760
Pabrik3GudangZ:c33=u3+v3740=u3+760u3=740760=20Pabrik3GudangZ:

c33=u3+v3740=u3+760u3=740-760=-20
GudangXGud GudangYGud
angX
angY

GudangZGu
dangZ

Supp
ly

uiui

Pabrik1Pab
680 (91)
rik1

640 (15)

660

106

u1=0u1=0

Pabrik2Pab
760
rik2

720 (107)

840 (25)

132

u2=80u2=8
0

Pabrik3Pab
800
rik3

680

740 (127)

127

u3=20u3
=-20

Demand

91

122

152

vjvj

v1=680v1=680

v2=640v2=640

v3=760v3=760

2. Find dijdij for all unoccupied cells(i,j), where dij=cij(ui+vj)dij=cij-(ui+vj)

Pabrik1GudangZ:d13=c13
(u1+v3)=660(0+760)=100Pabrik1GudangZ:d13=c13-(u1+v3)=660-(0+760)=-

100
Pabrik2GudangX:d21=c21
(u2+v1)=760(80+680)=0Pabrik2GudangX:d21=c21-(u2+v1)=760-(80+680)=0
Pabrik3GudangX:d31=c31(u3+v1)=800
(20+680)=140Pabrik3GudangX:d31=c31-(u3+v1)=800-(-20+680)=140
Pabrik3GudangY:d32=c32(u3+v2)=680
(20+640)=60Pabrik3GudangY:d32=c32-(u3+v2)=680-(-20+640)=60
GudangXGud GudangYGud
angX
angY

GudangZGu
dangZ

Supp
ly

uiui

Pabrik1Pab
680 (91)
rik1

640 (15)

660 [-100]

106

u1=0u1=0

Pabrik2Pab
760 [0]
rik2

720 (107)

840 (25)

132

u2=80u2=8
0

Pabrik3Pab
800 [140]
rik3

680 [60]

740 (127)

Demand

91

122

152

vjvj

v1=680v1=680

v2=640v2=640

v3=760v3=760

127

u3=20u3
=-20

3. Now choose the minimum negative value from all dijdij (opportunity cost)
= d13d13 = [-100]
and draw a closed path from Pabrik1GudangZPabrik1GudangZ.
Closed path
is Pabrik1GudangZPabrik1GudangYPabrik2GudangYPabrik2GudangZ
Pabrik1GudangZPabrik1GudangYPabrik2GudangYPabrik2GudangZ
Closed path and plus/minus sign allocation...
GudangXGud GudangYGud
angX
angY

GudangZGu
dangZ

Supp
ly

uiui

Pabrik1Pab
680 (91)
rik1

640 (15) (-)

660 [-100] (+)

106

u1=0u1=0

Pabrik2Pab
760 [0]
rik2

720 (107) (+)

840 (25) (-)

132

u2=80u2=8
0

Pabrik3Pab
800 [140]
rik3

680 [60]

740 (127)

127

u3=20u3
=-20

Demand

91

122

152

vjvj

v1=680v1=680

v2=640v2=640

v3=760v3=760

4. Minimum allocated value among all negative position (-) on closed path = 15
Substract 15 from all (-) and Add it to all (+)
GudangXGudang GudangYGudang
X
Y

GudangZGudan
gZ

Suppl
y

Pabrik1Pabrik
680 (91)
1

640

660 (15)

106

Pabrik2Pabrik
760
2

720 (122)

840 (10)

132

Pabrik3Pabrik
800
3

680

740 (127)

127

Demand

122

152

91

5. Repeat the step 1 to 4, until an optimal solution is obtained.

Step-2 of optimality test
1. Find uiui and vjvj for all occupied cells(i,j), where cij=ui+vjcij=ui+vj
Substituting, v3v3 = 0, we get
Pabrik1GudangZ:c13=u1+v3660=u1u1=660Pabrik1GudangZ:c13=u1+v366

0=u1u1=660
Pabrik1GudangX:c11=u1+v1680=660+v1v1=680660=20Pabrik1GudangX:c

11=u1+v1680=660+v1v1=680-660=20
Pabrik2GudangZ:c23=u2+v3840=u2u2=840Pabrik2GudangZ:c23=u2+v384

0=u2u2=840
Pabrik2GudangY:c22=u2+v2720=840+v2v2=720840=120Pabrik2Gudang

Y:c22=u2+v2720=840+v2v2=720-840=-120
Pabrik3GudangZ:c33=u3+v3740=u3u3=740Pabrik3GudangZ:c33=u3+v374

0=u3u3=740
GudangXGud GudangYGud
angX
angY
Pabrik1Pab
680 (91)
rik1

640

GudangZGu
dangZ

Supp
ly

uiui

660 (15)

106

u1=660u1=
660

Pabrik2Pab
760
rik2

720 (122)

840 (10)

132

u2=840u2=
840

Pabrik3Pab
800
rik3

680

740 (127)

127

u3=740u3=
740

Demand

91

122

152

vjvj

v1=20v1=20

v2=120v2=120

v3=0v3=0

2. Find dijdij for all unoccupied cells(i,j), where dij=cij(ui+vj)dij=cij-(ui+vj)

Pabrik1GudangY:d12=c12
(u1+v2)=640(660120)=100Pabrik1GudangY:d12=c12-(u1+v2)=640-(660-

120)=100
Pabrik2GudangX:d21=c21
(u2+v1)=760(840+20)=100Pabrik2GudangX:d21=c21-(u2+v1)=760-

(840+20)=-100
Pabrik3GudangX:d31=c31
(u3+v1)=800(740+20)=40Pabrik3GudangX:d31=c31-(u3+v1)=800-

(740+20)=40
Pabrik3GudangY:d32=c32
(u3+v2)=680(740120)=60Pabrik3GudangY:d32=c32-(u3+v2)=680-(740-

120)=60
GudangXGud GudangYGud
angX
angY

GudangZGu
dangZ

Supp
ly

uiui

Pabrik1Pab
680 (91)
rik1

640 [100]

660 (15)

106

u1=660u1=
660

Pabrik2Pab
760 [-100]
rik2

720 (122)

840 (10)

132

u2=840u2=
840

Pabrik3Pab
800 [40]
rik3

680 [60]

740 (127)

Demand

91

122

152

vjvj

v1=20v1=20

v2=120v2=120

v3=0v3=0

127

u3=740u3=
740

3. Now choose the minimum negative value from all dijdij (opportunity cost)
= d21d21 = [-100]
and draw a closed path from Pabrik2GudangXPabrik2GudangX.
Closed path
is Pabrik2GudangXPabrik2GudangZPabrik1GudangZPabrik1GudangX
Pabrik2GudangXPabrik2GudangZPabrik1GudangZPabrik1GudangX
Closed path and plus/minus sign allocation...
GudangXGud GudangYGud
angX
angY

GudangZGu
dangZ

Supp
ly

uiui

Pabrik1Pab
680 (91) (-)
rik1

640 [100]

660 (15) (+)

106

u1=660u1=
660

Pabrik2Pab
760 [-100] (+)
rik2

720 (122)

840 (10) (-)

132

u2=840u2=
840

Pabrik3Pab
800 [40]
rik3

680 [60]

740 (127)

127

u3=740u3=
740

Demand

91

122

152

vjvj

v1=20v1=20

v2=120v2=120

v3=0v3=0

4. Minimum allocated value among all negative position (-) on closed path = 10
Substract 10 from all (-) and Add it to all (+)

GudangXGudang GudangYGudang
X
Y

GudangZGudan
gZ

Suppl
y

Pabrik1Pabrik
680 (81)
1

640

660 (25)

106

Pabrik2Pabrik
760 (10)
2

720 (122)

840

132

Pabrik3Pabrik
800
3

680

740 (127)

127

Demand

122

152

91

5. Repeat the step 1 to 4, until an optimal solution is obtained.

Step-3 of optimality test
1. Find uiui and vjvj for all occupied cells(i,j), where cij=ui+vjcij=ui+vj
Substituting, u1u1 = 0, we get
Pabrik1GudangX:c11=u1+v1680=0+v1v1=680Pabrik1GudangX:c11=u1+v1

680=0+v1v1=680
Pabrik2GudangX:c21=u2+v1760=u2+680u2=760680=80Pabrik2GudangX:c

21=u2+v1760=u2+680u2=760-680=80
Pabrik2GudangY:c22=u2+v2720=80+v2v2=72080=640Pabrik2GudangY:c2

2=u2+v2720=80+v2v2=720-80=640
Pabrik1GudangZ:c13=u1+v3660=0+v3v3=660Pabrik1GudangZ:c13=u1+v3

660=0+v3v3=660
Pabrik3GudangZ:c33=u3+v3740=u3+660u3=740660=80Pabrik3GudangZ:c

33=u3+v3740=u3+660u3=740-660=80

Pabrik1Pab

GudangXGud
angX

GudangYGud
angY

GudangZGud
angZ

Suppl
uiui
y

680 (81)

640

660 (25)

106

u1=0u1=

rik1

Pabrik2Pab
rik2

760 (10)

720 (122)

840

132

u2=80u2
=80

Pabrik3Pab
rik3

800

680

740 (127)

127

u3=80u3
=80

Demand

91

122

152

vjvj

v1=680v1=680

v2=640v2=640

v3=660v3=660

2. Find dijdij for all unoccupied cells(i,j), where dij=cij(ui+vj)dij=cij-(ui+vj)

Pabrik1GudangY:d12=c12(u1+v2)=640(0+640)=0Pabrik1GudangY:d12=c12-

(u1+v2)=640-(0+640)=0
Pabrik2GudangZ:d23=c23
(u2+v3)=840(80+660)=100Pabrik2GudangZ:d23=c23-(u2+v3)=840-

(80+660)=100
Pabrik3GudangX:d31=c31
(u3+v1)=800(80+680)=40Pabrik3GudangX:d31=c31-(u3+v1)=800-

(80+680)=40
Pabrik3GudangY:d32=c32
(u3+v2)=680(80+640)=40Pabrik3GudangY:d32=c32-(u3+v2)=680-

(80+640)=-40
GudangXGud
angX

GudangYGud
angY

GudangZGud
angZ

Suppl
uiui
y

Pabrik1Pab
rik1

680 (81)

640 [0]

660 (25)

106

u1=0u1=
0

Pabrik2Pab
rik2

760 (10)

720 (122)

840 [100]

132

u2=80u2
=80

Pabrik3Pab
rik3

800 [40]

680 [-40]

740 (127)

Demand

91

122

152

vjvj

v1=680v1=680

v2=640v2=640

v3=660v3=660

127

u3=80u3
=80

3. Now choose the minimum negative value from all dijdij (opportunity cost)
= d32d32 = [-40]
and draw a closed path from Pabrik3GudangYPabrik3GudangY.
Closed path
is Pabrik3GudangYPabrik3GudangZPabrik1GudangZPabrik1GudangX
Pabrik2GudangXPabrik2GudangYPabrik3GudangYPabrik3GudangZP

abrik1GudangZPabrik1GudangXPabrik2GudangXPabrik2GudangY
Closed path and plus/minus sign allocation...
GudangXGud
angX

GudangYGud
angY

GudangZGud
angZ

Suppl
uiui
y

Pabrik1Pab
rik1

680 (81) (-)

640 [0]

660 (25) (+)

106

u1=0u1=
0

Pabrik2Pab
rik2

760 (10) (+)

720 (122) (-)

840 [100]

132

u2=80u2
=80

Pabrik3Pab
rik3

800 [40]

680 [-40] (+)

740 (127) (-)

127

u3=80u3
=80

Demand

91

122

152

vjvj

v1=680v1=680

v2=640v2=640

v3=660v3=660

4. Minimum allocated value among all negative position (-) on closed path = 81
Substract 81 from all (-) and Add it to all (+)

GudangXGudang GudangYGudang
X
Y

GudangZGudan
gZ

Suppl
y

Pabrik1Pabrik
680
1

640

660 (106)

106

Pabrik2Pabrik
760 (91)
2

720 (41)

840

132

Pabrik3Pabrik
800
3

680 (81)

740 (46)

127

Demand

122

152

91

5. Repeat the step 1 to 4, until an optimal solution is obtained.

Step-4 of optimality test
1. Find uiui and vjvj for all occupied cells(i,j), where cij=ui+vjcij=ui+vj
Substituting, u2u2 = 0, we get
Pabrik2GudangX:c21=u2+v1760=0+v1v1=760Pabrik2GudangX:c21=u2+v1

760=0+v1v1=760
Pabrik2GudangY:c22=u2+v2720=0+v2v2=720Pabrik2GudangY:c22=u2+v2

720=0+v2v2=720
Pabrik3GudangY:c32=u3+v2680=u3+720u3=680720=40Pabrik3GudangY:

c32=u3+v2680=u3+720u3=680-720=-40
Pabrik3GudangZ:c33=u3+v3740=40+v3v3=740+40=780Pabrik3GudangZ:c

33=u3+v3740=-40+v3v3=740+40=780
Pabrik1GudangZ:c13=u1+v3660=u1+780u1=660780=120Pabrik1Gudang

Z:c13=u1+v3660=u1+780u1=660-780=-120

Pabrik1Pa

GudangXGu
dangX

GudangYGud GudangZGu
angY
dangZ

Supp
ly

uiui

680

640

106

u1=120u1

660 (106)

brik1

=-120

Pabrik2Pa
brik2

760 (91)

720 (41)

840

132

u2=0u2=0

Pabrik3Pa
brik3

800

680 (81)

740 (46)

127

u3=40u3=40

Demand

91

122

152

vjvj

v1=760v1=760 v2=720v2=720

v3=780v3=78
0

2. Find dijdij for all unoccupied cells(i,j), where dij=cij(ui+vj)dij=cij-(ui+vj)

Pabrik1GudangX:d11=c11(u1+v1)=680
(120+760)=40Pabrik1GudangX:d11=c11-(u1+v1)=680-(-120+760)=40
Pabrik1GudangY:d12=c12(u1+v2)=640
(120+720)=40Pabrik1GudangY:d12=c12-(u1+v2)=640-(-120+720)=40
Pabrik2GudangZ:d23=c23
(u2+v3)=840(0+780)=60Pabrik2GudangZ:d23=c23-(u2+v3)=840-(0+780)=60
Pabrik3GudangX:d31=c31(u3+v1)=800
(40+760)=80Pabrik3GudangX:d31=c31-(u3+v1)=800-(-40+760)=80
GudangXGu
dangX

GudangYGud GudangZGu
angY
dangZ

Supp
ly

uiui

Pabrik1Pa
brik1

680 [40]

640 [40]

660 (106)

106

u1=120u1
=-120

Pabrik2Pa
brik2

760 (91)

720 (41)

840 [60]

132

u2=0u2=0

Pabrik3Pa
brik3

800 [80]

680 (81)

740 (46)

127

u3=40u3=40

Demand

91

122

152

vjvj

v1=760v1=760 v2=720v2=720

v3=780v3=78
0

Since all dij0dij0. So final optimal solution is arrived.

GudangXGudang GudangYGudang
X
Y

GudangZGudan
gZ

Suppl
y

Pabrik1Pabrik
680
1

640

660 (106)

106

Pabrik2Pabrik
760 (91)
2

720 (41)

840

132

Pabrik3Pabrik
800
3

680 (81)

740 (46)

127

Demand

122

152

91

The minimum total transportation

cost =660106+76091+72041+68081+74046=257760=660106+76091+7
2041+68081+74046=257760

Solution is provided by AtoZmath.com