UNIT II

TOPIC
TRANSPORTATION
PROBLEM
 TRANSPORTATION PROBLEM
The transportation problem is a particular class of
linear programming in which the objective is to
transport a commodity from several supply origin
to different demand destinations at a minimum
total cost.
A general transportation problem looks like:
Destinatio D1 D2 …….. Dn Availabili
n ty
Origin
C11
C12 C1n
O1 x11 …….. a1
x12 x1n
C21
C22 C2n
O2 x21 …….. a2
x22 x2n
. . . …….. . .
. . . . .
. . . . .
Cm1 Cm2 Cmn
Om …….. am
xm1 xm2 xmn
Where
ai amount of commodity available at origin to
Oi
bj amount of commodity required at destination
Dj
Cij cost of transporting one unit of commodity
from origin Oi destination Dj
xij amount of commodity to be transported from
origin Oimton destination Dj
Mathematical formulation of Transportation Problem:
i=1j=1

Min z = Σ Σ cij xij 1

subject to constraints

Σxij = ai (i = 1, 2,……., m)
2
Σxij = bj (j = 1, 2,……., n)
And xij ≥ 0
Constraints 2 and 3 are called availability constraints and
Basic terms used in T.P. :
Feasible Solution: It is a set of non-negative
individual allocation (xij ≥ 0) which satisfies
the row and column sum restrictions.
Basic Feasible Solution: A F.S. of m x n
transportation problem is said to be a basic
feasible solution if the total number of
positive allocation xij is exactly equal to m + n
– 1.
Optimal Solution: A F.S. is said to be optimal
if it minimizes the total transportation cost.
Non-Degenerate BFS: A FS of m x n TP is said
to be non degenerates BFS if total number of
positive allocation is exactly equal to m + n -
1.
HOW TO SOLVE A T.P.:
Methods to obtain an Initial
Feasible Solution

NORTH WEST VOGEL’S

LEAST COST
CORNER APPROXIMATION
METHOD METHOD METHOD

VAM is better than other two methods, since

the initial basic feasible solution obtained by
this method is either optimal or very close to
the optimal solution.
NORTH WEST CORNER METHOD:
This method does not take into account the cost of transportation
on any route of transportation. This method consists of following
steps:
Step I: Start with north-west corner (uppermost left hand corner)
of the transportation table allocate maximum possible amount to
it, so that either the capacity of row is exhausted or the destination
requirement of the first column is satisfied.
Step II:
(a) If the supply for the first row is exhausted. Then, move down
vertically to the first cell in the second row.
(b) If the demand for the first column is satisfied. Then, move right
horizontally to the second cell in the first row.
(c)If both supply in the row and demand in the column is satisfied.
Then, move diagonally.
Step III: Continuing in this way till an allocation is made in the south-
 ILLUSTRATION 1
GOODS TO BE TRANSPORTATED FROM FACTORIES A, B, C
AND D TO WAREHOUSE X, Y AND Z. THE
TRANSPORTATION COST PER UNIT CAPACITY OF THE
FACTORIES AND THE REQUIRMENTS OF THE WARHOUSE
ARE GIVEN IN THE FOLLOWING TABLE. FIND THE
DISTRIBUTION COST.
REQUIREMEN
FACTORIES A B C D T
WAREHOUSES

X 15 24 11 12 2000

Y 25 20 14 16 4000

Z 12 16 22 13 7000
300 250 350 400
CAPACITY
0 0 0 0
 SOLUTION
FACTORIES REQUIREME
A B C D NT
WAREHOUS
ES

15 24 11 12
X 2000 2000

25 20 14 16
Y 1000 2500 500 40003000500

12 16 22 13
Z 3000 4000 7000 4000
CAPACIT 300 250 3500 4000
Y 0
1000 0 3000
First we allocate maximum possible amount to the cell (1,1).
Clearly
x11 = min (2000, 3000) = 2000
Since, there is no amount left available at origin, we move down
to the cell (2,1) & allocate maximum possible amount
x21 = min (4000, 3000-2000) = 1000
Since, the requirement of the destination is completely
satisfied , we move to the cell (2,2) and allocate maximum
possible amount
x22 = min (2500, 4000-1000) = 2500.
Similarly x23 = min (3500, 500) = 500.
x33 = min (3000, 7000) = 3000.
x34 = min (4000, 4000) = 4000.
Clearly this BFS is non-degenerate, since the number of positive
allocation is 6 (=m+n-1).
Also here,
x11 = 2000, x21 = 1000, x22 = 2500, x23 = 500, x33 = 3000, x34 = 4000
The total transportation cost is:
z = c11 x11 + c21 x21 + c22 x22 + c23 x23 + c33 x33 + c34 x34
 ILLUSTRATION 2
