Easwari Engineering College: Department of Management Studies
Easwari Engineering College: Department of Management Studies
source
b. If the supply is 0, then cross (strike) that row 1 3 1 7 4 300
and move down to the next cell
c. If the demand is 0, then cross (strike) that column 2 2 6 5 9 400
and move right to the next cell
d. If supply and demand both are 0, then cross (strike) 3 8 3 3 2 500
both row & column and move diagonally to the next
cell
demand 250 350 400 200 1200
• Step 3: Repeat this steps until all supply and demand
values are 0.
Least Cost Method
• Step 1: Select the cell having minimum unit cost and allocate as much as possible,
i.e. min(, ).
• Step 2:
a) Subtract this min value from supply and demand
•
b) If the supply is 0, then cross (strike) that row and If the demand is 0 then cross
(strike) that column.
c) If min unit cost cell is not unique, then select the cell where maximum allocation can
be possible
• Step 3: Repeat this steps for all uncrossed (unstriked) rows and columns until all
supply and demand values are 0.
Vogel’s Approximation Method
• Step 1: Find the cells having smallest and next to smallest cost in each row and
write the difference (called penalty) along the side of the table in row penalty
• Step 2: Find the cells having smallest and next to smallest cost in each column and
write the difference (called penalty) along the side of the table in each column penalty.
• Step 3: Select the row or column with the maximum penalty and find cell that has least
cost in selected row or column. Allocate as much as possible in this cell.
If there is a tie in the values of penalties then select the cell where
maximum allocation can be possible.
• Step 4: Adjust the supply & demand and cross out (strike out) the satisfied row or
column.
• Step 5: Repeat this steps until all supply and demand values are 0.
Obtaining the optimal basic solution:
MODI Method
• Step 1: Find an initial basic feasible solution using any one of the three methods
NWCM, LCM or VAM
• Step 2: Find and for rows and columns. To start
a) Assign 0 to or where maximum number of allocation in a row or column
respectively.
b) Calculate other 's and 's using = + , for all occupied cells.
•
• Step 3 : For all unoccupied cells, calculate = -( + )
• Step 4 : Check the sign of
a. If >0, then current basic feasible solution is optimal and stop this procedure.
b. If =0 then alternative solution exists, with different set allocation and same
transportation cost. Now stop this procedure.
Obtaining the optimal basic solution:
MODI Method
If <0, then the given solution is not an optimal solution and further improvement in the solution is
possible
Step 5 : Select the unoccupied cell with the largest negative value of , and included in the next solution
Step 6 : Draw a closed path (or loop) from the unoccupied cell (selected in the previous step). The right
angle turn in this path is allowed only at occupied cells and at the original unoccupied cell. Mark (+)
and (-) sign alternatively at each corner, starting from the original unoccupied cell
Step 7:
•a. Select the minimum value from cells marked with (-) sign of the closed path.
b. Assign this value to selected unoccupied cell (So unoccupied cell becomes occupied cell).
c. Add this value to the other occupied cells marked with (+) sign.
d. Subtract this value to the other occupied cells marked with (-) sign.
Step 8: Repeat Step-2 to step-7 until optimal solution is obtained. This procedure stops when all ≥0 for
unoccupied cells.
Problem: Obtain the initial basic feasible solution for the
following transportation problem and optimize the solution
using Modi’s method
Destination
Supply
1 2 3 4
Source
1 3 2 7 4 300
2 2 6 5 9 400
3 8 3 3 2 500