Question

Exercises

Ex 1: Find a maximum flow from node s to node t. The number associated with each arc

indicates the capacity of the arc. Formulate this maximal flow problem as a linear programming

problem and use solver to find the optimal solution.

Question image 1