Chapter 7 Transportation, Assignment and Transshipment Problems to accompany Operations Research: Applications & Algorithms, 4th edition, by Wayne L. Winston 1 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Description A transportation problem basically deals with the problem, which aims to find the best way to fulfill the demand of n demand points using the capacities of m supply points. While trying to find the best way, generally a variable cost of shipping the product from one supply point to a demand point or a similar constraint should be taken into consideration. 2 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 7.1 Formulating Transportation Problems

Example 1: Powerco has three electric power plants that supply the electric needs of four cities. The associated supply of each plant and demand of each city is given in the table 1. The cost of sending 1 million kwh of electricity from a plant to a city depends on the distance the electricity must travel. 3 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Transportation tableau A transportation problem is specified by the supply, the demand, and the shipping costs. So the relevant data can be summarized in a transportation tableau. The transportation tableau implicitly expresses the supply and demand constraints and the shipping cost between each demand and supply point. 4 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Table 1. Shipping costs, Supply, and Demand

for Powerco Example From To City 1 City 2 5 City 3 City 4 Supply (Million kwh) Plant 1 $8 $6 $10 $9 35

Plant 2 $9 $12 $13 $7 50 Plant 3 $14 $9 $16 $5 40 Demand

(Million kwh) 45 20 30 30 Transportation Tableau Copyright 2004 Brooks/Cole, a division of Thomson Learning, Solution 1. Decision Variable: Since we have to determine how much electricity is sent from each plant to each city; Xij = Amount of electricity produced at plant i and sent to city j X14 = Amount of electricity produced at plant 1 and sent to city 4 6 Copyright 2004 Brooks/Cole, a division of Thomson Learning,

2. Objective function Since we want to minimize the total cost of shipping from plants to cities; Minimize Z = 8X11+6X12+10X13+9X14 +9X21+12X22+13X23+7X24 +14X31+9X32+16X33+5X34 7 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 3. Supply Constraints Since each supply point has a limited production capacity; X11+X12+X13+X14 <= 35 X21+X22+X23+X24 <= 50 X31+X32+X33+X34 <= 40 8 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 4. Demand Constraints Since each supply point has a limited production capacity; X11+X21+X31 >= 45

X12+X22+X32 >= 20 X13+X23+X33 >= 30 X14+X24+X34 >= 30 9 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 5. Sign Constraints Since a negative amount of electricity can not be shipped all Xijs must be non negative; Xij >= 0 (i= 1,2,3; j= 1,2,3,4) 10 Copyright 2004 Brooks/Cole, a division of Thomson Learning, LP Formulation of Powercos Problem Min Z = 8X11+6X12+10X13+9X14+9X21+12X22+13X23+7X24 +14X31+9X32+16X33+5X34 S.T.: X11+X12+X13+X14 <= 35 (Supply Constraints) X21+X22+X23+X24 <= 50

X31+X32+X33+X34 <= 40 X11+X21+X31 >= 45 (Demand Constraints) X12+X22+X32 >= 20 X13+X23+X33 >= 30 11 X14+X24+X34 >= 30 Xij >= 0 (i= 1,2,3;Copyright j= 1,2,3,4) 2004 Brooks/Cole, a division of Thomson Learning, General Description of a Transportation Problem 1. A set of m supply points from which a good is shipped. Supply point i can supply at most si units. 2. A set of n demand points to which the good is shipped. Demand point j must receive at least di units of the shipped good. 3. Each unit produced at supply point i and shipped to demand point j incurs a variable cost of cij. 12

Copyright 2004 Brooks/Cole, a division of Thomson Learning, Xij = number of units shipped from supply point i to demand point j i m j n min cijXij i 1 j 1 j n s.t. Xij si (i 1,2,..., m) j 1 i m X ij dj ( j 1,2,..., n) i 1 Xij 0(i 1,2,..., m; j 1,2,..., n)

13 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Balanced Transportation Problem If Total supply equals to total demand, the problem is said to be a balanced transportation problem: j n i m s d i i 1 j j 1 14 Copyright 2004 Brooks/Cole, a division of Thomson Learning,

