Subject::Operations Research

i need answer to the example provided

Transportation problem is used to compute transportation routes in such a way as to minimize transportation cost for finding out locations of warehouses. It keeps on eliminating unfeasible options until solution is achieved. Can you use dynamic approach to solve North West Corner Method of Transportation problem instead of routine procedure? Use the matrix given below to apply dynamic recursive approach for TP. Destination D2 D3 Supply Source D1 D4 S1 6 4 1 5 14 S2 8 9 2 7 16 S3 4 3 6 2 5 Demand 6 10 15 4 35 Transportation problem is used to compute transportation routes in such a way as to minimize transportation cost for finding out locations of warehouses. It keeps on eliminating unfeasible options until solution is achieved. Can you use dynamic approach to solve North West Corner Method of Transportation problem instead of routine procedure? Use the matrix given below to apply dynamic recursive approach for TP. Destination D2 D3 Supply Source D1 D4 S1 6 4 1 5 14 S2 8 9 2 7 16 S3 4 3 6 2 5 Demand 6 10 15 4 35