Dynamic Programming
(Same as Electrical and Computer Engineering M237.) Lecture, four hours; outside study, eight hours. Recommended requisite: Electrical and Computer Engineering 232A or 236A or 236B. Introduction to mathematical analysis of sequential decision processes. Finite horizon model in both deterministic and stochastic cases. Finite-state infinite horizon model. Methods of solution. Examples from inventory theory, finance, optimal control and estimation, Markov decision processes, combinatorial optimization, communications. Letter grading.
Review Summary
- Clarity
-
N/A
- Organization
-
N/A
- Time
-
N/A
- Overall
-
N/A
Enrollment Progress
Enrollment data not available.
Course
Previous Grades
Grade distributions not available.