Envelope Theorems in Dynamic Programming

Fuan Zhao () and Adi Ben-Israel ()

Annals of Operations Research, 2001, vol. 101, issue 1, 383-390

Abstract: The envelope theorem is a statement about derivatives along an optimal trajectory. In dynamic programming the envelope theorem can be used to characterize and compute the optimal value function from its derivatives. We illustrate this here for the linear-quadratic control problem, the resource allocation problem, and the inverse problem of dynamic programming. Copyright Kluwer Academic Publishers 2001

Keywords: envelope theorem; dynamic programming; resource allocation; inverse problem (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1010978103974 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:101:y:2001:i:1:p:383-390:10.1023/a:1010978103974

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1010978103974

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().