Find the initial basic feasible solution to the following
transportation problem in which the cells contain the
transportation cost
W1 in rupees.
W2 W3 W4 Supply
F1 19 30 50 10 7
F2 70 30 40 60 10
F3 40 8 70 20 18
Demand 5 8 7 15 35
 LEAST COST METHOD
This method takes into account the minimum unit
cost of transportation for obtaining initial basic
feasible solution. This method consists of following
steps:

Step I: Select the cell with lowest cost and allocate

maximum possible amount to it; if there is a tie
make an arbitrary selection.

Step II: Delete the row or column or both which are

satisfied by the allocation.

Step III: Again search for the next lowest cost empty
cell for which demand and supply are not exhausted
and make the allocations. Repeat step I and II until
 ILLUSTRATION 3
GOODS TO BE TRANSPORTATED FROM FACTORIES A, B, C
AND D TO WAREHOUSE X, Y AND Z. THE
TRANSPORTATION COST PER UNIT CAPACITY OF THE
FACTORIES AND THE REQUIRMENTS OF THE WARHOUSE
ARE GIVEN IN THE FOLLOWING TABLE. FIND THE
DISTRIBUTION COST.

FACTORIES A B C D REQUIREMENT
WAREHOUSES

X 15 24 11 12 2000

Y 25 20 14 16 4000

Z 12 16 22 13 7000
300 250 350
CAPACITY 4000
0 0 0
 SOLUTION
FACTORIES REQUIREMEN
A B C D T
WAREHOUSE
S

15 24 11 12
X 2000 2000

25 20 14 16
Y 2500 1500 4000 2500

12 16 22 13
Z 3000 4000 7000 4000
CAPACITY 300 2500 3500 4000
0 1500 13000
First we allocate maximum possible amount to the cell (1,3).
Clearly
x13 = min (2000, 3500) = 2000
Now we allocate the maximum possible amount to the cell (3,1)
x31 = min (7000, 3000) = 3000
Similarly x34 = min (7000-3000, 4000) = 4000.
x23 = min (4000, 1500) = 1500.
x22 = min (2500, 2500) = 2500.
Clearly this BFS is degenerate, since the number of positive
allocation is 5 (< m+n-1).
Also here,
x13 = 2000, x22 = 2500, x23 = 1500, x31 = 3000, x34 = 4000
The total transportation cost is:
z = c13 x13 + c22 x22 + c23 x23 + c31 x31 + c34 x34

= 11*2000 + 20*2500 + 14*1500 + 12*3000 + 13*4000

 ILLUSTRATION 4
Find the initial basic feasible solution to the following
transportation problem in which the cells contain the
transportation cost
W1 in rupees.
W2 W3 W4 Supply
F1 19 30 50 12 7
F2 70 30 40 60 10
F3 40 10 60 20 18
Demand 5 8 7 15
(III) VOGEL’S APPROXIMATION METHOD
This is the most preferred method as initial feasible solution obtained by
this method is either optimal or very close to the optimal solution. Basic
steps in VAM are as follows:
Step I: Calculate the penalty cost i.e. the difference between the lowest
and the second lowest cost values for each row and each column.
Step II: Enter the penalty cost of each row to the right of corresponding
row and the penalty cost of each column under the corresponding
column.
Step III: Select the row or column with the largest penalty and allocate
maximum possible amount to the cell with the minimum cost in the
selected row or column.
If there are more than one largest penalty rows or columns we select
any of them arbitrarily.
Step IV: Cross out the particular row or column on which the
requirement is satisfied.
Step V: Recompute the penalty cost for each row and column for the
reduced transportation table and go to the previous steps.
Step VI: Repeat steps I to V until all the rim requirements are satisfied.
 ILLUSTRATION 5
GOODS TO BE TRANSPORTATED FROM FACTORIES A, B, C AND D
TO WAREHOUSE X, Y AND Z. THE TRANSPORTATION COST PER
UNIT CAPACITY OF THE FACTORIES AND THE REQUIRMENTS OF
THE WARHOUSE ARE GIVEN IN THE FOLLOWING TABLE. FIND
THE DISTRIBUTION COST.
A B C D REQUIREMENT
FACTORIES
WARE
HOUSES
X 15 24 11 12 2000

