MATH 561
Linear Programming I
Formulation of problems from the private and public sectors using the mathematical model of linear programming. Development of the simplex algorithm; duality theory and economic interpretations. Postoptimality (sensitivity) analysis application and interpretations. Introduction to transportation and assignment problems; special purpose algorithms and advanced computational techniques. Students have opportunities to formulate and solve models developed from more complex case studies and to use various computer programs.
Prerequisites & course information
MATH 217, 417, or 419. (3). (BS). May not be repeated for credit. F, W, Sp.
Sources
- Course catalogue ↗2026-2027
- Catalogue entry ↗
Catalogue variants
- Linear Programming I · 3 · Graduate credit
- Linear Programming I · 3 · Undergraduate credit