prelab4

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

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

ENGRI 115 Engineering Applications of OR Fall 2007 The Maximum Flow Problem Prelab 4 Name: Objectives: Introduce the maximum ﬂow problem. Demonstrate how to solve the maximum ﬂow problem by the Ford-Fulkerson algorithm. Key Ideas: sink and source nodes ﬂow feasible ﬂow value of ﬂow cuts capacity of cut max-ﬂow min-cut theorem integrality properties sensitivity analysis
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 ﬂow 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 ﬁnd a cut of minimum capacity? What is the capacity of the minimum cut? What is the value of the maximum ﬂow? 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