The minimal spanning tree consist of the following links: The minimal spanning t

Question

The minimal spanning tree consist of the following links: The minimal spanning tree cost is: 6. (10 points). Maximum Flow Problem. (15 minutes) Solve the following problem to find the maximum flow to transport rail cars from node 1 to node 7. The maximum capacity of each roadway link for rail cars is provided at each roadway link as depicted in the following network. Links 4-6 and 5-6 are two-way having the same capacity. The remaining links are one- way. Show your work for each iteration as in the following table. The directionality of the links here is important. Maximum Flow Problem 6 Figure 3. Maximum Flow Network Path Cumulative Flow Iteration The maximum flow of rail cars from node 1 to node 7 is 7. (10 points). Transshipment Problem (30 minutes)

Explanation / Answer

List the possible paths from beginning to end along with th maximum possible flow along that path as per remaining capacity along the path

First path is 1-4-7. The flow along this path is limited by the capacity of path 4-7. Therefore flow along this path is 6.

The next path is 1-4-6-7. The balance capacity along path 1-4 is 1. So 1 unit flows along this path.

The next path to be considered is 1-2-6-7. Flow along this path is restricted by the balance capacity of path 6-7, which is 4.

2 units of capacity is left along path 2-6. So 2 units flow along 1-2-6-5-7

Lastly, 3 units flow along path 1-2-3-5-7

Maximum flow = 16

Iteration Path Flow Cumulative Flow 1 1-4-7 6 6 2 1-4-6-7 1 7 3 1-2-6-7 4 11 4 1-2-6-5-7 2 13 5 1-2-3-5-7 3 16

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.