prelab4 - Prelab Exercise: For the following graph, compute...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
ENGRI 115 Engineering Applications of OR Fall 2007 The Maximum Flow Problem Prelab 4 Name: Objectives: Introduce the maximum flow problem. Demonstrate how to solve the maximum flow problem by the Ford-Fulkerson algorithm. Key Ideas: sink and source nodes flow feasible flow value of flow cuts capacity of cut max-flow min-cut theorem integrality properties sensitivity analysis
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Prelab Exercise: For the following graph, compute the maximum flow from node 1 to node 3 by trial-and-error. Can you give a convincing argument that you have found an optimal solution? Can you find a cut of minimum capacity? What is the capacity of the minimum cut? What is the value of the maximum flow? 1 2 3 4 5 1 4 2 5 1 2 2 3 2...
View Full Document

This note was uploaded on 06/01/2008 for the course ENGRI 1101 taught by Professor Trotter during the Fall '05 term at Cornell.

Ask a homework question - tutors are online