This course exposes students to topics in Linear (LP) and Integer Programming (IP). Topics in LP are the Revised Simplex Method, Duality Theory, Sensitivity Analysis and the Dual Simplex Method. In IP, topics include formulating IP problems, and solving IP problems using the Branch-and-Bound Method, Implicit Enumeration and the Cutting Planes Method. This course also touches on modelling and solving multi-objective problems as Goal Programming problems.
Skill Level: Beginner