MAT 3810 - Mathematics of Operations Research II (3)

Transportation and assignment problems. Network problems: shortest path, minimum spanning tree, maximum flow. The Network Simplex method. Introduction to PERT-CPM techniques. Introduction to dynamic programming. Integer programming. Nonlinear programming: Kuhn-Tucker conditions. Introduction to quadratic, separable, and convex programming. Introduction to game theory, Markov Chains, and queueing theory.

Prerequisite(s): MAT 380 or MAT 3800.
Component(s): Lecture
Grading Basis: Graded Only
Repeat for Credit: May be taken only once