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.
Prerequisite(s): MATH 2152 or MATH 2107, or permission of the School.
Lectures three hours a week and one hour tutorial.
...such as MATH 0009 and MATH 0107 . The...grade of B+. PSYC 3801 must be successfully...
...grade of B+. PSYC 3801 must be successfully...ISCS, ISYS, ITEC, MAAE, MATH, MECH, NET, NEUR...