(7) (15 Points) Consider the minimum cost flow problem shown below, where the b; values (net...

Transcribed Image Text:

(7) (15 Points) Consider the minimum cost flow problem shown below, where the b; values (net flows generated) are given by the nodes, the cy values (costs per unit flow) are given by the arcs, and the uy values (arc capacities) are given. Do the following work manually. [20] Arc capacities: A - Č: 10 B → C: 25 Others: [-30] 4 [10] [0] Now consider the following BF solution. Basic Arc Flow Nonbasic Arc A - D 20 A - B 10 10 20 Starting from this BF solution, apply one iteration of the network simplex method. Identify the entering basic arc, the leaving basic arc, and the next BF solution and check whether it is optimal. Activate Go to Seti (7) (15 Points) Consider the minimum cost flow problem shown below, where the b; values (net flows generated) are given by the nodes, the cy values (costs per unit flow) are given by the arcs, and the uy values (arc capacities) are given. Do the following work manually. [20] Arc capacities: A - Č: 10 B → C: 25 Others: [-30] 4 [10] [0] Now consider the following BF solution. Basic Arc Flow Nonbasic Arc A - D 20 A - B 10 10 20 Starting from this BF solution, apply one iteration of the network simplex method. Identify the entering basic arc, the leaving basic arc, and the next BF solution and check whether it is optimal. Activate Go to Seti

Answer rating: 100% (QA)

Solution ... View the full answer