Module III Transportation

Transportation Problems
1 b1
a1 1
2 b2
a2 2
3 b3
a3 3
4 b4
ai
Dr. Jignesh Thaker bj
Standard Interpretation of Transportation Model
𝑛
=
𝑋𝑖𝑗 ≤ 𝑎𝑖
𝑚 𝑛 =
𝑗=1
𝑚 𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝐶𝑖𝑗 𝑋𝑖𝑗 𝑎𝑖 ≥ 𝑏𝑗
=
𝑖=1 𝑗=1
𝑋𝑖𝑗 ≥ 𝑏𝑗
𝑖=1 Dr. Jignesh
𝑋𝑖𝑗 ≥ 0 Thaker𝐶𝑖𝑗 ≥ 0
Solution of Transportation Problems
Dr. Jignesh Thaker

Identifying Basic Feasible Solution
Cost of Transportation (Cij)

4 6 8 8
20 20 40 20
6 8 6 7
10 50 60 50 Supply (ai)
5 7 6 8
50 50
20 30 50 50 150
10
4*20 + 6*20 + 8*10 + 6*50 + 8*50
Dr. Jignesh Thaker
Demand (bj)
980

4 6 8 8
20 20 40 20
6 8 6 7
50 10 60 10 Supply (ai)
5 7 6 8
10 40 50 40
20 30 50 50 150
10 40
4*20 + 6*20 + 6*50 + 7*20 + 8*40
Dr. Jignesh Thaker
Demand (bj)
960

4 6 8 8
20 20 40 20 2
6 8 6 7
10 50 60 10 0 1 Supply (ai)
5 7 6 8
10 40 50 40 1 2
20 30 50 50 150
10 10
1 1 0 1 4*20 + 6*20 + 6*10 + 7*50 + 7*10
Dr. Jignesh Thaker
Demand (bj) + 6*40 920

4 6 8 8
20 20 40 20 2
6 8 6 7
50 10 60 10 0 1 Supply (ai)
5 7 6 8
10 40 50 40 1 1
20 30 50 50 150
10 40
1 1 0 1 4*20 + 6*20 + 6*50 + 7*10 + 7*10
Dr. Jignesh Thaker
Demand (bj) + 8*40 960
Basic Feasible Solution to a Transportation Problem
Dr. Jignesh Thaker

4 6 8 8
10 30 40
6 8 6 7
4 6 8 8
50 10 60
9 (-1) 31 (+1) 40
5 7 6 8
50 6 8 6 7
10 30 10
50 10 60
20 30 50 50
5 7 6 8
11 (+1) 30 9 (-1) 50
Dr. Jignesh20Thaker
30 50 50
4 6 8 8
10 30 40
6 8 6 7
4 6 8 8
50 10 60
11 (+1) 29 (-1) 40
5 7 6 8
50 6 8 6 7
10 30 10
50 10 60
20 30 50 50
5 7 6 8
9 (-1) 30 11 (+1) 50
Dr. Jignesh20Thaker
30 50 50
Basic Feasible Solution to a Transportation Problem
Dr. Jignesh Thaker

Degenerate Basic Feasible Solutions
4 6 8 8
10 30 40
6 8 6 7
10 30 20 60 4 6 8 8
20 20 40
5 7 6 8
50 50 6 8 6 7
30 30 60
20 30 50 50
5 7 6 8
50 50
Dr. Jignesh20Thaker
30 50 50
Degenerate Basic Feasible Solutions
4 6 8 8
10 30 40
6 8 6 7
10 30 20 60 4 6 8 8
20 ε 20 40
5 7 6 8
50 50 6 8 6 7
30 30 60
20 30 50 50
5 7 6 8
50 50
Dr. Jignesh20Thaker
30 50 50
Optimal Feasible Solution
4 6 8 8 4 6 8 8
20 20 40 20 20 +1
40
-1
6 8 6 7 6 8 6 7
50 10 60 50 10 60
-1 +1
5 7 6 8 5 7 6 8
10 40 50 10 40 50
+1 -1
20 30 50 50 20 30 50 50
4*20 + 6*20 + 6*50 + 7*10 +

