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: MA100* (or MA130), MA122, at least one half-credit 200-level Mathematics course, a half-credit involving Fortran (or Pascal) programming (or permission of the Department).