CO 355 Mathematical OptimizationCombinatorics and Optimization (2009-2010)
Linear optimization: feasibility theorems, duality, the simplex algorithm. Discrete optimization: integer linear programming, cutting planes, network flows. Continuous optimization: local and global optima, feasible directions, convexity, necessary optimality conditions.
Prerequisites: MATH 235 or 245, 237 or 247; Not open to General Mathematics students
Notes: CO 355 may be substituted for CO 350 whenever the latter is a requirement in an Honours plan. Offered: F
Sections For Fall 2009
| Lectures | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| Harvey, Nicholas James Alexande | 10:00-11:20 M T W Th F | 12/44 | 1 | 1 | DWE 3517 | 4772 | ||
Sections For Spring 2009
CO 355 is not held in Spring 2009