Y 25 20 14 16 4000

Z 12 16 22 13 7000

CAPACITY 3000 2500 3500 4000

 SOLUTION
we find the initial basic feasible solution by Vogel’s Approximation Met
FACTORIES
WAREHOUSES
A B C D REQUIREMENT
Row Penalty
X 15 24 11 12 2000
2000 1 1 - 1
Y 25 20 14 16 4000

1500 2500 2500 2 2 2 2

Z 12 16 22 13 7000

3000 2500 1500 4500 1 1 1 9

1500
CAPACITY
3000 2500 3500 4000 13000

1500 2500
CP 3 4 3 1
oe
ln 3 - 3 1
ua
ml 13 - 8 3
nt
y - - 8 3
Since the maximum penalty 4 is associated with second column and in this
column the lowest cost lies in the cell (3, 2), so we allocate maximum possible
amount .
x32 = min {7000, 2500} = 2500 to it.
Now the maximum penalty 3 is associated with cell (1,3), we allocate maximum
possible amount .
x13 = min {2000, 3500} =2000 to it.
Now the maximum penalty 13 is associated with cell (3, 1), we allocate maximum
possible amount
x31 = min {4500, 3000} = 3000 to it.
Continuing in this way we get the required feasible solution as shown in table
above.
Clearly this BFS is non-degenerate, since the number of positive allocation is 6
(=m+n-1).
Also here,
x13 = 2000, x23 = 1500, x24 = 2500, x31 = 3000, x32 = 2500, x34 = 1500
The total transportation cost is
z = c13 x13 + c23 x23 + c24 x24 + c31 x31 + c32 x32 + c34 x34
= 11*2000 + 14*3500 + 16*500 + 12*3000 + 16*2500 + 13*1500
= Rs.178500.
 ILLUSTRATION 6
A company has four plants P1, P2, P3 and P4 from which it
supplies to three markets M1, M2 and M3. Determine the
optimal transportation plan from the following data giving
the plants to market shifting costs, quantities available at
each plant and quantities required at each market.

Plant Required at
Market Market
P1 P2 P3 P4
M1 19 14 23 11 11

M2 15 16 12 21 13

M3 30 25 16 39 19
Available at
plant
6 10 12 15
 SOLUTION
Step 1: By Vogel’s method an initial BFS to the given
problem is given by:
Plant
Market
P1 P2 P3 P4
ai
19 14 23 11
M1 11 11

15 16 12 21
M2 6 3 4 13

30 25 16 39
M3 7 1 19

2 43
bj 6 10 12 15

Solution is non degenerate and total transportation cost is Rs. 710

Step 2: Check Optimality

Market
P1 P2
Plant
P3 P4
ui
19 14 23 11
M1 11 u1
15 16 12 21
M2 6 3 4 u2 = 0
30 25 16 39
M3 7 1 u3

v v1 v2 v 2 3
v4
To check the optimality first we determine a set of
valuesj ui and vj such that cij= ui + vj for each
Since second
occupied cell row
(i, j).has maximum number of positive
allocations, we choose u2 = 0, then
 c21 = u2 + v1 v1 = c21 – u2 =
15 – 0 = 15
c22 = u2 + v2 v2 = c22 – u2 =
16 – 0 = 16
c24 = u2 + v4 v4 = c24 –u2 =
21 – 0 = 21
c14 = u1 + v4 u1 = c14 – v4 =
Now we- find
11 – 21= 10 the evaluation ui + vj for each
unoccupied c32=cell
u3 +(i,
v2 j) and enter them
u3 = c32at
– vthe
2 =
25 – 16= 9
upper right corner of cell.
c33 = u3 + v3 v3 = c33 –
u3 = 16
Then – 9=
we 7 cell evaluation dij = cij – (ui + vj)
find
for each unoccupied cell (i, j) and enter
them at lower right corner.
Thus we construct the following table for
testing the optimality of initial BFS.
 Market
P1 P2
Plant
P3 P4
ui
19 5 14 6 23 -3 11
M1
14 8 26
11 u1= - 10
15 16 12 7 21
M2 6 3 5
4 u2 = 0
30 24 25 16 39 30
M3
6
7 1 9
u3 = 9

