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.
Similar content being viewed by others
References
A. Araujo and J.A. Scheinkman, Smoothness, comparative dynamics, and the turnpike property, Econometrica 45 (1977) 601–620.
A. Ben–Israel and S.D. Flåm, Input optimization for infinite horizon discounted programs, J. Optim. Th. Appl. 61 (1989) 347–357.
F.H. Clarke, Optimization and Nonsmooth Analysis (Wiley, New York, 1983).
F.H. Clarke, Yu.S. Ledyaev, R.J. Stern and P.R. Wolenski, Nonsmooth Analysis and Control Theory (Springer, New York, 1998).
A.D. Ioffe, Proximal analysis and approximate subdifferentials, J. London Math. Soc. 41 (1990) 175–192.
S. Iwamoto, Inverse theorem in dynamic programming (parts I, II, III), J. Math. Anal. Appl. 58 (1977) 113–134, 249–279, 439–448.
P. Samuelson, Foundations of Economic Analysis (Harvard University Press, Cambridge, 1948).
J.A. Scheinkman and L. Weiss, Borrowing constraints and aggregate economic activity, Econometrica 54 (1986) 23–45.
E. Silberberg, The Structure of Economics, A Mathematical Analysis, 2nd ed. (McGraw–Hill, New York, 1990).
H.R. Varian, Microeconomic Analysis (Norton, New York, 1992).
Fuan Zhao, Topics in optimization and optimal control, Ph.D. thesis in Operations Research, Rutgers University (October 1998).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhao, F., Ben-Israel, A. Envelope Theorems in Dynamic Programming. Annals of Operations Research 101, 383–390 (2001). https://doi.org/10.1023/A:1010978103974
Issue Date:
DOI: https://doi.org/10.1023/A:1010978103974