Balancing a TP if total supply exceeds total demand If total supply exceeds total demand, we can balance the problem by adding dummy demand point. Since shipments to the dummy demand point are not real, they are assigned a cost of zero. 15 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Balancing a transportation problem if total supply is less than total demand If a transportation problem has a total supply that is strictly less than total demand the problem has no feasible solution. There is no doubt that in such a case one or more of the demand will be left unmet. Generally in such situations a penalty cost is often associated with unmet demand and as one can guess this time the total penalty cost is desired to be minimum 16 Copyright 2004 Brooks/Cole, a division of Thomson Learning,

7.2 Finding Basic Feasible Solution for TP Unlike other Linear Programming problems, a balanced TP with m supply points and n demand points is easier to solve, although it has m + n equality constraints. The reason for that is, if a set of decision variables (xijs) satisfy all but one constraint, the values for xijs will satisfy that remaining constraint automatically. 17 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Methods to find the bfs for a balanced TP There are three basic methods: 1. Northwest Corner Method 2. Minimum Cost Method 3. Vogels Method 18 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 1. Northwest Corner Method To find the bfs by the NWC method:

Begin in the upper left (northwest) corner of the transportation tableau and set x11 as large as possible (here the limitations for setting x11 to a larger number, will be the demand of demand point 1 and the supply of supply point 1. Your x11 value can not be greater than minimum of this 2 values). 19 Copyright 2004 Brooks/Cole, a division of Thomson Learning, According to the explanations in the previous slide we can set x11=3 (meaning demand of demand point 1 is satisfied by supply point 1). 5 6 2 3 5 2 3

3 2 6 2 20 X 5 2 3 Copyright 2004 Brooks/Cole, a division of Thomson Learning, After we check the east and south cells, we saw that we can go east (meaning supply point 1 still has capacity to fulfill some demand). 3 2

X 6 2 X 3 2 3 3 2 X 3 3 2 21

X X 2 3 Copyright 2004 Brooks/Cole, a division of Thomson Learning, After applying the same procedure, we saw that we can go south this time (meaning demand point 2 needs more supply by supply point 2). 3 2 3 X 2 1 2 X

X 3 2 3 X 3 X 2 1 X 2 22 X X

X 2 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Finally, we will have the following bfs, which is: x11=3, x12=2, x22=3, x23=2, x24=1, x34=2 3 2 3 X X X 2 X 1

X 2 X X 23 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 2. Minimum Cost Method The Northwest Corner Method dos not utilize shipping costs. It can yield an initial bfs easily but the total shipping cost may be very high. The minimum cost method uses shipping costs in order come up with a bfs that has a lower cost. To begin the minimum cost method, first we find the decision variable with the smallest shipping cost (Xij). Then assign Xij its largest possible value, which is the minimum of si and dj 24 Copyright 2004 Brooks/Cole, a division of Thomson Learning,

After that, as in the Northwest Corner Method we should cross out row i and column j and reduce the supply or demand of the noncrossed-out row or column by the value of Xij. Then we will choose the cell with the minimum cost of shipping from the cells that do not lie in a crossed-out row or column and we will repeat the procedure. 25 Copyright 2004 Brooks/Cole, a division of Thomson Learning, An example for Minimum Cost Method Step 1: Select the cell with minimum cost. 12 2 3 5 6 2

1 3 5 3 8 4 6 8 4 5 10 15

6 26 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Step 2: Cross-out column 2 2 3 5 6 2 1 3 5 8 4

6 8 3 12 X 4 5 2 15 6 27 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Step 3: Find the new cell with minimum shipping cost and cross-out row 2

2 3 5 6 2 1 3 5 8 4 6 2 8

3 10 X 4 5 X 15 6 28 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Step 4: Find the new cell with minimum shipping cost and cross-out row 1 2 3

5 6 2 1 3 5 8 4 6 5 2 8 3

5 X 4 X X 15 6 29 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Step 5: Find the new cell with minimum shipping cost and cross-out column 1 2 3 5

6 2 1 3 5 8 4 6 5 2 8 3 5 X

X 4 X X 10 6 30 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Step 6: Find the new cell with minimum shipping cost and cross-out column 3 2 3 5 6

