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 |
|---|---|---|---|
|
Masood Masjoody |
Sep 3 – Dec 2, 2019: Tue, 4:30–5:20 p.m.
Sep 3 – Dec 2, 2019: Thu, 3:30–5:20 p.m. |
Burnaby Burnaby |
|
| D201 |
Sep 3 – Dec 2, 2019: Wed, 10:30–11:20 a.m.
|
Burnaby |
|
| D202 |
Sep 3 – Dec 2, 2019: Wed, 3:30–4:20 p.m.
|
Burnaby |
|
| D203 |
Sep 3 – Dec 2, 2019: Wed, 4:30–5:20 p.m.
|
Burnaby |