CM 340 Computational OptimizationComputational Mathematics (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 CO 352)
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 | 9/12 | 1 | 1 | B2 350 | 5137 | ||
| Held With: CO 350 | ||||||||
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 | 5/8 | 1 | 1 | MC 2065 | 3365 | ||
| Held With: CO 350 | ||||||||