Print and PDF Options

MATH 3801 [0.5 credit] Linear Programming

Systems of linear inequalities, formulation of linear programming problems, geometric method, the simplex method, duality theory, complementary slackness, sensitivity analysis, branch-and-bound method and cutting plane method for integer linear programming, applications and extensions.
Precludes additional credit for ECON 4004, SYSC 3200.
Prerequisite(s): MATH 1102 or MATH 2107, or permission of the School.
Lectures three hours a week and one hour tutorial.