Linear Programming

Catalog description

Maximize and minimize linear functions subject to constraints consisting of linear equations and inequalities. Define linear optimization models from problem description. Solve linear programming problems using the simplex method. Conduct duality and sensitivity analysis for linear programming. Prerequisite: minimum grade of 2.0 in STMATH 208 or MATH 208; minimum grade of 2.0 in STMATH 126 or MATH 126; and one of the following: (1) minimum grade of 2.0 in CSE 122 or CSE 142; (2) minimum grade of 2.0 in either both CSS 123 and CSSSKL 123, both CSS 132 and CSSSKL 132, or both CSS 142 and CSSSKL 142.