2 1 3 5 8 4 6 5 2 8 3 5 4

X X X X X 6 6 31 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Step 7: Finally assign 6 to last cell. The bfs is found as: X11=5, X21=2, X22=8, X31=5, X33=4 and X34=6 2 3 5

6 2 1 3 5 8 4 6 5 2 8 3 5

4 X X 6 X X X X X 32 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 3. Vogels Method Begin with computing each row and column a penalty. The penalty will be equal to the difference between the two smallest shipping costs in the row or column. Identify the row or column with the largest penalty. Find the first basic variable which has the smallest

shipping cost in that row or column. Then assign the highest possible value to that variable, and cross-out the row or column as in the previous methods. Compute new penalties and use the same procedure. 33 Copyright 2004 Brooks/Cole, a division of Thomson Learning, An example for Vogels Method Step 1: Compute the penalties. Demand Column Penalty 6 7 8 15 80 78

15 5 5 15-6=9 80-7=73 78-8=70 Supply Row Penalty 10 7-6=1 15 78-15=63

34 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Step 2: Identify the largest penalty and assign the highest possible value to the variable. 6 7 8 80 78 5 15 Demand Column Penalty 15 X

5 15-6=9 _ 78-8=70 Supply Row Penalty 5 8-6=2 15 78-15=63 35 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Step 3: Identify the largest penalty and assign the

highest possible value to the variable. 6 7 5 5 15 Demand Column Penalty 8 80 78 15 X X

15-6=9 _ _ Supply Row Penalty 0 _ 15 _ 36 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Step 4: Identify the largest penalty and assign the highest possible value to the variable.

6 0 7 5 8 5 15 80 78 Demand 15 X X Column Penalty

_ _ _ Supply Row Penalty X _ 15 _ 37 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Step 5: Finally the bfs is found as X11=0, X12=5, X13=5, and X21=15 6

0 7 5 8 5 15 80 78 15 Demand X X X Column Penalty

_ _ _ Supply Row Penalty X _ X _ 38 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 7.3 The Transportation Simplex Method In this section we will explain how the simplex algorithm is used to solve a transportation problem.

39 Copyright 2004 Brooks/Cole, a division of Thomson Learning, How to Pivot a Transportation Problem Based on the transportation tableau, the following steps should be performed. Step 1. Determine (by a criterion to be developed shortly, for example northwest corner method) the variable that should enter the basis. Step 2. Find the loop (it can be shown that there is only one loop) involving the entering variable and some of the basic variables. Step 3. Counting the cells in the loop, label them as even cells or odd cells. 40 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 41 Step 4. Find the odd cells whose variable assumes the smallest value. Call this value . The variable corresponding to this odd cell will leave the basis. To perform the pivot, decrease the value of each odd cell by and increase the value of each even cell by . The

variables that are not in the loop remain unchanged. The pivot is now complete. If =0, the entering variable will equal 0, and an odd variable that has a current value of 0 will leave the basis. In this case a degenerate bfs existed before and will result after the pivot. If more than one odd cell in the loop equals , you may arbitrarily choose one of these odd cells to leave the basis; again a degenerate bfs will result Copyright 2004 Brooks/Cole, a division of Thomson Learning, Illustration of pivoting procedure on the Powerco example. We want to find the bfs that would result if X14 were entered into the basis. 5 35 4 10 0 20 3 2 20

35 50 10 30 1 40 45 20 30 30 E O

E O E O (1, 4) (3, 4) (3, 3) (2, 3) (2, 1) (1, 1) Nothwest Corner bfs and loop for Powerco 42 Copyright 2004 Brooks/Cole, a division of Thomson Learning, New bfs after X14 is pivoted into basis. Since There

is no loop involving the cells (1,1), (1,4), (2,1), (2,2), (3,3) and (3, 4) the new solution is a bfs. 35-20 10+20 45 0+20 20 20 20-20 (nonbasic) 35 50 10+20 30-20

