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 |
Abraham Punnen |
Mo 2:30 PM – 4:20 PM We 2:30 PM – 3:20 PM |
SRYC 2740, Surrey SRYC 2740, Surrey |
| D101 |
Th 3:30 PM – 4:20 PM |
SRYC 2750, Surrey |
|
| D102 |
Th 9:30 AM – 10:20 AM |
SRYC 2750, Surrey |