MA 417
Linear Programming
3 Credit Hours
This course is an in-depth review convex Analysis, mathematical modeling of LP problems, Graphical solution methods for LP problems, General LP problem. Methods of solving LP problems including Simplex algorithm, two-phase simplex algorithm, and revised simplex algorithm, duality in LP problems, duality theorems, applications of duality, transportation problem, and assignment problem. Prerequisite(s) MA310 Linear Algebra