Lect 
Date 
Topic 
Read MMOR 
Lecture Notes 
HW 
Link

Network Flow Programming Models





1 

Introduction and Network
Models 
5.1 
15 




Terminology 




2 

Modeling Examples 
5.2

612 




Distribution Example 






Special Cases 






Other Examples 




3 

Optimization
Addins for Excel 






General Discussion
of Addins 






Math Programming
Addin 






Network Models 






Transportation
Model 






Network Solver
Addin 






Excel Files
(Network Models) 






Excel Demo (Math
Programming) 




4 

Nonlinear Costs/Economic
Model 

1318 
HW 1 

5 

Side Constraints 

1922 


6 

Integer Variables 

2329 
HW 2 

7 

Distance Problems 

3133 


8 

Nonlinear Problems 


HW 3 

9 

Modeling Exercises 




10 

Modeling Exercises 




11 

Exam 




Solution Methods for Specialized
Problems





12 

The Transportation Problem 
6.1 
3436 




Teach Transportation Addin 






Transportation Demo 




13 

MST and SPT Algorithms 
6.2 
3748 




MST and SPT Demonstrations 




14 

Maximum Flow Problem 
6.3 
4957 
HW 4 

15 

Primal and Dual Problems 

5862 


Primal Simplex Methods for Network
Problems





16 

LP and Network Flows 

6368

HW 5 

17 

Basic Solutions for the
Pure Problem 
6.4 
6972 


18 

The Primal Simplex for the
Pure Problem 

7378 
HW 6 

19 

Simplex for Upper Bounded
Problems 

7986 




Teach Networks Addin 






Network Simplex Demo 




20 

The Shortest Path and Maximum
Flow Problems 

8788 
HW 7 

21 

Computational Implementation 

8994 


22 

Review 




23 

Exam 




The Generalized Ñetwork
Problem





24 

The Basis for the Generalized
Problem 
C.1 
9596 
HW 8 

25 

Finding the Primal and Dual
Solutions 
C.2 
97100 


26 

Finding the arcs to enter
and Leave the Basis 
C.3 
101109 
HW 9 

27 

Networks with Upper Bounds 
138140 
110122 




Teach Network Addin for
Generalized Problems 




28 

Review 


HW 10 

29 

Review 






Final Exam 



