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. [Note: CO 255 may be substituted for CO 250/350 whenever the latter is a requirement in an Honours plan. Offered: F] Prereq: MATH 235 or 245, 237 or 247; Not open to General Mathematics students. Antireq: CO 227, CO 250/CM 340, CO 350, 352, 355
