CSC 545

Operations Research I

Units: 1.5

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.

Fall 2019 Spring 2020 Summer 2020

Summer timetable available: February 15. Fall and Spring timetables available: May 15.

Before these dates the class schedule will show "No classes were found that meet your search criteria". If this message is shown after these dates, the course is not scheduled for the selected term.