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 |
Ladislav Stacho |
Mo, We, Fr 2:30 PM – 3:20 PM |
WMC 3260, Burnaby |
| D101 |
Tu 2:30 PM – 3:20 PM |
WMC 2830, Burnaby |
|
| D102 |
Tu 3:30 PM – 4:20 PM |
WMC 2830, Burnaby |
|
| D103 |
Tu 4:30 PM – 5:20 PM |
WMC 2830, Burnaby |