30 30 40 After the pivot the new bfs is X11=15, X14=20, X21=30, X22=20, X33=30 and X34=10. 43 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Two important points! In the pivoting procedure: 1. Since each row has as many +20s as 20s, the new solution will satisfy each supply and demand constraint. 2. By choosing the smallest odd variable (X23) to leave the basis, we ensured that all variables will remain nonnegative. 44 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Pricing out nonbasic variables To complete the transportation simplex, now we will discuss how to row 0 for any bfs. For a bfs in which

the set of basic variables is BV, the coefficient of the variable Xij (call it ij) in the tableaus row ) is given by ij = cBV B-1aij cij Where cij is the objective function coefficient for Xij and a is the column for x in the original LP. ij ij 45 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Since the example is a minimization problem, the current bfs will be optimal if all the ijs are nonpositive; otherwise, we enter into the basis with the most positive ij.

After determining cBVB-1 we can easily determine ij. Since the first constraint has been dropped, cBVB1 will have m+n-1 elements. cBVB-1= [u2 u3um v1 v2vn] 46 Where u2 u3um are elements of cBVB-1 corresponding to the m-1 supply constraints, and v1 v2vn are elements of cBVB-1 corresponding to the n demand constraints. Copyright 2004 Brooks/Cole, a division of Thomson Learning, To determine cBVB-1 we use the fact that in any tableau, each basic variable Xij must have ij=0. Thus for each of the m+n-1 variables in BV, cBV B-1aij cij=0 For the Northwest corner bfs of Powerco problem, BV={X11, X21, X22, X23, X33, X34}. Applying the equation above we obtain: 11= [u2 u3 v1 v2 v3 v4] 47 0 0

1 0 0 0 -8 = v1-8=0 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 21= [u2 u3 v1 v2 v3 v4] 1 0 1 0 0 0 22= [u2 u3 v1 v2 v3 v4]

1 0 0 1 0 0 23= [u2 u3 v1 v2 v3 v4] 48 -9 = u2+v1-9=0 -12 = u2+v2-12=0 1 0 0 0 1

0 -13 = u2+v3-13=0 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 33= [u2 u3 v1 v2 v3 v4] 0 1 0 0 1 0 34= [u2 u3 v1 v2 v3 v4] 0 1 0

0 1 0 -16 = u3+v3-16=0 -5 = u3+v4-5=0 For each basic variable Xij (except those having i=1), we see that the equation we used above reduces to ui+vj=cij. If we define u1=0, we must solve the following system 49of m+n equations. Copyright 2004 Brooks/Cole, a division of Thomson Learning, u1=0 u1+v1=8 u2+v1=9 u2+v2=12 u2+v3=13 u3+v3=16 u3+v4=5 By solving the system above we obtain:

v1=8, u2=1, v2=11,v3=12, u3=4, v4=1 50 Copyright 2004 Brooks/Cole, a division of Thomson Learning, For each nonbasic variable, we now compute ij = ui+vj cij We obtain: 12 = 0+11 6 = 5 13 = 0+12 10 = 2 14 = 0+1 9 = -8 24 = 1+1 7 = -5 31 = 4+8 14 = -2 32 = 4+11 9 = 6 Since 32 is the greatest positive ij, we would next enter X32 into the basis. Each unit that is entered into the basis will decrease Powercos cost by $6. 51 Copyright 2004 Brooks/Cole, a division of Thomson Learning,

We have determined that X32 should enter the basis. As shown in the table below the loop involving X32 and some of the basic variables is (3,2), (3,3), (2,3), (2,2). The odd cells in the loop are (2,2) and (3,3). Since the smallest value of these two is 10 the pivot is 10. 35 10 45 35 20 20 20 50 10 30

30 30 40 52 Copyright 2004 Brooks/Cole, a division of Thomson Learning, The resulting bfs will be: X11=35, X32=10, X21=10, X22=10, X23=30 and X34=30 The uis and vjs for the new bfs were obtained by solving u1=0 u2+v2=12 u3+v4=5 u1+v1=8 u2+v3=13 53 u2+v1=9 u3+v2=9 Copyright 2004 Brooks/Cole, a division of Thomson Learning,

