Operations Research I
Linear programming and its applications. Topics discussed include the following: the simplex method, the revised simplex method, computer implementation of linear programming, duality, dual simplex and primal dual algorithms, parametric analysis and postoptimality analysis. Applications are selected from: the transportation problem, the assignment problem, blending problems, inventory problems, activity analysis, game theory and network analysis.
Graduate course in the Computer Science program offered by the Faculty of Graduate Studies.