Please note:
To view the current Academic Calendar, go to www.sfu.ca/students/calendar.html.
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, all with a minimum grade of C-. Quantitative.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
| D100 |
Luis Goddyn |
Sep 4 – Dec 3, 2024: Mon, Wed, Fri, 1:30–2:20 p.m.
Oct 15, 2024: Tue, 1:30–2:20 p.m. |
Burnaby Burnaby |
| D101 |
Sep 4 – Oct 11, 2024: Tue, 2:30–3:20 p.m.
Oct 16 – Dec 3, 2024: Tue, 2:30–3:20 p.m. |
Burnaby Burnaby |
|
| D102 |
Sep 4 – Oct 11, 2024: Tue, 3:30–4:20 p.m.
Oct 16 – Dec 3, 2024: Tue, 3:30–4:20 p.m. |
Burnaby Burnaby |
|
| D103 |
Sep 4 – Oct 11, 2024: Tue, 4:30–5:20 p.m.
Oct 16 – Dec 3, 2024: Tue, 4:30–5:20 p.m. |
Burnaby Burnaby |