7*10 + 8*40
960
Dr. Jignesh Thaker X13 increase of 2
4 6 8 8 4 6 8 8
20 20 40 20 20 40
+1
-1
6 8 6 7 6 8 6 7
50 10 60 50 10 60
5 7 6 8 5 7 6 8
10 40 50 10 40 50
+1 -1
20 30 50 50 20 30 50 50
4*20 + 6*20 + 6*50 + 7*10 +

7*10 + 8*40
960
4 6 8 8 4 6 8 8
20 20 40 20 20 40
-1 +1
6 8 6 7 6 8 6 7
50 10 60 +1 50 10 60
-1
5 7 6 8 5 7 6 8
10 40 50 10 40 50
-1 +1
20 30 50 50 20 30 50 50
4*20 + 6*20 + 6*50 + 7*10 +

7*10 + 8*40
960
4 6 8 8 4 6 8 8
20 20 40 20 20 40
6 8 6 7 6 8 6 7
50 10 60 +1 50 10 60
-1
5 7 6 8 5 7 6 8
10 40 50 10 40 50
-1 +1
20 30 50 50 20 30 50 50
4*20 + 6*20 + 6*50 + 7*10 +

7*10 + 8*40
960
4 6 8 8 4 6 8 8
20 20 40 20 20 40
-1 +1
6 8 6 7 6 8 6 7
50 10 60 50 10 60
5 7 6 8 5 7 6 8
10 40 50 +1 -110 40 50
20 30 50 50 20 30 50 50
4*20 + 6*20 + 6*50 + 7*10 +

7*10 + 8*40
960
4 6 8 8 4 6 8 8
20 20 40 20 20 40
6 8 6 7 6 8 6 7
50 10 60 50 10 60
-1 +1
5 7 6 8 5 7 6 8
10 40 50 10 +1 40 50
-1
20 30 50 50 20 30 50 50
4*20 + 6*20 + 6*50 + 7*10 +

7*10 + 8*40
960
Dr. Jignesh Thaker X33 decrease of 1
4 6 8 8 4 6 8 8
20 20 40 20 20 40
6 8 6 7 6 8 6 7
50 - θ 10 + θ 60 10 50 60
5 7 6 8 5 7 6 8
10 θ 40 - θ 50 10 40 50
20 30 50 50 20 30 50 50
X13 increase of 2
X14 increase of 1
X21 increase of 2 4*20 + 6*20 + 6*10 + 7*50 +
X22 increase of 2 7*10 + 6*40
Dr. Jignesh Thaker
X31 increase of 0
X33 decrease of 1 920
4 6 8 8 4 6 8 8
20 20 +1 40 20 20 +1 40
-1 -1
6 8 6 7 6 8 6 7
10 50 60 10 50 60
+1 -1
5 7 6 8 5 7 6 8
10 40 50 10 40 50
+1 -1 +1 -1
20 30 50 50 20 30 50 50
X13 increase of 3 X14 increase of 2

Dr. Jignesh Thaker
4 6 8 8 4 6 8 8
20 20 40 20 20 40
-1 +1
6 8 6 7 6 8 6 7
+1 10 50 60 +1 10 50 60
-1 -1
5 7 6 8 5 7 6 8
10 40 50 10 40 50
-1 +1 -1 +1
20 30 50 50 20 30 50 50

Dr. Jignesh Thaker
4 6 8 8 4 6 8 8
20 20 40 20 20 40
-1 +1
6 8 6 7 6 8 6 7
10 50 60 10 50 60
+1 -1
5 7 6 8 5 7 6 8
+1 10 40 50 10 40 +1 50
-1 -1
20 30 50 50 20 30 50 50