v v1 = 15 v2 = 16 v 2
=7 3
v4 = 21

Since all dij > 0, hence the current BFS is optimal.

j
Thus optimal basic feasible solution to given problem is
x14 = 11, x21 = 6, x22 = 3, x24 = 4, x32 = 7 and x33 = 12 and
Min Z = 710.
Optimal Transportation plan is:

From plant P1 transport 6 units to market M2.

From plant P2 transport 3 and 7 units to

markets M2 and M3 respectively.

From plant P3 transport 12 units to market

M3 and

From plant P4 transport 11 and 4 units to

markets M1 and M2 respectively.

 ILLUSTRATION 7
GOODS TO BE TRANSPORTATED FROM FACTORIES A, B, C AND D TO
WAREHOUSE X, Y AND Z. THE TRANSPORTATION COST PER UNIT CAPACITY
OF THE FACTORIES AND THE REQUIRMENTS OF THE WARHOUSE ARE
GIVEN IN THE FOLLOWING TABLE. FIND THE DISTRIBUTION WITH
MINIMUM COST.

A B C D REQUIREMENT
FACTORIES
WARE
HOUSES
X 15 24 11 12 2000

Y 25 20 14 16 4000

Z 12 16 22 13 7000

CAPACITY 3000 2500 3500 4000

 SOLUTION
we find the initial basic feasible solution by Vogel’s Approximation Met
FACTORIES
WAREHOUSES
A B C D REQUIREMENT
Row Penalty
X 15 24 11 12 2000
2000 1 1 - -
Y 25 20 14 16 4000

1500 2500 2500 2 2 2 2

Z 12 16 22 13 7000

3000 2500 1500 4500 1 1 1 9

1500
CAPACITY
3000 2500 3500 4000 13000

1500 2500
CP 3 4 3 1
oe
ln 3 - 3 1
ua
ml 13 - 8 3
nt
y - - 8 3
Since the maximum penalty 4 is associated with second column and in this
column the lowest cost lies in the cell (3, 2), so we allocate maximum possible
amount .
x32 = min {7000, 2500} = 2500 to it.
Now the maximum penalty 3 is associated with cell (1,3), we allocate maximum
possible amount .
x13 = min {2000, 3500} =2000 to it.
Now the maximum penalty 13 is associated with cell (3, 1), we allocate maximum
possible amount
x31 = min {4500, 3000} = 3000 to it.
Continuing in this way we get the required feasible solution as shown in table
above.
Clearly this BFS is non-degenerate, since the number of positive allocation is 6
(=m+n-1).
Also here,
x13 = 2000, x23 = 1500, x24 = 2500, x31 = 3000, x32 = 2500, x34 = 1500
The total transportation cost is
z = c13 x13 + c23 x23 + c24 x24 + c31 x31 + c32 x32 + c34 x34
= 11*2000 + 14*3500 + 16*500 + 12*3000 + 16*2500 + 13*1500
= Rs.178500.
To check the optimality first we determine a set of values u i and vj such that
cij= ui + vj for each occupied cell (i, j).

Since fourth column has maximum number of positive allocations,

we choose u3 = 0, then

c31 = u3 + v1 v1 = c31 – u3 = 12 – 0 = 12
c32 =
u3 + v2 v2 = c32 – u3 = 16 – 0 = 16
c34 =
u3 + v4 v4 = c34 –u3 = 13 – 0 = 13
c24 =
u2 + v4 u2 = c24 – v4 = 16 – 13= 3
c23 =
u2 + v3 v3 = c23 – u2 = 14 – 3= 11
c13 = u1 + v3 u1 = c14 – v4 = 11 –
11= 0
 Now we find the evaluation ui + vj for each unoccupied cell (i, j) and enter
them at the upper right corner of cell.

 Then we find cell evaluation dij = cij – (ui + vj) for each unoccupied cell (i,
j) and enter them at lower right corner.

 Thus we construct the following table for testing the optimality of initial
 A B C D
ui
FACTORIES
WARE
HOUSES

X 15 12 24 16 11 12 13
3 8 2000 -1 0
Y 25 15 20 19 14 16
10 1 1500 2500 3
Z 12 16 22 11 13
2500
11
1500 0
3000
vj 12 16 11 13
Since all d14 < 0, hence the initial BFS is NOT optimal.
Thus we improve it as follows:
FACTORIE A B C D
S

