Combinatorial Algorithms for Portfolio Optimization Problems _ Case of Risk Moderate Investor

5th International Conference on Science & Engineering in Mathematics, Chemistry and Physics 2017

数学;化学;物理学

Juarna, A.^1

Gunadarma University, Jakarta, Indonesia^1

关键词: Aggregate risk;    Combinatorial algorithm;    Correlation coefficient;    Maximum ratio;    Negative correlation;    Optimal combination;    Portfolio optimization;    Stock exchange;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/820/1/012028/pdf
DOI  :  10.1088/1742-6596/820/1/012028

来源: IOP

【 摘 要 】

Portfolio optimization problem is a problem of finding optimal combination of n stocks from N ≥ n available stocks that gives maximal aggregate return and minimal aggregate risk. In this paper given N = 43 from the IDX (Indonesia Stock Exchange) group of the 45 most-traded stocks, known as the LQ45, with p = 24 data of monthly returns for each stock, spanned over interval 2013-2014. This problem actually is a combinatorial one where its algorithm is constructed based on two considerations: risk moderate type of investor and maximum allowed correlation coefficient between every two eligible stocks. The main outputs resulted from implementation of the algorithms is a multiple curve of three portfolio's attributes, e.g. the size, the ratio of return to risk, and the percentage of negative correlation coefficient for every two chosen stocks, as function of maximum allowed correlation coefficient between each two stocks. The output curve shows that the portfolio contains three stocks with ratio of return to risk at 14.57 if the maximum allowed correlation coefficient between every two eligible stocks is negative and contains 19 stocks with maximum allowed correlation coefficient 0.17 to get maximum ratio of return to risk at 25.48.