Dr. Jignesh Thaker
4 6 8 8 4 6 8 8
20 - θ 20 + θ 40 10 30 40
6 8 6 7 6 8 6 7
10 50 60 10 50 60
5 7 6 8 5 7 6 8
θ 10 - θ 40 50 10 40 50
20 30 50 50 20 30 50 50
X13 increase of 3
X14 increase of 2
4*10 + 6*30 + 6*10 + 7*50 +
X21 increase of 1
X22 increase of 1
5*10 + 6*40 920
X31
X34
increase
increase Dr. Jignesh Thaker
of
of
0
1
v1 = 4 v2 = 6 v3 = 6 v4 = 7
4 6 8 8
u1 = 0 20 20 40
(2) (1)
6 8 6 7
u2 = 0 50 10 60
(2) (2)
5 7 6 8
u3 = 1 10 40 50
(0) (-1)
20 30 50 50 X13 increase of 2
X14 increase of 1
4*20 + 6*20 + 6*50 + 7*10 + X21 increase of 2
X22 increase of 2
7*10 + 8*40
Dr. Jignesh Thaker
X31 increase of 0
960 X33 decrease of 1
4 6 8 8 4 6 8 8
20 20 40 20 20 40
6 8 6 7 6 8 6 7
50 - θ 10 + θ 60 10 50 60
5 7 6 8 5 7 6 8
10 θ 40 - θ 50 10 40 50
20 30 50 50 20 30 50 50
X13 increase of 2
X14 increase of 1
X21 increase of 2 4*20 + 6*20 + 6*10 + 7*50 +
X22 increase of 2 7*10 + 6*40
Dr. Jignesh Thaker
X31 increase of 0
v1 = 4 v2 = 6 v3 = 5 v4 = 6
4 6 8 8
u1 = 0 20 20 40
(3) (2)
6 8 6 7
u2 = 1 10 50 60
(1) (1)
5 7 6 8
u3 = 1 10 40 50
(0) (1)
20 30 50 50 X13 increase of 2
X14 increase of 1
4*20 + 6*20 + 6*10 + 7*50 + X21 increase of 2
X22 increase of 2
7*10 + 6*40
Dr. Jignesh Thaker
X31 increase of 0
920 X34 increase of 1
4 6 8 8 4 6 8 8
20 - θ 20 + θ 40 10 30 40
6 8 6 7 6 8 6 7
10 50 60 10 50 60
5 7 6 8 5 7 6 8
θ 10 - θ 40 50 10 40 50
20 30 50 50 20 30 50 50
X13 increase of 3
X14 increase of 2
4*10 + 6*30 + 6*10 + 7*50 +
X21 increase of 1
X22 increase of 1
5*10 + 6*40 920
X31
X34
increase
of
of
0
1
Optimal Feasible Solution (Degenerate)
v1 = 4 v2 = 6 v3 = 4 v4 = 6
4 6 8 8
u1 = 0 20 20 40
(4) (2)
6 8 6 7
u2 = 2 10 50 60
(0) (-1)
5 7 6 8
u3 = 2 ε 50 50
(-1) (-1)
20 30 50 50 X13 increase of 4
X14 increase of 2
4*20 + 6*20 + 6*50 + 8*10 + X21 increase of 0
X24 decrease of 1
8*50
Dr. Jignesh Thaker
X31 decrease of 1
4 6 8 8 4 6 8 8
20 20 40 20 20 40
6 8 6 7 6 8 6 7
10 - θ 50 + θ 60 10 - ε 50 + ε 60
5 7 6 8 5 7 6 8
θ ε-θ 50 50 ε 50 50
20 30 50 50 20 30 50 50
X13 increase of 4
X14 increase of 2
X21 increase of 0 4*20 + 6*20 + 8*10 + 6*50 +
X24 decrease of 1 8*50
Dr. Jignesh Thaker
X31 decrease of 1
980
X32 decrease of 1
v1 = 4 v2 = 6 v3 = 4 v4 = 7
4 6 8 8
u1 = 0 20 20 40
(4) (1)
6 8 6 7
u2 = 2 10 50 60
(0) (-2)
5 7 6 8
u3 = 1 ε 50 50
(0) (1)
20 30 50 50 X13 increase of 4
X14 increase of 1
4*20 + 6*20 + 6*50 + 8*10 + X21 increase of 0
X24 decrease of 2
8*50
Dr. Jignesh Thaker
X31 increase of 0
4 6 8 8 4 6 8 8
20 20 40 20 20 40
6 8 6 7 6 8 6 7
10-θ 50 θ 60 50 10 60
5 7 6 8 5 7 6 8
ε+θ 50-θ 50 10 40 50
20 30 50 50 20 30 50 50
X13 increase of 4
X14 increase of 1
X21 increase of 0 4*20 + 6*20 + 6*50 + 7*10 +
X24 decrease of 2 7*10 + 8*40
Dr. Jignesh Thaker
X31 increase of 0
960
X33 increase of 1
v1 = 4 v2 = 6 v3 = 6 v4 = 7
4 6 8 8
u1 = 0 20 20 40
(2) (1)
6 8 6 7
u2 = 0 50 10 60
(2) (2)
5 7 6 8
u3 = 1 10 40 50
(0) (-1)
20 30 50 50 X13 increase of 2
X14 increase of 1
4*20 + 6*20 + 6*50 + 7*10 + X21 increase of 2
X22 increase of 2
7*10 + 8*40
Dr. Jignesh Thaker
X31 increase of 0
4 6 8 8 4 6 8 8
20 20 40 20 20 40
6 8 6 7 6 8 6 7
50 - θ 10 + θ 60 10 50 60
5 7 6 8 5 7 6 8
10 θ 40 - θ 50 10 40 50
20 30 50 50 20 30 50 50
X13 increase of 2
X14 increase of 1
X21 increase of 2 4*20 + 6*20 + 6*10 + 7*50 +
X22 increase of 2 7*10 + 6*40
Dr. Jignesh Thaker
X31 increase of 0
v1 = 4 v2 = 6 v3 = 5 v4 = 6
4 6 8 8
u1 = 0 20 20 40
(3) (2)
6 8 6 7
u2 = 1 10 50 60
(1) (1)
5 7 6 8
u3 = 1 10 40 50
(0) (1)
20 30 50 50 X13 increase of 2
X14 increase of 1
4*20 + 6*20 + 6*10 + 7*50 + X21 increase of 2
X22 increase of 2
7*10 + 6*40
Dr. Jignesh Thaker
X31 increase of 0
4 6 8 8 4 6 8 8
20 - θ 20 + θ 40 10 30 40
6 8 6 7 6 8 6 7
10 50 60 10 50 60
5 7 6 8 5 7 6 8
θ 10 - θ 40 50 10 40 50
20 30 50 50 20 30 50 50
X13 increase of 3
X14 increase of 2
4*10 + 6*30 + 6*10 + 7*50 +
X21 increase of 1
X22 increase of 1
5*10 + 6*40 920
X31
X34
increase
of
of
0
1
Transportation Problems (Special Issues)
𝑚 𝑛
4 6 8 8
10 30 40
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝐶𝑖𝑗 𝑋𝑖𝑗
𝑛 𝑖=1 𝑗=1 6 8 6 7
= 60
𝑋𝑖𝑗 ≤ 𝑎𝑖 10 50
𝑗=1 5 7 6 8
𝑋11 + 𝑋12 + 𝑋13 + 𝑋14 = 40 10 40 50
𝑋21 + 𝑋22 + 𝑋23 + 𝑋24 = 60

