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 |
|---|---|---|---|
|
Ladislav Stacho |
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 2:30–3:20 p.m.
|
Burnaby |
|
| D101 |
Jan 5 – Apr 11, 2016: Thu, 9:30–10:20 a.m.
|
Burnaby |
|
| D102 |
Jan 5 – Apr 11, 2016: Thu, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
| D103 |
Jan 5 – Apr 11, 2016: Thu, 4:30–5:20 p.m.
|
Burnaby |