Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/267625 
Year of Publication: 
2019
Citation: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 15 [Issue:] 2 [Publisher:] Springer [Place:] Heidelberg [Year:] 2019 [Pages:] 207-219
Publisher: 
Springer, Heidelberg
Abstract: 
In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a nested robustness-based portfolio optimization formulation using the moment bounding approach-based representation of epistemic uncertainty. The nested robust portfolio formulation is simple to implement; however, the computational cost is often high due to the epistemic analysis performed inside the optimization loop. A decoupled approach is then proposed to un-nest the robustness-based portfolio optimization from the analysis of epistemic variables to achieve computational efficiency. This paper also proposes a single-loop robust portfolio optimization formulation using the likelihood-based representation of epistemic uncertainty that completely separates the epistemic analysis from the portfolio optimization framework and thereby achieves further computational efficiency. The proposed robust portfolio optimization formulations are tested on real market data from five S&P 500 companies, and performance of the robust optimization models is discussed empirically based on portfolio return and risk.
Subjects: 
Robust Optimization
Portfolio Optimization
Epistemic Uncertainty
Maximum Likelihood Estimation
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.