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 |
|---|---|---|---|
|
Luis Goddyn |
Jan 3 – Apr 10, 2018: Mon, 2:30–3:20 p.m.
Jan 3 – Apr 10, 2018: Wed, 2:30–3:20 p.m. Jan 3 – Apr 10, 2018: Fri, 2:30–3:20 p.m. |
Burnaby Burnaby Burnaby |
|
| D101 |
Jan 3 – Apr 10, 2018: Tue, 2:30–3:20 p.m.
|
Burnaby |
|
| D102 |
Jan 3 – Apr 10, 2018: Tue, 3:30–4:20 p.m.
|
Burnaby |
|
| D103 |
Jan 3 – Apr 10, 2018: Tue, 4:30–5:20 p.m.
|
Burnaby |