Fall 2026 - MATH 308 D100
Linear Optimization (3)
Class Number: 4489
Delivery Method: In Person
Overview
-
Course Times + Location:
Sep 9 – Dec 7, 2026: Mon, Wed, Fri, 2:30–3:20 p.m.
Burnaby
-
Instructor:
Petr Lisonek
plisonek@sfu.ca
-
Prerequisites:
MATH 150, 151, 154, or 157 and MATH 240 or 232, all with a minimum grade of C-.
Description
CALENDAR DESCRIPTION:
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.
COURSE DETAILS:
Couse topics: Theory and applications of linear programming, geometric and computational considerations, networks, applications of duality.
Outline:1. Linear Programming.
Examples - formulation of optimization problems as linear programming problems. Canonical forms for linear programming problems. Polyhedral convex sets.
2. The Simplex Algorithm.
Tucker Tableaus. The simplex algorithm for maximum tableaus and minimum tableaus. Cycling.
3. Noncanonical Linear Programming Problems.
Unconstrained variables. Equations as constraints.
4. Duality Theory
The dual simplex algorithm. Complementary slackness. The duality theorem.
5. Application: Matrix Games.Linear Programming formulation of matrix games. The von Neumann minimax theorem.
6. Other applications (as time permits).
Grading
- Homework (6) (3.33% each) 20%
- Midterm 30%
- Final 50%
NOTES:
THE INSTRUCTOR RESERVES THE RIGHT TO CHANGE ANY OF THE ABOVE INFORMATION.
Students should be aware that they have certain rights to confidentiality concerning the return of course papers and the posting of marks.
Please pay careful attention to the options discussed in class at the beginning of the semesters.
REQUIREMENTS:
Materials
REQUIRED READING:
Linear Programming and Its Applications
Strayer, James K.
Springer
Single-user access to ebook available at the SFU Library.
ISBN: 9780387969305
RECOMMENDED READING:
Linear Programming And Network Flows
Bazaraa, Jarvis, Sherali
Available as an ebook at the SFU Library.
Department Undergraduate Notes:
Final Examinations: Students are expected to remain available for the entire final examination period published in the Academic Calendar. Travel, employment, and other personal commitments should be planned accordingly. Such commitments do not normally constitute grounds for alternative examination arrangements.
Registrar Notes:
ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS
At SFU, you are expected to act honestly and responsibly in all your academic work. Cheating, plagiarism, or any other form of academic dishonesty harms your own learning, undermines the efforts of your classmates who pursue their studies honestly, and goes against the core values of the university.
To learn more about the academic disciplinary process and relevant academic supports, visit:
- SFU’s Academic Integrity Policy: S10-01 Policy
- SFU’s Academic Integrity website, which includes helpful videos and tips in plain language: Academic Integrity at SFU
RELIGIOUS ACCOMMODATION
Students with a faith background who may need accommodations during the term are encouraged to assess their needs as soon as possible and review the Multifaith religious accommodations website. The page outlines ways they begin working toward an accommodation and ensure solutions can be reached in a timely fashion.