Unbalanced Transportation

Problem
Unbalanced Transportation Problem

Since, demand and supply are not equal, the transportation problem is
called unbalanced transportation problem.
When Demand Exceeds Supply:
When total supply is less than total demand, introduce a dummy row
in the transportation table to account for the excess demand quantity. The
distribution unit costs of transporting from this origin to any destination
are all set equal to zero.

Project A B C Plant
(To) Capacity
Plant (From)
W 4 8 24 90
X 8 4 8 60
Supply
Y 16 4 16 30
Project 45 75 70 180
Requirement 190

Demand
When Demand Exceeds Supply:
When total supply is less than total demand, introduce a dummy row
in the transportation table to account for the excess demand quantity. The
distribution unit costs of transporting from this origin to any destination
are all set equal to zero.
Now, It is
Project A B C Plant
(To) Capacity balanced
Plant (From)
transportation
W 4 8 24 90
problem.
X 8 4 8 60
Hence finding
Y 16 4 16 30
Dummy Row 0 0 0 10 initial solution
Project 45 75 70 190 and optimality
Requirement 190
procedure is
same.
When Supply Exceeds Demand:
When total supply is greater than total demand, introduce
a dummy column in the transportation table to account for the excess
demand quantity. The distribution unit costs of transporting from this
origin to any destination are all set equal to zero.

Project A B C Plant
(To) Capacity
Plant (From)
W 4 8 24 90
X 8 4 8 60
Supply
Y 16 4 16 40
Project 45 75 60 190
Requirement 180

Demand
When Supply Exceeds Demand:
When total supply is greater than total demand, introduce
a dummy column in the transportation table to account for the excess
demand quantity. The distribution unit costs of transporting from this
origin to any destination are all set equal to zero.
Now, It is
Project A B C Dummy Plant
Column Capacity balanced
Plant (To)
(From) transportation
problem.
W 4 8 24 0 90
X 8 4 8 0 60 Hence finding

Y 16 4 16 0 40 initial solution
Project 45 75 60 10 190 and optimality
Requireme 190
nt procedure is
same.
Maximization Transportation Problem:

Mostly transportation problem is related with minimization of costs. But,

sometimes, there may be the case in which we use transportation technique
to maximize the profit, return, revenue etc.
Under this method, the profit matrix is converted into a loss matrix by
subtracting all the elements of profit from the highest element of profit in
the given matrix and the resulting matrix becomes the minimization
transportation problem.
The optimal solution is preceded with the principle of minimization
objective discussed earlier. After the allocations, however, the
corresponding profit elements are multiplied by the allocated quantities to
arrive at the maximum possible profit.
Example:
Find the optimum solution to the transportation with the following profit
matrix and determine the corresponding profit.

Project A B C Plant
(To) Capacity
Plant (From)
W 12 8 5 1700
X 11 15 10 2500
Y 2 17 6 1000
Project 1300 2000 1900 5200
Requirement
Solution :
Project (To) A B C Plant
In order to solve the
Capacit
Plant (From) y maximization

W 12 8 5 1700 transportation problem, the

X 11 15 10 2500 given table should be
Y 2 17 6 1000
converted into the regret
Project 1300 2000 1900 5200
Requirement table by subtracting each
Regret Table : element from the
Project (To) A B C Plant maximum element 17.
Capacit
Plant (From) y Then, we get regret table.
W 17-12 =5 1700
X 2500
Y 1000
Project 1300 2000 1900 5200
Requirement
Solution :
In order to solve the
Project (To) A B C Plant maximization
Capacit
Plant (From) y transportation problem, the
given table should be
W 12 8 5 1700 converted into the regret
X 11 15 10 2500 table by subtracting each
Y 2 17 6 1000 element from the
Project 1300 2000 1900 5200 maximum element 17.
Requirement Then, we get regret table.
Regret Table :
Project (To) A B C Plant
Capacity
Plant (From)

W 17-12 =5 17-8 =9 1700

X 2500
Y 1000
Project 1300 2000 1900 5200
Requirement
Solution :
In order to solve the
Project (To) A B C Plant maximization
Capacit
Plant (From) y transportation problem, the
given table should be
W 12 8 5 1700 converted into the regret
X 11 15 10 2500 table by subtracting each
Y 2 17 6 1000 element from the
Project 1300 2000 1900 5200 maximum element 17.
Requirement Then, we get regret table.
Regret Table :
Project (To) A B C Plant
Capacity
Plant (From)

