Consider the following transshipment problem with two sources and three destinations. The unit cost of transportation...

Transcribed Image Text:

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) Source Destination S1 S2 D1 D2 D3 Demand $1 0 5 8 20 8 S2 3 0 10 12 10 D1 12 3 0 5 30 500 D2 4 6 4 0 8 400 D3 12 10 20 15 0 600 Supply 800 700 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. 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) Source Destination S1 S2 D1 D2 D3 Demand $1 0 5 8 20 8 S2 3 0 10 12 10 D1 12 3 0 5 30 500 D2 4 6 4 0 8 400 D3 12 10 20 15 0 600 Supply 800 700 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.

Answer rating: 100% (QA)

Start with an empty allocation matrix all zeros and calculate the opportunity costs UV values The op... View the full answer