The objective of this course is to introduce the student to the principles, methods and uses of mathematics programming with particular emphasis in the formation and solution of linear programming problem. Topics include linear programming, the dual problem, sensitivity analysis, shadow pricing, integer programming. The transportation problem, network analysis, critical path analysis and decision trees.

Linear Programming models, Simplex method, revised simplex methods and project. Inverse quality theorem, Dual simplex method, Integer programming models, special problems, Parametric programming, Transportation problems and its applications, Game theory ( 2 persons, zero sum game

Practical Session: Assignment and Programming application using FORTRAN or any other programming language.

- Lecturer: Vincent Amenaghawon