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. Quantitative.

Section Instructor Day/Time Location
D100 Abraham Punnen
Mo 2:30 PM – 4:20 PM
We 2:30 PM – 3:20 PM
REMOTE LEARNING, Burnaby
REMOTE LEARNING, Burnaby
D101 Th 3:30 PM – 4:20 PM
REMOTE LEARNING, Burnaby
D102 Th 9:30 AM – 10:20 AM
REMOTE LEARNING, Burnaby
D103 Th 4:30 PM – 5:20 PM
REMOTE LEARNING, Burnaby