3 Credit Hour Course
Intended For Level 0 Term 0 Students
Prerequisite:
Basic concept of Mathematical Programming, Concepts of linear and quadratic programming, Convexity, Convex sets and convex functions, Concept of integer programming, Some examples of integer programming problems, Linear programming techniques, Graphical solution of linear programming problems, Simplex method, Dual simplex method, Different integer programming techniques, Revised simplex method.