WAREHOU
SE
X 15 24 -θ
11 12
+
2000 θ
Y 25 20 14 16
+ 1500 2500
-θ
Z 12 16
θ22 13
3000 2500 1500

θ = min (2500,2000) = 2000

 FACTORIE A B C D
S
u i

WAREHOU
SE 11 15 10
X 15 24 11 12 12
4 9 1 2000
15 19
Y 25 20 14 16 16
10 1 3500 500
11
Z 12 16 22 13 13
3000 2500 11 1500
v j -1 3 -2 0
Since all dij >0, the current BFS is optimal.
Thus an optimal BFS to the given problem is:
x13 = 1500, x14 = 500, x32 = 4000, x31 = 3000, x32 = 2500, x34 =
1500; and Min Z = 176500 Rs.
 ILLUSTRATION 8
Find the optimum solution to the following transportation
problem in which the cells contain the transportation cost
in rupees. W1 W2 W3 W4 Supply
F1 19 30 50 10 7
F2 70 30 40 60 9
F3 40 8 70 20 18
Demand 5 8 7 14 34

Solution
First we find the initial basic feasible solution by Vogel’s
Approximation Method;
 Supply
19 30 50 10
5 2 7
70 30 40 60

7 2 9
40 8 70 20

8 10 18
Demand 5 8 7
here, 14
x11 = 5, x14 = 2, x23 = 7, x24 = 2, x32 = 8, x34 = 10
The total transportation cost is
z = c11 x11 + c14 x14 + c23 x23 + c24 x24 + c32 x32 + c34 x34
= 19X5 + 10X2 + 40X7 + 60X2 + 8X8 + 20X10
To check the optimality first we determine a
set of values ui and vj such that
cij= ui+vj for each occupied cell (i, j).
Since fourth column has maximum number of
positive allocations, we choose v4 = 0, then
 c14 = u1 + v4 ; u1= c14 – v4 = 10 – 0 = 10
 c24 = u2 + v4 ; u2= c24 – v4 = 60 – 0 = 60
 c34 = u3 + v4 ; u3= c34 – v4 = 20– 0 = 20
 c11 = u1 + v1 ; v1= c11 – u1 = 19 – 10 = 9
 c23 = u2 + v3 ; v3= c23 – u2 = 40 – 60 = - 20
 c32 = u3 + v2 ; v2= c32 – u3 = 8 – 20 = - 12
Now we find the evaluation u i + vj for each
unoccupied cell (i, j) and enter them at the
upper right corner of cell.
Then we find cell evaluation dij = cij – (ui + vj) for
each unoccupied cell (i, j) and enter them at
lower right corner.
Thus we construct the following table for testing i u
the
19optimality -2 BFS.
30 of initial50
- 10
10

5 2 10
32 60
70
69 30 48 40 60

7 2 60
1 -18
40 29 8 70 0 20

8 10 20
11 70
vj 9 -12 -20 0
 Clearly, d22 = - 18<0 , therefore, initial BFS is not optimal so
we improve it as follows:
Since, d22 is the only negative cell evaluation, we allocate
maximum possible amount to the unoccupied cell (2, 2) &
make necessary changes a follows:
19 30 50 10

5 2
70 30 Ө 40 60
Ө
-18
7 2
40 8 70 20

Ө
8 Ө 1
Here Ө = min {2, 8} = 2 0
Thus the new BFS obtained in this way is

19 30 50 10
5 2
70 30 40 60

2 7 2
40 8 70 20

6
8 12
10
Here,
x11 = 5, x14 = 2, x22 = 2, x23 = 7, x32 = 6, x34 = 12
The total transportation cost is
z = c11 x11 + c14 x14 + c22 x22 + c23 x23 + c32 x32 + c34 x34
= 19X5 + 10X2 + 30X2 + 40X7 + 8X6 + 20X12
= 743 Rs.
This cost is less than that of initial BFS. Thus we improve the
initial BFS.
Now proceeding as usual, we construct the following table for
testing the optimality of this improved BFS: ui
19 30 - 2 50 8 10
5 2 10
32 42
70 51 30 40 60 42
19
2 7 18
42
40 29 8 70 1820
11
6 52
12 20

vj 9 -12 -2 0

Since all dij >0, the current BFS is optimal.

Thus an optimal BFS to the given problem is:
 ILLUSTRATION 9
