Semester Hours:3Periodically
Elements of matrix algebra, vector spaces and convex sets pertinent to the theory and application of linear programming (LP) models. Development of the simplex method and duality theory. The nature of solutions to systems of linear equations are related to LP complications and their resolution. Applications are extended to include the generalized LP problem, transportation, assignment and network problems.
Prerequisite(s)/Course Notes: MATH 072; CSC 016, 024 or approval of instructor.