CO 433ATopics in Linear Programming
- Faculty
- Mathematics
- Last listed
- 1980–81
No longer offered. It’s in Waterloo’s scanned calendars from 1979–80 to 1980–81; the 1995–96 to 2023–24 calendars are on ucalendar.
Review of duality theory, degeneracy, post-optimality analysis, revised simplex method. Generalized upper bounding. Integer and mixed-integer programming by cutting plane methods, branch-and-bound and implicit enumeration. (C & O 452a)
As printed in the 1979–80 to 1980–81 calendars, read by OCR; the scanned page is the original.
Requirements, as last listed
Prereq: C & O 331a
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1979–80 to 1980–81, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.
1979–80 to 1980–81 2 calendars
Review of duality theory, degeneracy, post-optimality analysis, revised simplex method. Generalized upper bounding. Integer and mixed-integer programming by cutting plane methods, branch-and-bound and implicit enumeration.
(C & O 452a)
Prereq: C & O 331a