CO 350 Linear OptimizationCombinatorics and Optimization (2009-2010)
A first course in optimization, emphasizing optimization of linear functions subject to linear constraints (linear programming). Problem formulation. Duality theory. The simplex method. Sensitivity analysis.
Prerequisites: MATH 115 or 136 or 146; Not open to General Mathematics students.
Antirequisites: CO 227, CO 352/CM 340, CO 355
Notes: Offered at St. Jerome's University in the Fall term. CO 355 may be substituted for CO 350 whenever the latter is a requirement in an Honours plan. Offered: F,W,S
Also offered at St. Jerome's University
Also offered at St. Jerome's University
Sections For Fall 2009
| Lectures | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| Cunningham, William | 10:30-11:20 M T W Th F | 67/72 | 2 | 2 | B2 350 | 4778 | ||
| Held With: CM 340 | ||||||||
| Cheriyan, Joseph | 10:00-11:20 M T W Th F | 78/90 | 1 | 1 | MC 2035 | 4777 | ||
Sections For Spring 2009
| Lectures | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| Teske, Edlyn E | 10:30-11:20 M T W Th F | 153/150 | 2 | 2 | MC 2065 | 3142 | ||
| Held With: CM 340 | ||||||||
| Tuncel, Levent | 01:00-02:20 M T W Th F | 146/147 | 1 | 1 | MC 1085 | 3141 | ||