OPRS 3111. Operations Research: Deterministic Models. (3) Prerequisites: MATH 1242 and 2164. Linear, integer and dynamic programming, the simplex method, networks, PERT and CPM techniques, game theory, and applications. (On demand) 

OPRS 3113. Operations Research: Probabilistic Models. (3) Prerequisite: MATH 1242, 2164, and  STAT 2122 or MATH/STAT 3122, or consent of the Department. Queueing models, inventory models, simulation, markov chains, decision analysis, game theory and probabilistic dynamic programming. (On demand)  

OPRS 4010. Topics in Decision Mathematics. (2‑3)  Prerequisite: Consent of the Department. Topics in decision mathematics selected to supplement regular course offerings in this area of mathematics. May be repeated for additional credit with the approval of the Department. Credit for the M.A. degree in Mathematics requires approval of the Department. (On demand) 

OPRS 4113. Game Theory. (3) Prerequisites: OPRS 3111 and one of STAT 2122, MATH/STAT 3122, or OPRS 3113. The theory of zero‑sum matrix games, mini‑max theorem, optimal strategies, symmetric games, economic models, infinite, separable, polynomial, multi‑stage, general‑sum and in‑person games. A project will be required of all graduate students. (On demand)  

OPRS 4114. Dynamic Programming. (3) Prerequisites: ITCS 1214, OPRS 3111, and one of STAT  2122, MATH/STAT 3122 or OPRS 3113. The identification of dynamic programming problems and their solution in terms of recurrence relations. Elementary path problems, resource allocation, shortest path, traveling salesmen problem, discrete‑time optimal control, replacement models, and inventory systems. A project will be required of all graduate students. (On demand)