MS-E2148 - Dynamic optimization, 16.01.2019-09.04.2019
This course space end date is set to 09.04.2019 Search Courses: MS-E2148
Lecture 11 - Summary
Completion requirements
Two kinds of problems:
- Discrete time problems
- Continuous time problems
Two approaches:
- Dynamic Programming
- Calculus of variations
HJB equation is DP algorithm in continuous time problems
Bellman equation is DP algorithm for infinite horizon discounted, stationary problem
Calculus of variations was used in deriving necessary conditions for the control problem
Stochastics was only considered in discrete time problems