Computer Science (CSC) Courses>Operations Research: Linear Programming

CSC445 - Operations Research: Linear Programming

Description

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.

Units

1.5

Hours: lecture-lab-tutorial

3-0-0

Note(s)

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

Prerequisites

  • Complete all of the following
    • Complete all of:
      • CSC225 - Algorithms and Data Structures I (1.5)
    • Complete 1 of:
      • MATH110 - Matrix Algebra for Engineers (1.5)
      • MATH211 - Matrix Algebra I (1.5)
    • minimum third-year standing.

Course offered by

Department of Computer Science

Course schedules

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

Use the buttons below to search the timetable. If the search results show 0 classes and the message ‘Please search again’, then the class is not scheduled for the selected term.