Dynamic portfolio optimization with risk control for absolute deviation model

In this paper, we present a new multiperiod portfolio selection with maximum absolute deviation model. The investor is assumed to seek an investment strategy to maximize his/her terminal wealth and minimize the risk. One typical feature is that the absolute deviation is employed as risk measure inst...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 201; číslo 2; s. 349 - 364
Hlavní autoři: Yu, Mei, Takahashi, Satoru, Inoue, Hiroshi, Wang, Shouyang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.03.2010
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Absolute deviation
Applied sciences
Dynamic programming
Exact sciences and technology
Investment policy
Linear programming
Mathematical programming
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Portfolio management
Portfolio optimization
Portfolio optimization Linear programming Absolute deviation Dynamic programming
Portfolio theory
Risk aversion
Risk theory. Actuarial science
Studies
Portfolio optimization
Linear programming
Absolute deviation
Dynamic programming
Modeling
Terminal
Dynamic method
Exact solution
Optimal strategy
Portfolio selection
Risk management
Portfolio management
Investment
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we present a new multiperiod portfolio selection with maximum absolute deviation model. The investor is assumed to seek an investment strategy to maximize his/her terminal wealth and minimize the risk. One typical feature is that the absolute deviation is employed as risk measure instead of classical mean variance method. Furthermore, risk control is considered in every period for the new model. An analytical optimal strategy is obtained in a closed form via dynamic programming method. Algorithm with some examples is also presented to illustrate the application of this model.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2009.03.009