This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: UF-ESI-6314a5a3bf6b731c84af0d2b0f3a9fe5832fd355c2df.xls Problem Statementpage 1 of 4Luther Setzer1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899(321) 544-743505-04.Consider the graph given below. Suppose that the numbers next to the arcs represent capacities. Solve the maximum flow problem on this graph by formulating it as a linear program and solving using Excel. Alsoidentify the minimum cut set in the graph.123456755472673284UF-ESI-6314a5a3bf6b731c84af0d2b0f3a9fe5832fd355c2df.xls Linear Programpage 2 of 4Luther Setzer1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899(321) 544-7435Only the first and last node in the set have non-neutral flow.Select the first node outflow to maximize.maximize:z=+subject to:=+Flow balance for Node2=+Flow balance for Node3+=+Flow balance for Node4+=+Flow balance for Node5+=Flow balance for Node6≤5Flow cannot exceed capacity of arc≤5Flow cannot exceed capacity of arc≤6Flow cannot exceed capacity of arc≤4Flow cannot exceed capacity of arc...
View Full Document
- Fall '09
- International Space Station, Flow network, Maximum flow problem, Max-flow min-cut theorem, Kennedy Space Center, Flow Flow Flow