20 30 50 50
𝑋31 + 𝑋32 + 𝑋33 + 𝑋34 = 50
𝑚 𝑋11 + 𝑋21 + 𝑋31 = 20
=
𝑋𝑖𝑗 ≥ 𝑏𝑗 𝑋12 + 𝑋22 + 𝑋32 = 30
𝑋13 + 𝑋23 + 𝑋33 = 50
Dr. Jignesh Thaker
𝑖=1
𝐶𝑖𝑗 ≥ 0 𝑋𝑖𝑗 ≥ 0 𝑋14 + 𝑋24 + 𝑋34 = 50
𝑚 𝑛 𝑚 𝑛
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝐶𝑖𝑗 𝑋𝑖𝑗 𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑎𝑖 𝑢𝑖 + 𝑏𝑗 𝑣𝑗

𝑛 𝑖=1 𝑗=1 𝑖=1 𝑗=1
= =
𝑋𝑖𝑗 ≤ 𝑎𝑖 𝑢𝑖 + 𝑣𝑗 ≤ 𝐶𝑖𝑗
𝑗=1
𝑋11 + 𝑋12 + 𝑋13 + 𝑋14 = 40 𝑢1 𝑢𝑖 𝑎𝑛𝑑 𝑣𝑗 𝑎𝑟𝑒 𝑢𝑛𝑟𝑒𝑠𝑡𝑟𝑖𝑐𝑡𝑒𝑑
𝑋21 + 𝑋22 + 𝑋23 + 𝑋24 = 60 𝑢2
𝑋31 + 𝑋32 + 𝑋33 + 𝑋34 = 50 𝑢3
𝑚 𝑋11 + 𝑋21 + 𝑋31 = 20 𝑣1
=
𝑋𝑖𝑗 ≥ 𝑏𝑗 𝑋12 + 𝑋22 + 𝑋32 = 30 𝑣2
𝑋13 + 𝑋23 + 𝑋33 = 50 𝑣3
Dr. Jignesh Thaker
𝑖=1
𝐶𝑖𝑗 ≥ 0 𝑋𝑖𝑗 ≥ 0 𝑋14 + 𝑋24 + 𝑋34 = 50 𝑣4
4 6 8 8 4 6 8 8
10 30 30 10 30 30
6 8 6 7 6 8 6 7
10 50 60 10 50 60
5 7 6 8 5 7 6 8
10 40 50 10 40 50
20 30 50 50 0 0 0 0
10
This problem is unbalanced
because the total supply 20 30 50 50
(140) is less than total
demand (150)
Dr. Jignesh Thaker
• Convert this unbalanced problem to 4 6 8 8

