This course is directed to students with major in computer science and applied mathematics. Introductory topics cover simplex methods (including two-phase, dual simplex, revised simplex, and Karmarkar's projective methods) and problems in network flows (including transportation, assignment, maximal flow, minimal cost problems).
Prerequisite: | MAT 223H, MAT 240H |
---|---|
Main textbook: | Linear Programming and Network Flows by M.S. Bazaraa, J.J. Jarvis, and H.D. Sherali (John Wiley & Sons, 1990) |
Other texts: |
Introduction to Mathematical Programming
by R.C. Walker (Prentice Hall, 1999) Elementary Linear Programming with Applications by B. Kolman and R.E. Beck (Academic Press, 1995) |
Marking scheme: |
Final exam (3 hrs) - 50%,
Mid-term test (100 min) - 30% nine Quizes (15min) - 10%, four assignments - 10% |
See Course Program for topics covered by lectures and sections of the main textbook.
Elementary introduction into linear programming is delivered in short summer course APM 235S.
Try online Interactive Quizes to check your progress and background: