Advanced Linear Programming MATH 808 (4)
Convex geometry, the simplex method and duality, pivot rules, degeneracy, decomposition and column generation methods, the complexity of linear programming and the ellipsoid algorithm, interior point methods for linear programming.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Zhaosong Lu |
Jan 5 – Apr 11, 2016: Wed, 3:30–5:20 p.m.
Jan 5 – Apr 11, 2016: Fri, 2:30–4:20 p.m. |
Surrey Surrey |