Linear Optimization 640:354:02
Course Outline
|
Date |
Topic |
Reading |
|
01/22 |
The Linear Programming Problem |
1.1 |
|
01/26 |
Matrix notation. Geometry of Linear Programming Problems |
1.2, 1.3 |
|
01/29 |
Geometry of Linear Programming Problems (continued). The Extreme Point Theorem. |
1.3, 1.4 |
|
02/02 |
Basic Solutions. |
1.5 |
|
02/05 |
Basic Solutions (continued) |
1.5 |
|
02/09 |
The Simplex Method for problems in standard form |
2.1 |
|
02/12 |
The Simplex Method for problems in standard form (continued).Degeneracy and cycling |
2.1, 2.2 |
|
02/16 |
Artificial variables |
2.3 |
|
02/19 |
Artificial variables (continued) |
2.3 |
|
02/23 |
Midterm Exam (covers sections 1.1-2.3) |
|
|
02/26 |
Duality. The Duality Theorem |
3.1, 3.2 |
|
03/01 |
The Duality Theorem(continued) |
3.2 |
|
03/04 |
Computational relations between the Primal and Dual problems |
3.3 |
|
03/08 |
The Dual Simplex Method |
3.4 |
|
03/11 |
The Revised Simplex Method. |
|
|
03/22 |
Sensitivity Analysis |
|
|
03/25 |
Examples of Integer Programming Problems. Cutting Plane Methods. |
4.1, 4.2 |
|
03/29 |
Cutting Plane Methods (continued). Branch and Bound Methods |
4.2, 4.3 |
|
04/01 |
Branch and Bound Methods (continued) |
4.3 |
|
04/05 |
Midterm Exam (covers sections 3.1-4.3) |
|
|
04/08 |
The Transportation Problem |
5.1 |
|
04/12 |
The Transportation Problem (continued) |
5.1 |
|
04/15 |
The Assignment Problem |
5.2 |
|
04/19 |
Graphs and Networks: basic definitions. The Maximal Flow Problem |
5.3, 5.4 |
|
04/22 |
The Maximal Flow Problem (continued) |
5.4 |
|
04/26 |
The Shortest Route Problem |
5.5 |
|
04/29 |
The Critical Path Method |
5.6 |
|
05/03 |
Review |
|
|
05/12 |
Final Exam (covers all material) |
|