| |
Jun 17, 2024
|
|
|
|
|
OPRS 4114 - 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, discrete-time optimal control, replacement models, and inventory systems. A project is required of all graduate students.
Credit Hours: (3)
Prerequisite(s): ITCS 1214; OPRS 3111 ; and MATH 3122 , OPRS 3113 , STAT 2122 , or STAT 3122 .
Most Recently Offered (Day): Fall 2016
Most Recently Offered (Evening): Course has not been offered at this time in the past 3 years
Schedule of Classes
Add to Catalog Bookmarks (opens a new window)
|
|
