the previous optimal solution is till optimal 7. Consider the transportation problem having the following cost and requirements table Destinati 2 4 Source Demand Determine the optimal solution (15 points) Solution: the optimal transportation plan is described in following table: the red words in square blanks are the optimal shipment. The minimum shipping cost is 32 Destinati Supply 3(3) 7 6 2 2 2 3 5 8. Consider the maximum flow problem shown below, where the supple node is node A, the demand node is node f, and the arc capacities are the numbers shown next to these directed arcs. Use the augmenting path algorithm to solve this problem. (10 points) 7 Solution: the solution is in the graph (7,7) 6,6) (76) So the maximum flow is F=155 the previous optimal solution is till optimal. 7. Consider the transportation problem having the following cost and requirements table: Destination 1 2 3 4 Supply 1 3 7 6 4 5 Source 2 2 4 3 2 2 3 4 3 8 5 3 Demand 3 3 2 2 Determine the optimal solution. (15 points) Solution: the optimal transportation plan is described in following table: the red words in square blanks are the optimal shipment. The minimum shipping cost is 32. Destination 1 2 3 4 Supply 1 3(3) 7 6 4(2) 5 Source 2 2 4 3(2) 2 2 3 4 3(3) 8 5 3 Demand 3 3 2 2 8.Consider the maximum flow problem shown below, where the supple node is node A, the demand node is node F, and the arc capacities are the numbers shown next to these directed arcs. Use the augmenting path algorithm to solve this problem. (10 points) Solution: the solution is in the graph. So, the maximum flow is F=15 3 7 2 4 6 6 9 7 9 A B C D E F (3,1) (7,7) (2,2) 4 (6,6) (6,6) (9,9) (7,6) (9,9) A B C D E F