In computing ij = ui+vj cij for each nonbasic variable, we find that 12 = 5, 13 = 2 and 24 = 1 are the only positive ijs. Thus we next enter X12 into the basis. By applying the same steps we will finally get a solution where all ijs are less then or equal to 0, so an optimal solution has been obtained. The optimal solution for Powerco is X11=10, X13=25, X21=45, X23=5, X32=10 and X34=30. As a result of this solution the objective function value becomes: Z=6(10)+10(25)+9(45)+13(5)+9(10)+5(30)=$1020 54 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 7.4 Sensitivity Analysis In this section we discuss the following three aspects of sensitivity analysis for the transportation problem: 1. Changing the objective function coefficient of a nonbasic variable. 2. Changing the objective function coefficient of a basic variable. 3. Increasing a single supply by and a single demand by . 55 Copyright 2004 Brooks/Cole, a division of Thomson Learning,

1. Changing the objective function coefficient of a nonbasic variable. Changing the objective function coefficient of a nonbasic variable Xij will leave the right hand side of the optimal tableau unchanged. Thus the current basis will still be feasible. Since we are not changing cBVB-1, the uis and vjs remain unchanged. In row 0 only the coefficient of Xij will change. Thus as long as the coefficient of Xij in the optimal row 0 is nonpositive, the current basis remains optimal. 56 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Lets try to answer the following question about Powerco as an example: For what range of values of the cost of shipping 1 million kwh of electricity from plant 1 to city 1 will the current basis remain optimal? Suppose we change c11 from 8 to 8+ . Now 11 = u1+v1-c11=0+6-(8+ )=2- . 57 Thus the current basis remains optimal for 2- <=0,

or >=-2, and c11>=8-2=6. Copyright 2004 Brooks/Cole, a division of Thomson Learning, 2. Changing the objective function coefficient of a basic variable. Since we are changing cBVB-1, the coefficient of each nonbasic variable in row 0 may change, and to determine whether the current basis remain optimal, we must find the new uis and vjs and use these values to price out all nonbasic variables. The current basis remains optimal as long as all nonbasic variables price out nonpositive. 58 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Lets try to answer the following question about Powerco as an example: For what range of values of the cost of shipping 1 million kwh of electricity from plant 1 to city 3 will the current basis remain optimal? Suppose we change c13 from 10 to 10+ . Now 13=0 changes from u1+v3=10 to u1+v3=10+ . Thus, to find the uis and vjs we must solve the following equations: u1=0

u1+v2=6 u2+v1=9 u2+v3=13 u3+v2=9 59 u1+v3=10+ u3+v4=5 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Solving these equations, we obtain u1=0, v2=6, v3=10+ , v1=6+ , u2=3- , u3=3, and v4=2. We now price out each nonbasic variable. The current basis will remain optimal as long as each nonbasic variable has a nonpositive coefficient in row 0. 11 = u1+v1-8=-2<=0 for <=2 14 = u1+v4-9=-7 22 = u2+v2-12=-3-<=0 for >=-3

24 = u2+v4-7=-2-<=0 for >=-2 31 = u3+v1-14=-5+<=0 for <=5 = u3+v3-16=-3<=0 60 33 for <=3 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Thus, the current basis remains optimal for 2<=<=2, or 8=10-2<=c13<=10+2=12 61 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 3. Increasing Both Supply si and Demand dj by . Changing both supply and demand by the same amount will maintain the balance of the transportation problem. Since uis and vjs may be thought of as the negative of each constraints shadow price, we know that if the current basis remains optimal,

New Z value = old Z value+ui+vj For example if we increase plant 1,s supply and city 2s demand by 1 unit, then New cost=1020+1(0)+1(6)=$1026 62 Copyright 2004 Brooks/Cole, a division of Thomson Learning, We can also find the new values of the decision variables as follows: 1. If Xij is a basic variable in the optimal solution, increase Xij by . 63 2. If Xij is a nonbasic variable in the optimal solution, find the loop involving Xij and some of the basic variables. Find an odd cell in the loop that is in row I. Increase the value of this odd cell by and go around the loop, alternately increasing and then decreasing current basic variables in the loop by . Copyright 2004 Brooks/Cole, a division of Thomson Learning, 7.5. Assignment Problems

