首页 | 本学科首页   官方微博 | 高级检索  
     


Two Characterizations of Optimality in Dynamic Programming
Authors:Ioannis Karatzas  William D. Sudderth
Affiliation:1. Department of Mathematics, Columbia University, MailCode 4438, 2990 Broadway, New York, NY, 10027, USA
2. INTECH Investment Management LLC, One Palmer Square, Suite 441, Princeton, NJ, 08542, USA
3. School of Statistics, University of Minnesota, Minneapolis, MN, 55455, USA
Abstract:It holds in great generality that a plan is optimal for a dynamic programming problem, if and only if it is “thrifty” and “equalizing.” An alternative characterization of an optimal plan, that applies in many economic models, is that the plan must satisfy an appropriate Euler equation and a transversality condition. Here we explore the connections between these two characterizations.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号