Robust and reliable portfolio optimization formulation of a chance constrained problem

5Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We solve a linear chance constrained portfolio optimization problem using Robust Optimization (RO) method wherein financial script/asset loss return distributions are considered as extreme valued. The objective function is a convex combination of portfolio's CVaR and expected value of loss return, subject to a set of randomly perturbed chance constraints with specified probability values. The robust deterministic counterpart of the model takes the form of Second Order Cone Programming (SOCP) problem. Results from extensive simulation runs show the efficacy of our proposed models, as it helps the investor to (i) utilize extensive simulation studies to draw insights into the effect of randomness in portfolio decision making process, (ii) incorporate different risk appetite scenarios to find the optimal solutions for the financial portfolio allocation problem and (iii) compare the risk and return profiles of the investments made in both deterministic as well as in uncertain and highly volatile financial markets.

Cite

CITATION STYLE

APA

Sengupta, R. N., & Kumar, R. (2017). Robust and reliable portfolio optimization formulation of a chance constrained problem. Foundations of Computing and Decision Sciences, 42(1), 83–117. https://doi.org/10.1515/fcds-2017-0004

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free