ME 366L Weekly Overview - Week 05

ME 366L Weekly Overview - Week 05 - model, and to you with...

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

View Full Document Right Arrow Icon
Week Five – Mathematical formulation and problem characteristics of the min-cost flow problem, relationship to classic pure network problems, examples of generalized networks Generalization of pure networks Context: We show that the classic network flow problems are each a special case of the min-cost flow problem. This model is then generalized to include gains on the arcs. The implications of gains are discussed and several examples are given. Purpose: To provide you with a means of integrating the collection of classic network problems into a single
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: model, and to you with provide a perspective on generalizing those models to include gains and side constraints. Objectives: At the end of this lesson, you will be able to: 1. Formulate each classic network flow problem as a min-cost flow problem. 2. Describe how the introduction of gains affects changes the pure network flow problem from both a modeling and computational point of view. 3. Set up and solve general network flow problems using the network Excel add-in....
View Full Document

This note was uploaded on 12/19/2011 for the course M E 366l taught by Professor Staff during the Spring '08 term at University of Texas at Austin.

Ask a homework question - tutors are online