MATHEMATICS PROGRAMMING (4 Credits)

Learning Outcomes:

On successful completion of this course, students will be able to: build an mathematical model from real-life problems; solve the linear programming model using simplex method, dual simplex method, and apply the duality theory and sensitivity analysis in linear programming model; solve the problems related with integer programming model, transportation and assignment problems, network models, dynamic programming and non-linear programming; apply computer tools to obtain optimal solutions from a mathematical model.

Topics:

1. Introduction to Linear Programming;
2. The Simplex Method;
3. Duality Theory and Dual Simplex Method;
4. Linear Programming under Uncertainty;
5. The Transportation and Assignment Problems;
6. Network Optimization Models;
7. Dynamic Programming;
8. Integer Programming;
9. Nonlinear Programming.