5 Network Flow Programming Models

• 5.1 Classical Models
• 5.2 Extensions of the Basic Models
• 5.3 Linear Programming Model
• 5.4 Minimum Cost Flow Problem
• 5.6 Exercises
• Bibliography

Models
Network Flow Programming

• Terminology
• Distribution Example
• Special Cases
• Other Examples

Computation
Math Programming Add-in
Network Solver Add-in

6 Network Flow Programming Methods

• 6.1 Transportation Problem
• 6.2 Shortest Path Problem
• 6.3 Maximum Flow Problem
• 6.4 Pure Minimum Cost Flow Problem
• 6.5 Exercises
• Bibliography
• Appendix 1. Page 99. Primal Simplex Algorithm for the Pure Minimal Cost Flow Problem
• Appendix 2. Page 117. The Dual Linear Program
• Appendix 3. Page 122. Relation of Pure Minimum Cost Flow Model to Linear Programming

Methods
Network Flow Programming

• Minimal Shortest Path/Shortest Path Tree (Flash)
• Transportation Simplex Demo (Flash)
• Teach Transportation Add-in
• Network Primal Simplex (Flash)
• Teach Network Add-in

3 Generalized Network Flow Programming

• 3.1 Problem Statement
• 3.2 Basic Solutions
• 3.3 Primal Simplex
• 3.4 Exercises