A list of homework problems will be assigned. A selection of these problems will be asked to be handed in for marking approximately every two weeks. Students will be expected to do all of the assigned homework and read all the sections in the text that we cover. The term tests and final exam will be based on the (complete list of) homework problems, the material covered in class, the readings in the text, and any handouts I give. Homework will require the use of the LINDO/LINGO software package (this software comes with the text and is installed in all the computer labs; go to PROGRAMS -> MATH -> LINDO/LINGO).
| Topics | Approximate duration (weeks) |
|---|---|
| Review of linear algebra Chapter 2 | 1 |
| Operations Research and Linear Programming Chapters 1,3 | 1 |
| The Simplex Algorithm Chapter 4 | 2 |
| Sensitivity Analysis and Duality Chapter 6 | 2 |
| The Transportation and Assignment Problems Chapter 7 | 2 |
| Network Models Chapter 8 | 2 |
| Integer Programming Chapter 9 | 1 |
| Other topics as time permits: Interior point methods, complexity, Karmarkar's algorithm (Section 10.6) Game Theory (Chapter 15) CPM and PERT (Section 8.4) Nonlinear Programming; Quadratic Programming (Chapter 12) |
| Duration | Date | Weight | |
|---|---|---|---|
| Test 1 | 50 minutes | week of Feb. 17 | 15% |
| Test 2 | 50 minutes | week of Mar. 24 | 15% |
| Homework | bi-weekly | 35% | |
| Final Exam or Project | 3 hours | TBA | 35% |