CS 412 Linear Programming & Convex Optimization
Linear programming and convex optimization as a paradigm for designing algorithms to solve complex problems.Prerequisites: Math 343. CS 312 is recommended, but not essential.
Course Objectives »
| Credits: | 3 |
|---|---|
| Prerequisites: | CS 312, Math 313 |
Alert: There are no offerings of this course for Fall 2009
| 2010 | 2011 | 2012 | 2013 | ||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Win | Spr | Sum | Fall | Win | Spr | Sum | Fall | Win | Spr | Sum | Fall | Win | Spr | Sum | Fall |
 |
|
|
|
 |
|
|
|
|
|
|
|
|
|
|
|
Note: Course websites may not be maintained for previous semesters.
| Offerings from the past year | |||||
|---|---|---|---|---|---|
| Semester | Instructor | Website | |||
| Winter 2009 | Warnick, Sean | ||||