This course introduces the theory and applications of linear programming. Topics include: the graphic method, the simplex algorithm, the revised simplex method, duality theory, and sensitivity analysis. Some special linear programming problems such as transportation, network flows, and game theory are explored. Prerequisites: MATH 2120 or MATH 2121 with a minimum grade of C
This course introduces the theory and applications of linear programming. Topics include: the graphic method, the simplex algorithm, the revised simplex method, duality theory, and sensitivity analysis. Some special linear programming problems such as transportation, network flows, and game theory are explored. Prerequisites: MATH 2120 or MATH 2121 with a minimum grade of C
