2. Maximum flow problem (35 pts): Consider the network shown below
Source
Sink
(20 pts) Use the augmenting path algorithm to find the maximum flow from the source to the sink The numbers show the forward capacities of the arcs, and the backward capacities are all zero: In every iteration, clearly identify the augmenting path and flow amount: Give the optimal solution (flow on each arc and maximum flow amount): (15 pts) Formulate this maximum flow problem as linear programming problem:
3. Transportation problem (25 pts): Consider the following transportation tableau: The solution values and supply, demand and cost parameters are depicted on the tableau_
Destination
Supply
4001
Source
800
Source
Demand
20
20
(5 pts) Explain why this solution is basic feasible solution: (20 pts) Starting with the initia solution given, apply the transportation simplex method for ShQwYQULwokkl
iteration_