W 17-12 =5 17-8 =9 17-5 = 12 1700

X 2500
Y 1000
Project 1300 2000 1900 5200
Requirement
Solution :
In order to solve the
Project (To) A B C Plant maximization
Capacit
Plant (From) y transportation problem, the
given table should be
W 12 8 5 1700 converted into the regret
X 11 15 10 2500 table by subtracting each
Y 2 17 6 1000 element from the
Project 1300 2000 1900 5200 maximum element 17.
Requirement Then, we get regret table.
Regret Table :
Project (To) A B C Plant
Capacity
Plant (From)

W 17-12 =5 17-8 =9 17-5 = 12 1700

X 17-11 =6 2500
Y 1000
Project 1300 2000 1900 5200
Requirement
Solution :
In order to solve the
Project (To) A B C Plant maximization
Capacit
Plant (From) y transportation problem, the
given table should be
W 12 8 5 1700 converted into the regret
X 11 15 10 2500 table by subtracting each
Y 2 17 6 1000 element from the
Project 1300 2000 1900 5200 maximum element 17.
Requirement Then, we get regret table.
Regret Table :
Project (To) A B C Plant
Capacity
Plant (From)

W 17-12 =5 17-8 =9 17-5 = 12 1700

X 17-11 =6 17-15 =2 2500
Y 1000
Project 1300 2000 1900 5200
Requirement
Solution :
In order to solve the
Project (To) A B C Plant maximization
Capacit
Plant (From) y transportation problem, the
given table should be
W 12 8 5 1700 converted into the regret
X 11 15 10 2500 table by subtracting each
Y 2 17 6 1000 element from the
Project 1300 2000 1900 5200 maximum element 17.
Requirement Then, we get regret table.
Regret Table :
Project (To) A B C Plant
Capacity
Plant (From)

W 17-12 =5 17-8 =9 17-5 = 12 1700

X 17-11 =6 17-15 =2 17-10 =7 2500
Y 1000
Project 1300 2000 1900 5200
Requirement
Solution :
In order to solve the
Project (To) A B C Plant maximization
Capacit
Plant (From) y transportation problem, the
given table should be
W 12 8 5 1700 converted into the regret
X 11 15 10 2500 table by subtracting each
Y 2 17 6 1000 element from the
Project 1300 2000 1900 5200 maximum element 17.
Requirement Then, we get regret table.
Regret Table :
Project (To) A B C Plant
Capacity
Plant (From)

W 17-12 =5 17-8 =9 17-5 = 12 1700

X 17-11 =6 17-15 =2 17-10 =7 2500
Y 17-2= 15 1000
Project 1300 2000 1900 5200
Requirement
Solution :
In order to solve the
Project (To) A B C Plant maximization
Capacit
Plant (From) y transportation problem, the
given table should be
W 12 8 5 1700 converted into the regret
X 11 15 10 2500 table by subtracting each
Y 2 17 6 1000 element from the
Project 1300 2000 1900 5200 maximum element 17.
Requirement Then, we get regret table.
Regret Table :
Project (To) A B C Plant
Capacity
Plant (From)

W 17-12 =5 17-8 =9 17-5 = 12 1700

X 17-11 =6 17-15 =2 17-10 =7 2500
Y 17-2= 15 17-17 =0 1000
Project 1300 2000 1900 5200
Requirement
Solution :
In order to solve the
Project (To) A B C Plant maximization
Capacit
Plant (From) y transportation problem, the
given table should be
W 12 8 5 1700 converted into the regret
X 11 15 10 2500 table by subtracting each
Y 2 17 6 1000 element from the
Project 1300 2000 1900 5200 maximum element 17.
Requirement Then, we get regret table.
Regret Table :
Project (To) A B C Plant
Capacity
Plant (From)

W 17-12 =5 17-8 =9 17-5 = 12 1700

X 17-11 =6 17-15 =2 17-10 =7 2500
Y 17-2= 15 17-17 =0 17-6 = 11 1000
Project 1300 2000 1900 5200
Requirement
 Project (To) A B C Plant
Capacity
Plant (From)

W 5 9 12 1700
X 6 2 7 2500
Y 15 0 11 1000
Project 1300 2000 1900 5200
Requirement

NOTE: After Optimality procedure is done then the very first table to
be used for the calculation.