Math 16 - Spring 2005
Dartmouth College
home
general information
syllabus
homework
office hours
professor
This is a tentative syllabus subject to change at my discretion without prior notification. This is to give you an idea of the topics I want you to learn.
Chapters |
Brief Description |
||
Week 1 |
1, 2 |
Linear Programming and the simplex method. |
|
Week 2 |
2, 3
|
Simplex method and degeneracy |
|
Week 3 |
3, 4 |
Analysis of the simplex method and the Dual problem. |
|
Week 4 |
5 |
The dual problem and weak and strong duality theorems. |
|
Week 5 |
6, 7 |
Matrix Notation and sensitivity issues. |
|
Week 6 |
8, 9, 11 |
Implementation Issues. General class of linear programs. Matrix
games. |
|
Week 7 |
11, 12, 13 |
Minimax theorem. Linear Regression. Network Flows. |
|
Week 8 |
13 |
Primal Network simplex Method. |
|
Week 9 |
13 |
Primal/Dual network simplex method and applications of network
flows. |
|
Week 10 |
22 |
Integer Programming. |