|
PowerPoints
Chapter 1 & 2
Chapter 3
Intro (3.1-3.3)
Examples (3.4-3.5)
S0lver (3.6)
Sample worksheet
Chapter 4
Simplex Method (4.1-4.3)
Procedure (4.4-4.5)
Adapting Forms (4.6) Chapter
5
Foundation (5.1)
Revised Simplex Method
(5.2) Chapter
6
Duality (6.1-6.2)
Duality (6.3-6.4)
Duality (6.5-6.7)
Solver (6.8) Chapter
8
Transportation (8.1)
Transportation (8.2)
Initial Solution Methods Chapter
9
Shortest Path (9.2-9.3)
Maximum Flow (9.4-9.5)
Traveling Salesman
Chapter 10
Dynamic Programming
Chapter 11
Integer Programming
Queueing Theory
|
Schedule
Schedule and Homework
Assignments
Practice Tests |