Question: 1. Consider the maximum flow problem shown below, where the source is node 1, the sink is node 7, and the arc capacities are the

1. Consider the maximum flow problem shown below,

1. Consider the maximum flow problem shown below, where the source is node 1, the sink is node 7, and the arc capacities are the numbers shown next to these directed arcs. 24 5)4 F Source 1 3 7 F Sink 3 3 69 4 (a) Formulate the maximum flow problem as a linear programming problem. (b) Solve the model by using Lingo software. (c) Determine the optimal solution of the maximum flow problem. (d) According to the optimal solution determine the slack of each arc. NOTE: For any arc (i, j) of the directed network: Xij : the number of flow Cij : the capacity Sij: the slack, Sij = Cij - Xij

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!