Operations Research I

Undergraduate

Deterministic O. R. models. Linear programming-graphical and simplex methods, duality theory. Transportation, assignment and network models. Sensitivity analysis. Integer programming, branch-and- bound and cutting plane methods, mixed IP algorithms, 0/1 programming. Use of LP and IP computer software programs. Dynamic programming-principle of optimality, stagecoach problems, recursive relationship. (Prerequisite: MATH-1270.) (3 lecture, 2 laboratory hours a week.)