Consider the following transshipment problem with two sources and three destinations. The unit cost of transportation between different possible nodes given in the following table. Find the optimal shipping plan such that the total cost is minimized. (do only one iteration with U-V method if not optimized in first iteration) Destination S1 Source S2 D1 D2 D3 Demand S1 S2 D1 D2 D3 Supply 0 3 12 4 12 800 5 0 3 6 10 700 8 10 0 4 20 - 20 12 5 0 15 - 8 10 30 8 0 - - - 500 400 600 For software generated output write down complete input, output matrix and final network flow in answer sheet, write down the sensitivity

Consider the following transshipment problem with two sources and three destinations. The unit cost of transportation between different possible nodes given in the following table. Find the optimal shipping plan such that the total cost is minimized. (do only one iteration with UV method if not optimized in first iteration) For software generated output write down complete input, output matrix and final network flow in answer sheet, write down the sensitivity analysis as per most sensitive source and/ or destination