MAT3202 Linear Programing

This course introduces Linear Programming in solving mathematical problems and the topics covered include: Geometric Solution to LP Problem; The Simplex Method; The Dual Problem; and Post Optimality Analysis.

Course Objectives 
By the end of the course, learners should be able to:

• Formulate linear models from a given problem
• Solve a two-variable problem using geometric method
• Demonstrate knowledge of the constraint set 
• Solve the problem using the simplex method
• Solve problems using dual simplex and the primal dual methods
• Analyze the solution to the problem for sensitivity

Expected Learning Outcome 

• To discuss the basic competence in the concepts, principle, procedures and application of Linear Programming with continued emphasis on geometric interpretation and the use of a graphing calculator technology, when appropriate.
• To encourage orderliness, speed and accuracy in the presentation of mathematics.
• To help learners acquire the skills of expression in proper mathematical language and using mathematical symbols correctly.
• To provide instruction that contributes to the learners’ abilities to think critically and solve real life problems, to reason mathematically and apply computational skills.
• To build a strong foundation in calculus as preparation for subsequent courses in mathematics and other sciences.