Sample Question #207 (applied math – optimization)
What is the Bellman’s Equation? Write out the formulation and show how it works.
Bellman’s Equation is the mathematical expression of a system of optimal control solutions called dynamic programming. Dynamic programming encompasses optimization problems that involve overlapping states across time, and Bellman’s equation expresses the relationship between the states. Bellman’s equation can be used to model many time series optimization problems, and it can often be solved using backwards recursion, i.e., assuming everything after t is already optimized, let’s optimize the variables at t.
For details, including what it looks like mathematically, follow the links above.
Fill in your details below or click an icon to log in:
You are commenting using your WordPress.com account. ( Log Out / Change )
You are commenting using your Twitter account. ( Log Out / Change )
You are commenting using your Facebook account. ( Log Out / Change )
You are commenting using your Google+ account. ( Log Out / Change )
Connecting to %s
Notify me of new comments via email.
Notify me of new posts via email.