Course Descriptions
Undergraduate
Undergraduate/Available for Graduate Credit
Graduate and Advanced Undergraduate
Graduate Only
Undergraduate
OPRS 2111. Introduction to Operations Research. (3) Prerequisite:
MATH 1120 or 1141 and CSCI 1100 or 1201 and its lab. Modeling
and graph theory with applications to linear programming, critical
path analysis, transportation and allocation problems, and queuing
theory. (May not be taken for credit if credit for OPRS 3111 has
been given.) (On demand)
OPRS 3111. Operations Research: Deterministic Models. (3)
Prerequisites: MATH 1142 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 1142, 2164, and MATH/STAT 2121 or 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) (2-3G)
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) (3G) Prerequisites: OPRS 3111
and one of STAT 2122, MATH/STAT 3122, or OPRS 3113. The theory
of zerosum matrix games, mini-max theorem, optimal strategies,
symmetric games, economic models, infinite, separable, polynomial,
multi-stage, general-sum and n-person games. A project will be required
of all graduate students. (On demand)
OPRS 4114. Dynamic Programming. (3) (3G) Prerequisites:
CSCI 1100 or 1201 and its lab, 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)
OPRS 5111. Linear Programming. (3) (3G) Prerequisite: OPRS
3111 and CSCI 1100 or 1201 and 1201L. Mathematical formulation
and solution of linear programming problems. Topics include: the
simplex method and its variations, sensitivity and parametric
analysis, duality, and applications. A project will be required
for all graduate students. (On demand)
OPRS 5112. Non-Linear Programming. (3) (3G) Prerequisites:
CSCI 1100 or 1201 and 1201L, OPRS 3111 and MATH 2141. Basic unconstrained
optimization problems, search techniques, some discussion of rates
of convergence and an introduction to constrained optimization.
Computer implementation and testing of optimization algorithms
will be required. A project will be required of all graduate students.
(On demand)
OPRS 6101. Introduction to Operations Research. (3G) Prerequisite:
STAT 3122. Operations Research approach: modeling, constraints,
objective and criterion. The problem of multiple criteria, optimization,
model validation. The team approach. Systems design. Examples,
or methodology: mathematical programming, optimum seeking, simulation,
gaming, heuristic programming. Examples, or applications: theory
of inventory, economic ordering under deterministic and stochastic
demand. The production smoothing problem, linear and quadratic
cost functions. Waiting line problems: single and multiple servers
with Poisson input and output. The theory of games for two-person
competitive situations. Project management through probabilistic
activity networks and deterministic activity network (CPM-PERT).
(Fall)
OPRS 7125. Stochastic Processes. (3G) Same as MATH 7125.
Undergraduate/Available for Graduate Credit
Graduate and Advanced Undergraduate
Graduate Only
[UNCC CATALOG] [UNC Charlotte]
This page is maintained by The
Office of Academic Affairs