Title :
Improved portfolio optimization with non-convex and non-concave cost using genetic algorithms
Author :
Zhang Lu ; Xiaoli Wang
Author_Institution :
Sch. of Econ. & Manage., Tongji Univ., Shanghai, China
Abstract :
In this paper, genetic algorithm is proposed to solve an improved portfolio optimization model effectively whose objective function is both non-convex and non-concave. The practical constraints, such as minimum trading unit, transaction cost and money limits, have been taken into consideration in this improved portfolio optimization model based on the traditional Markowitz model. The introduction of non-convex and nonconcave typical transaction costs makes the model more representative. This problem is a typical NP-hard problem because of the introduction of non-convex and non-concave objective function which can better meet the practical investment conditions. The empirical results of Chinese stock market have shown both the applicability of the improved model and the effectiveness of GA.
Keywords :
computational complexity; concave programming; convex programming; genetic algorithms; Chinese stock market; NP-hard problem; genetic algorithms; nonconcave cost; nonconcave typical transaction costs; nonconvex cost; nonconvex typical transaction costs; portfolio optimization model; traditional Markowitz model; Portfolios; Security; Stock markets; genetic algorithms; non-convex and non-concave transaction costs; portfolio optimization; trading unit;
Conference_Titel :
Mechatronic Sciences, Electric Engineering and Computer (MEC), Proceedings 2013 International Conference on
Conference_Location :
Shengyang
Print_ISBN :
978-1-4799-2564-3
DOI :
10.1109/MEC.2013.6885468