CSC 445

Operations Research: Linear Programming

Units: 1.5

Hours: 3-0

Formerly: 448A

An introduction to linear programming and its applications. Topics include: the simplex method, the revised simplex method, computer implementations, duality. Optional topics include: parametric and sensitivity analysis, primal-dual algorithm, network simplex method, the network flow problem, and game theory. Typical applications include: fitting curves to data, the transportation problem, inventory problems and blending problems.

Note:

  • Credit will be granted for only one of CSC 445, CSC 448A.

Prerequisites:

Undergraduate course in Computer Science offered by the Department of Computer Science in the Faculty of Engineering.

Schedules:
Summer Fall Spring

Note that not all courses are offered in every term. If a course is not offered, the schedule page will alert you that "No classes were found that meet your search criteria."