Linear Optimization MATH 308 (3)
Linear programming modelling. The simplex method and its variants. Duality theory. Post-optimality analysis. Applications and software. Additional topics may include: game theory, network simplex algorithm, and convex sets. Prerequisite: MATH 150, 151, 154, or 157 and MATH 240 or 232. Quantitative.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Abraham Punnen |
Sep 5 – Dec 4, 2017: Wed, 1:30–2:20 p.m.
Sep 5 – Dec 4, 2017: Fri, 12:30–2:20 p.m. |
Surrey Surrey |
|
| D101 |
Sep 5 – Dec 4, 2017: Thu, 3:30–4:20 p.m.
|
Surrey |
|
| D102 |
Sep 5 – Dec 4, 2017: Thu, 9:30–10:20 a.m.
|
Surrey |