Transportation Problems
Transportation Problems ROW MINIMA METHOD Step 1. Check whether ∑ a₁ = ∑ bj. If not introduce a dummy origin or a dummy destination with the transportation cost 0, so that they are equal. Step 2. Obtain the smallest cost in the first row of the transportation table and let be cij in the cell (i, j). Allocate as much as possible quantity xij = min (ai, bj) in the c (i, j). Step-3 Case (i): If x ij =ai cross off the ith row of the transportation table and decrease bj by bai Then go to next row. Case (ii): If x ij =bj cross off the jth column of the transportation table and decrease ai by bj, Then go to next row. Case (iii): If x ij =ai=bj cross off the first row of the transportation table and move down to the second row. Step-4 Continue the step-2 and step-3 until, all the rim requirements are satisfied. COLUMN MINIMA METHOD Step 1. Check whether ∑ a₁ = ∑ bj. If not introduce a dummy origin or a dummy destination ...