Dynamic Programming
Download as PDF
Overview
Description
Optimization of multistage decision processes based upon the use of dynamic programming principle of optimality. The application of multidimensional maximization problems to scheduling, inventory, equipment replacement, warehousing, smoothing problems, routing, transportation, and combinatorial problems. The methods of successive approximation, policy iteration, and the optimal control of Markov processes will be presented.
Career
Graduate
Credits
Value
3
Max
3
Min
3
Course Count
1
Number Of Credits
3
Number Of Repeats
1
Repeatable
No
Contact Use
Yes
Generate Attendance
No
Left Use
Yes
Present Use
Yes
Reason Use
Yes
Tardy Use
Yes
Template Override
No
Time Use
Yes
Attendance Type
Class Meeting
Auto Create
No
Code
LEC
Instructor Contact Hours
3
Default Section Size
35
Final Exam Type
Yes
Include in Dynamic Date Calc
No
Instruction Mode
In Person
LMS File Type
Blackboard CourseInfo 4
Name
Lecture
OEE Workload Hours
0
Optional Component
No
Preferred Room Features
Academic Scheduling
Workload Hours
3