Unformatted text preview: design, power distribution and related fields as pure networks. Objectives: At the end of this lesson, you will be able to: 1. Set up and solve any of a series of classic network flow problems, including the transportation problem, the assignment problem, the shortest path and tree problems, the maximum flow problem and the distribution problem. 2. Formulate each of the classic network flow problem mentioned above as LPs. 3. Differentiate between pure network flow problems and general network flow problems. 4. Describe the relationship between the max flow problem and the min-cut problem. 5. Identify the min-cut on a graph from the sensitivity report obtained by solving a max flow problem....
View Full Document
- Spring '08
- Flow network, Maximum flow problem, Max-flow min-cut theorem, Network flow, flow problem, LP formulations