Course Description

MA335 Introduction to Operations Research 0.5

Linear programming; Simplex algorithm and applications; special linear programming problems including transportation, transshipment, optimal assignment, network flow, minimal spanning tree, shortest path, PERT, and travelling salesman; dynamic programming; introduction to integer programming and non-linear programming. Projects involving practical use of Operations Research techniques will constitute part of the course requirements.††

Prerequisite: MA122, at least one half-credit 200 level Mathematics course, a half-credit course involving Fortran or Pascal programming and one of MA100*, MA102, MA105 or MA130 (or permission of the Department).

1996-1998 Undergraduate Calendar Addendum