| |
Dec 13, 2025
|
|
|
|
|
OPRS 5114 - Dynamic Programming
The identification of dynamic programming problems and their solution in terms of recurrence relations. Elementary path problems, resource allocation, shortest path, traveling salesmen problem, discretetime optimal control, replacement models and inventory systems. A project will be required of all graduate students.
Credit Hours: (3)
Prerequisite(s): ITCS 1214, OPRS 3111, and one of STAT 2122, MATH/STAT 3122 or OPRS 3113.
Schedule of Classes
Add to Catalog Bookmarks (opens a new window)
|
|