MAT 380 - Mathematics of Operations Research (4)

Introduction to mathematics of linear programming (LP): algebra and geometry of simplex method, solution of LP problems by Gauss-Jordan elimination method. Duality theory and sensitivity analysis. Development of revised and dual simplex algorithms. Introduction to parametric and separable convex programming. Applications of LP: computational considerations, case studies.

Prerequisite(s): C or better in MAT 208 and MAT 215 or consent of instructor.
Component(s): 4 lecture/problem-solving.
When Offered: F, even years