ME 366L Weekly Overview - Week 04

ME 366L Weekly Overview - Week 04 - design power...

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

Week Four – Network terminology and notation, network diagrams, discussion of generic problems (TP, AP, SPT, STP, MF), LP formulations, finding solutions with Excel add-in Basics of network flow programming Context: The most widespread application of linear programming relates to network design and analysis. We present network terminology and discuss a variety of models starting with the transportation problem and continuing through the maximum flow problem. LP formulations are given for each and we show how to find solutions with the network Excel add-in. Purpose: To provide you with an understanding of network flow models and how they relate to a linear program. To show you how to formulate a variety of problems arising in manufacturing, transportation, circuit
This is the end of the preview. Sign up to access the rest of the document.

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

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.

Ask a homework question - tutors are online