a balanced problem by adding an 30
extra supply (row) with 10 units 10 30
(called dummy row).
• Cost of transportation from this 6 8 6 7
dummy row to all the columns is 10 50 60
zero.
• Now, it can be solved using balanced
5 7 6 8
transportation problem methodology.
• Whichever the demand points are 10 40 50
allotted from the dummy will not get
the 10 units and will be 10 units 0 0 0 0
short. 10
• Ensure that the existing 140 units
have been distributed to the demand 20 30 50 50
points at minimum cost.
The dummy is a virtual supply point with nonexistent 10 units and has
Dr. Jignesh Thaker
zero cost of transportation from the real demand points
4 6 8 8 4 6 8 8 0
10 30 40 10 30 40
6 8 6 7 6 8 6 7 0
10 50 60 10 50 60
5 7 6 8 5 7 6 8 0
10 40 50 10 40 50
20 30 50 30 20 30 30 30 20
This problem is unbalanced Convert this unbalanced problem
because the total supply to a balanced problem by adding
(150) is less than total an extra demand (column) with
demand (130) 30 units (called dummy row)
Dr. Jignesh Thaker
• Always start to solve the transportation problems considering

minimization of objective function.
• If the objective function is to maximize, it is customary to change the
sign of the objective function coefficient (by making them negative)
and solve the resultant problem as a minimization problem (as done
in Simplex Method).
• Otherwise, it has to modify the rules of North West Corner, Minimum
Cost, VAM, Stepping Stone and MODI method which is not desirable.
• Transportation is linear programming where demand and supply are
always considered integer values and as a results basic feasible
Dr. Jignesh Thaker

solution or optimal feasible solution also having the integer values.

Module III Transportation

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Module III Transportation

Uploaded by

Copyright:

Available Formats

Transportation Problems

Dr. Jignesh Thaker

Cost of Transportation (Cij)

Cost of Transportation (Cij)

Cost of Transportation (Cij)

Cost of Transportation (Cij)

Dr. Jignesh Thaker

Dr. Jignesh Thaker

4*20 + 6*20 + 6*50 + 7*10 +

4*20 + 6*20 + 6*50 + 7*10 +

4*20 + 6*20 + 6*50 + 7*10 +

4*20 + 6*20 + 6*50 + 7*10 +

4*20 + 6*20 + 6*50 + 7*10 +

4*20 + 6*20 + 6*50 + 7*10 +

X13 increase of 3 X14 increase of 2

X21 increase of 1 X22 increase of 1

X31 increase of 0 X34 increase of 1

𝑋21 + 𝑋22 + 𝑋23 + 𝑋24 = 60

𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝐶𝑖𝑗 𝑋𝑖𝑗 𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑎𝑖 𝑢𝑖 + 𝑏𝑗 𝑣𝑗

• Convert this unbalanced problem to 4 6 8 8

• Always start to solve the transportation problems considering

Dr. Jignesh Thaker

You might also like

420 + 620 + 650 + 710 +

420 + 620 + 650 + 710 +

420 + 620 + 650 + 710 +

420 + 620 + 650 + 710 +

420 + 620 + 650 + 710 +

420 + 620 + 650 + 710 +