.png){kind=icon}
返回
Parametric concavity in stochastic dynamic programs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2011.02.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study a family of dynamic programs that are characterized by a deterministic vector of cost parameters. We show that if the single period cost function is concave with respect to this vector, then the optimal costs of the family of dynamic programs are also concave in the vector of costs. We also establish that the optimal cost inherits other properties, namely, super-additivity, +infinity-star-shaped, 0-star-shaped, concavity-along-rays and monotonicity. When the vector of cost parameters evolves as a stochastic process and the single period cost is concave with respect to this vector, we show that the optimal cost is bounded above by the optimal cost for the dynamic program in which these stochastic cost parameters are replaced by their expectations in each period. We provide examples to illustrate how our results can be used to derive bounds which are either easy to compute or have analytical expressions. We also explain why such bounds are useful. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Dynamic programming
Inventory
Concavity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
.png){kind=icon}
没有更多内容