|
Prerequisites: MATH 231. Offered every 3 semesters. Network flows, minimal- cost network flows, maximal-flow problems. Critical-path methods and PERT. Non linear programming. Deterministic and probabilistic inventory theory. Deterministic and probabilistic dynamic programming. |