Example: Machineco has four jobs to be completed. Each machine must be assigned to complete one job. The time required to setup each machine for completingeach job is shown in the table below. Machinco wants to minimize the total setup time needed to complete the four jobs. 64 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Setup times (Also called the cost matrix) Time (Hours) Job1 Job2 Job3 Job4 Machine 1 14

5 8 7 Machine 2 2 12 6 5 Machine 3 7 8 3 9

Machine 4 2 4 6 10 65 Copyright 2004 Brooks/Cole, a division of Thomson Learning, The Model According to the setup table Machincos problem can be formulated as follows (for i,j=1,2,3,4): min Z 14 X 11 5 X 12 8 X 13 7 X 14 2 X 21 12 X 22 6 X 23 5 X 24 7 X 31 8 X 32 3 X 33 9 X 34 2 X 41 X 42 6 X 43 10 X 44 s.t. X 11 X 12 X 13 X 14 1 X 21 X 22 X 23 X 24 1 X 31 X 32 X 33 X 34 1 X 41 X 42 X 43 X 44 1 X 11 X 21 X 31 X 41 1 X 12 X 22 X 32 X 42 1

X 13 X 23 X 33 X 43 1 X 14 X 24 X 34 X 44 1 66 Xij 0orXij 1 Copyright 2004 Brooks/Cole, a division of Thomson Learning, For the model on the previous page note that: Xij=1 if machine i is assigned to meet the demands of job j Xij=0 if machine i is assigned to meet the demands of job j In general an assignment problem is balanced transportation problem in which all supplies and demands are equal to 1. 67 Copyright 2004 Brooks/Cole, a division of Thomson Learning, 68 Although the transportation simplex appears to be very efficient, there is a certain class of transportation problems, called assignment problems, for which the transportation simplex is often very inefficient. For that reason there is an other method called The Hungarian

Method. The steps of The Hungarian Method are as listed below: Step1. Find a bfs. Find the minimum element in each row of the mxm cost matrix. Construct a new matrix by subtracting from each cost the minimum cost in its row. For this new matrix, find the minimum cost in each column. Construct a new matrix (reduced cost matrix) by subtracting from each cost the minimum cost in its column. Copyright 2004 Brooks/Cole, a division of Thomson Learning, Step2. Draw the minimum number of lines (horizontal and/or vertical) that are needed to cover all zeros in the reduced cost matrix. If m lines are required , an optimal solution is available among the covered zeros in the matrix. If fewer than m lines are required, proceed to step 3. Step3. Find the smallest nonzero element (call its value k) in the reduced cost matrix that is uncovered by the lines drawn in step 2. Now subtract k from each uncovered element of the reduced cost matrix and add k to each element that is covered by two lines. Return to 69step2. Copyright 2004 Brooks/Cole, a division of Thomson Learning,

7.6 Transshipment Problems A transportation problem allows only shipments that go directly from supply points to demand points. In many situations, shipments are allowed between supply points or between demand points. Sometimes there may also be points (called transshipment points) through which goods can be transshipped on their journey from a supply point to a demand point. Fortunately, the optimal solution to a transshipment problem can be found by solving a transportation problem. 70 Copyright 2004 Brooks/Cole, a division of Thomson Learning, The following steps describe how the optimal solution to a transshipment problem can be found by solving a transportation problem. Step1. If necessary, add a dummy demand point (with a supply of 0 and a demand equal to the problems excess supply) to balance the problem. Shipments to the dummy and from a point to itself will be zero. Let s= total available supply. Step2. Construct a transportation tableau as follows: A row in the tableau will be needed for each supply point and transshipment point, and a column will be needed for

each demand point and transshipment point. 71 Copyright 2004 Brooks/Cole, a division of Thomson Learning, Each supply point will have a supply equal to its original supply, and each demand point will have a demand to its original demand. Let s= total available supply. Then each transshipment point will have a supply equal to (points original supply)+s and a demand equal to (points original demand)+s. This ensures that any transshipment point that is a net supplier will have a net outflow equal to points original supply and a net demander will have a net inflow equal to points original demand. Although we dont know how much will be shipped through each transshipment point, we can be sure that the total amount will not exceed s. 72 Copyright 2004 Brooks/Cole, a division of Thomson Learning,