MATH 417 — Linear Optimization

An introduction to linear optimization and its applications: Duality theory, fundamental theorem, sensitivity analysis, convexity, simplex algorithm, interior-point methods, quadratic optimization, applications in game theory.

• Rating: 4.34 out of 5 from 58 student reviews
• Difficulty: 3.66 out of 5
• Credits: 3
• Faculty: Faculty of Science
• Department: Mathematics and Statistics
• Taught by: Tim Hoheisel
• Prerequisites: COMP 202, and MATH 223 or MATH 236, and MATH 314 or equivalent

Sections offered

• Section 001 (Lec), Tue Thu 11:35 am-12:55 pm — 1 seats open