Unit 3 Transportation and Assignment Problem Concepts, formulations of models, Solution procedures, Optimality checks, Balanced/Unbalanced, Maximum/Minimum problems,

s, Prohibited case degeneracy

Formulation of models:

Theorem: A necessary and sufficient condition for the existence of a feasible solution to the transportation problem is that
m i i 1 n j j 1

a b

Example: 1

Example 2:

The Least Cost Method LCM: In this method we look for the minimum cost element of the entire cost matrix. The procedure is given below: i. Locate the cell that has the minimum cost element Cij and allocate the maximum quantity possible by taking Xij = min (ai, bj) ii. If Xij = ai, then delete the ith row and go for a reduced matrix. And if Xij = bj, delete the jth column and proceed with the reduced matrix. iii. Repeat the steps I II till all quantities are allocated.

Example: 3 LCM method

Example: 4

The Vogel Approximation Method VAM:

The procedure is given below:
For each row select the lowest cost Cij and next lowest cost Cik Determine the difference Cij - Cik . Display them alongside the table by enclosing them in parenthesis against the respective rows. Similarly compute the differences for each column. Identify the row or column with the largest difference among all the rows and columns. If a tie occurs, use any one arbitrary. Let the largest difference corresponds to ith row and let Cij be the smallest cost in the ith row. Then allocate Xij = min (ai, bj) and delete the ith row or the jth column in the usual manner. Recomputed the row and column differences for the reduced matrix and go to the step ii. Repeat the process till all the availabilities and requirements are satisfied.
Note: - It has been noticed that VAM determines an initial BFS which is very close to the optimum solution. Hence, the number of iterations required to reach to the optimum solution is less here.

Example: 5

Example: 6 Do the Q. 2 with VAM

The UV MODI Method:

Finding the Optimal Solution: Suppose the initial BFS is obtained by using any of the 3 techniques above. Then the optimal solution can be obtained by the UV MODI method as follow: For a given basic feasible solution of m + n -1 variables if we associate number ui and vj with row i and column j (i=1,2,...,m and j=1,2,...,n) of the transportation problem respectively, then ui and vj must satisfy the equation ui + vj = cij for each occupied cell (i,j) The values of these variables can be determined by assigning zero to arbitrary to any of the variables. The value of remaining m + n 2 variables can be obtained by using the above relation for the occupied cells. Once all ui and vj have been determined, evaluation in terms of opportunity cost of each unoccupied cell is done by using the relation drs = crs (ur + vs) , for each unoccupied cell (r,s)

Steps for the UV MODI Method( Transportation algorithm):

The steps to evaluate un occupied cells are as follows: For an initial basic feasible solution with m + n 1 occupied cells, calculate ui and vj for rows and column. The initial solution can be obtained by any methods discussed earlier. To start with, any one of the ui or vj is assigned zero. It is better to assign zero to particular ui or vj where there are maximum number of allocations in a row or column resp,. The complete calculation of uis and vjs for other rows and columns is done by using the relation ui + vj = cij for all occupied cells (i,j) For unoccupied cells, calculate the opportunity cost by using the relationship dij = cij (ui + vj) Examine the sign of each dij
If dij > 0, then the current basic feasible solution is optimal If dij = 0 then the current basic feasible solution will remain unaffected but an alternative solution exists. If one or more dij < 0 then an improved solution can be obtained by entering unoccupied cell (i,j) in the basis. An unoccupied cell having the largest negative value of dij is chosen for entering into the solution mix.

Cont.
Construct a closed path or loop for the unoccupied cell with largest negative opportunity cost. Start a closed path with the selected unoccupied cell and mark a plus sign (+) in the cell. Trace a path along the rows (or columns) to an occupied cell, mark the corner with ( - ) sign and continue down the column (row) to an occupied cell. The mark the corner with (+) sign and (-) alternatively. Close the path back to selected unoccupied cell. Select the smallest quantity amongst the cells marked with minus sign on the corners of the closed loop. Allocate these values to the selected unoccupied cell and add it to other occupied cells marked with plus sign. Now subtract this from occupied cells marked with minus sign. Obtain a new improved solution by allocating the units to unoccupied cells according to step 5 and calculate the new transportation cost. Further test the revised solution for optimality. The procedure terminates when all dij > 0 for unoccupied cells.

Note: There can be only one plus and minus sign in any given row/column. It is immaterial whether the loop is traversed clockwise or anticlockwise.

Include Ex of Maximization (pg 231)

Example