Is
50 20
55
30 35 25
an optimal solution of the transportation problem:
If not, modify it to obtain the optimal solution.
Available Units
6 1 9 3 70
11 5 2 8 55
10 12 4 7 90
Required Units 85 35 50 45 215
 ILLUSTRATION 11
A company has three plants at locations A, B, C
which supply to warehouses located at D, E, F, G
and H. Monthly plant capacities are 800, 500 and
900 units respectively. Monthly warehouse
requirements are 400, 400, 500, 400 and 800 units
respectively. Unit transportation cost (in Rs.) are
given below: D E F G H
A 5 8 6 6 3
B 4 7 7 6 5
C 8 4 6 6 4

Determine an optimum distribution for the company

in order to minimize the total transportation cost.
A transportation problem is said to be unbalanced if total supply is not
equal to total demand i.e.
m n

∑ ai ≠ ∑ b j
i=1 j=1

In this situation there are two cases arises.

Case I: If the total supply is more than total demand i.e.
∑ ai > ∑ b j
In this case, we introduce a dummy destination in the transportation
table. The requirement at this destination is assumed to be equal to ∑ a i
- ∑ bj.
The unit transportation cost is taken to be zero.
Case II: If the total supply is less than total demand i.e.
∑ ai < ∑ b j
In this case, we introduce a dummy origin in the transportation table. The
availability at this origin is assumed to be equal to ∑bj - ∑ai.
The unit transportation cost is taken to be zero.
Thus an unbalanced transportation problem is converted into a balanced
transportation problem which can be solved by either of North-West
Corner Method, Least Cost Method or Vogel’s Approximation Method.
Solution:
Here
Total Supply (∑ai) = 2200
and Total Demand (∑bj) = 2500
Since, ∑ ai < ∑ bj , the given problem is unbalanced.
To convert it into balanced transportation problem we
introduce a dummy row, with capacity 2500- 2200 = 300, with
transportation cost zero.
Thus, we obtain the following transportation problem.
D E F G H ai
5 8 6 6 3
A 800
4 7 7 6 5
B 500
8 4 6 6 4
C 900
0 0 0 0 0
I 300

bj 400 400 500 400 800 2500

 ILLUSTRATION 11
Find the optimum transportation cost for the
following
T.P.:Plant Market Supply
A B C D
E 11 20 7 8 50
F 21 16 10 12 40
G 8 12 18 19 70
Demand 30 25 35 40

Solution:
Here
Total Supply (∑ai) = 160
and Total Demand (∑bj) = 130
Since, ∑ ai > ∑ bj , the given problem is unbalanced.
To convert it into balanced transportation problem we introduce
a dummy market E, with demand 160- 130 = 30, such that the
unit transportation cost from each plant to market is equal to
zero.
 Market
Plant Supply
A B C D E

X 11 20 7 8 0 50

Y 21 16 10 12 0 40

Z 8 12 18 19 0 70

Deman
d
30 25 35 40 30 160
 ILLUSTRATION 11
Find the basic feasible solution of the following
transportation problem by north - west corner rule.
Also find the transportation plan.

1 2 3 4 5 ai
A 4 3 1 2 6 80
B 5 2 3 4 5 60
C 3 5 6 3 2 40
D 2 4 4 5 3 20
bj 60 60 30 40 10 200
 ILLUSTRATION 13
A departmental store wishes to purchase the following
quantities of dresses.
Dress Type A B C D E
Quantity 150 100 75 205 200
Tenders are submitted by four different manufacturers who
undertake to supply not more than the quantities as:
Manufacturers X Y Z W
Quantity 250 150 200 300
The estimated profits (in Rs.) per dress is given in the profit
matrix:
A B C D E
X 6.00 6.25 7.50 4.75 4.00
Y 5.50 6.50 7.75 5.00 4.25
Z 6.25 5.75 7.00 5.50 4.75
W 5.75 6.50 7.25 5.25 4.50

How should the orders to be placed to maximize the profit?

 ILLUSTRATION 14
A company has factories at four places, which
supply warehouses A, B, C, D and E. Monthly
factory capacities are 200, 175, 150 and 325
units respectively. Monthly warehouse
requirements are 110, 90, 120, 230 and 160
units respectively. Unit shipping costs are
given in table below. The costs are in rupees.
To
A B C D E
From
1 13 -- 31 8 20
2 14 9 17 6 10
3 25 11 12 17 15
4 10 21 13 -- 17
Shipment from 1 to B and from 4 to D is not
possible. Determine the optimum distribution