research

the mathematical model of the transportation problem

min Z = 50Xs1d1 + 75Xs1d2 + 30Xs1d3 + 45Xs1d4 + 65Xs2d1 + 80Xs2d2 + 40Xs2d3 +
60Xs2d4 + 40Xs3d1
+ 70Xs3d2 + 50Xs3d3 + 55Xs3d4
subject to constraints
Xs1d1 + Xs1d2 + Xs1d3 + Xs1d4 = 12
Xs2d1 + Xs2d2 + Xs2d3 + Xs2d4 = 17
Xs3d1 + Xs3d2 + Xs3d3 + Xs3d4 = 11
Xs1d1 + Xs1d1 + Xs1d1 = 10
Xs1d2 + Xs1d2 + Xs1d2 = 10
Xs1d3 + Xs1d3 + Xs1d3 = 10
Xs1d4 + Xs1d4 + Xs1d4 = 10
Xij = 0
Total Cost: (10*40) + (9*80) + (1*70) + (10*30) + (2*45) + (8*60) = $ 2 060
methods of determining the optimum solution for the problem
I) North-West Corner method (NWCM)
The North West corner rule is a method for computing a basic feasible solution of a
Transportation
problem where the basic variables are selected from the North �West corner (i.e.,
top left corner).
Steps
1. Select the north west (upper left-hand) corner cell of the transportation table
and allocate as
many units as possible equal to the minimum between available supply and demand
requirements,
i.e. min(s1,d1).
2. Adjust the supply and demand numbers in the respective rows and columns
allocation.
3. If the supply for the first row is exhausted then move down to the first cell in
the second row.
4. If the demand for the first cell is satisfied then move horizontally to the next
cell in the second
column.
5. If for any cell supply equals demand, then the next allocation can be made in
cell either in the
next row or column.
6. Continue the procedure until the total available quantity is fully allocated to
the cells as required.
(II) Least Cost Method (LCM)
Matrix minimum method is a method for computing a basic feasible solution of a
transportation
problem where the basic variables are chosen according to the unit cost of
transportation.
Steps
1. Identify the box having minimum unit transportation cost (cij).
2. If there are two or more minimum costs, select the row and the column
corresponding to the
lower numbered row.
3. If they appear in the same row, select the lower numbered