|
Course Discription |
:
* Foundation of linear programming, graphical solutions, simplex method, M technique and the two phase methods, duality, dual simplex method, sensitivity, integer programming, transportation and assignment problems, network minimization, shortest route and maximal flow problems.
|