Course:
Course Number:    
Linear Programming
187    
Description:
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.
Prerequisites:
Credits:    
MATH 20, CSC 16
3    


Close