This course emphasizes the applications of optimal solutions to linear algebraic systems using the simplex method of linear programming. This includes an in-depth development of the simplex method, the theory of duality, an analysis of the dual problem, convex hull concepts, integer programming, sensitivity analysis and the revised simplex procedure. Additional computational techniques that are applicable to specific mathematical models such as the transportation problem, assignment problem and network problems are also studied. Problems illustrating applications are emphasized throughout the course. Use of existing computer software to solve problems is also emphasized.
