CO 352 Computational OptimizationCombinatorics and Optimization (2009-2010)
A first course in computational optimization. Linear optimization, the simplex method, implementation issues, duality theory. Introduction to computational discrete and continuous optimization. [Offered: F,S]
Prerequisites: AMATH 341/CM 271/CS 371 and MATH 239 or 249; Not open to General Mathematics students.
Antirequisites: CO 350
Notes: (Cross-listed with CM 340)
Sections For Fall 2009
CO 352 is not held in Fall 2009
Sections For Spring 2009
CO 352 is not held in Spring 2009