MATH-231 Linear Optimization
An introduction to solving optimization problems involving linear functions subject to linear constraints (linear programming). Topics include the simplex method, duality theory, sensitivity analysis and integer programming. Features applications to business, economics, transportation, health care and other areas.
Standard Course (40)
Credits
1
Prerequisite
224 is required; 216 is recommended
Offered
Fall