.png){kind=icon}
返回
Solving a savings allocation problem by numerical dynamic programming with shape-preserving interpolation
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(99)00044-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article introduces a bivariate shape-preserving interpolation algorithm to approximate the value function of a dynamic program. First, we present a savings allocation problem between a pension account and another non-pension one. With the objective of maximizing the present value of utility over a life cycle, the investor can distribute his or her savings, in each account, between stocks and cash funds. Formally, this complex problem involved with various tax rules is in dynamic programming formulation and can only be solved numerically. It is known that the value function of the associated two-dimensional dynamic program inherits monotonicity and convexity of the investor's risk-averse utility function. To preserve these shape characteristics, we apply a bivariate shape-preserving interpolation algorithm in the successive approximation of the value function. Finally, we have computational results for this savings allocation problem, showing that the proposed shape-preserving interpolation method is superior to other dynamic programming methods with less sophisticated interpolation techniques. Scope and purpose The savings allocation problems with several dimensions of continuous states are too complicated and thus can only be solved by numerical dynamic programming. Theory of dynamic programming has shown that the associated Value function inherits the shape characteristics - monotonicity and concavity - of a risk-averse investor's utility function. However, there are no numerical methods which guarantee to preserve these shape features in the course of approximation of the value function. In this article, we model a savings allocation problem as a two-dimensional dynamic program and we present a bivariate shape-preserving interpolation method to solve it. (C) 2000 Elsevier Science Ltd. All rights reserved.
Keyword:
dynamic programming
savings allocation
interpolation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Yield characteristics and morphometric relationships of giant freshwater prawn, Macrobrachium rosenbergii (de Man, 1879)大淡水鳌虾 Macrobrachium rosenbergii (de Man, 1879) 的产量特性与形态测量关系
PREAI
分享收藏A Method to Separate Two Main Antioxidants from Lepidium latifolium L. Extracts Using Online Medium Pressure Chromatography Tower and Two-Dimensional Inversion/Hydrophobic Interaction Chromatography Based on Online HPLC-DPPH Assay一种利用在线中压色谱塔和基于在线HPLC-DPPH测定的二维反相/疏水作用色谱从Lepidium latifolium L. 提取物中分离两种主要抗氧化剂的方法.png)
Separations
OAAI
SeparationsIF0
OAAI分享收藏An Improved Fireworks Algorithm for Integrated Flight Timetable and Crew Schedule Recovery Problem
PREAI
分享收藏Evaluation of genetic effect nphysiochemical properties changes of Wx near isogenic lines of Y58S in rice评价Y58S水稻中Wx近等基因系的遗传效应及理化性质变化
OAAI
OAAI分享收藏 没有更多内容
没有更多内容