Skip to main content Accessibility help
×
Hostname: page-component-77c89778f8-m42fx Total loading time: 0 Render date: 2024-07-24T14:24:43.764Z Has data issue: false hasContentIssue false

4 - Stochastic Dynamic Programming

Published online by Cambridge University Press:  06 January 2010

Fwu-Ranq Chang
Affiliation:
Indiana University, Bloomington
Get access

Summary

Introduction

To solve a static, constrained optimization problem, we typically employ the Lagrange multiplier method. The solution to the problem is characterized by the first-order conditions of the Lagrange problem. To solve a stochastic, intertemporal optimization problem, the optimal control policy is characterized by the first-order conditions of the Bellman equation. In this chapter we shall introduce this method of dynamic optimization under uncertainty. One of the objectives is to make the reader feel as comfortable using the Bellman equation in dynamic models as using the Lagrange multiplier method in static models.

The chapter begins with a one-sector optimal growth model. We go through the derivation of the corresponding Bellman equation step by step to convey the mathematical reasoning behind this powerful tool using a real economic problem, not an abstract mathematical formulation. Then we examine the mathematical structure of the stochastic optimization problem, including the existence of the optimal control, the differentiability of the value function, the transversality condition, and the verification theorem. More importantly, we summarize the Bellman equation in a cookbook fashion to make it easy to use. To illustrate, we apply the Bellman equation to several well-known models, such as portfolio selection, index bonds, exhaustible resources, adjustment costs, and life insurance. To make the presentation self-contained, we provide a brief introduction to each topic.

Then, we extend the method from time-additive utility functions with a constant discount rate to a class of recursive utility functions.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Stochastic Dynamic Programming
  • Fwu-Ranq Chang, Indiana University, Bloomington
  • Book: Stochastic Optimization in Continuous Time
  • Online publication: 06 January 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511616747.006
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Stochastic Dynamic Programming
  • Fwu-Ranq Chang, Indiana University, Bloomington
  • Book: Stochastic Optimization in Continuous Time
  • Online publication: 06 January 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511616747.006
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Stochastic Dynamic Programming
  • Fwu-Ranq Chang, Indiana University, Bloomington
  • Book: Stochastic Optimization in Continuous Time
  • Online publication: 06 January 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511616747.006
Available formats
×