26 Genetic algorithms for portfolio selection problems with minimum transaction lots外文电子书籍.pdfVIP

European Journal of Operational Research 185 (2008) 393–404 /locate/ejor O.R. Applications Genetic algorithms for portfolio selection problems with minimum transaction lots Chang-Chun Lin a,*, Yi-Ting Liu b a Department of Information Management, Chang Gung University, 259 Wen-Hwa 1st Road, Kwei-Shan, Tao-Yuan 333, Taiwan, ROC b Institute of Information Management, National Chiao Tung University, 1001 Ta Hsueh Road, Hsinchu 300, Taiwan, ROC Received 12 March 2006; accepted 11 December 2006 Available online 11 January 2007 Abstract Conventionally, portfolio selection problems are solved with quadratic or linear programming models. However, the solutions obtained by these methods are in real numbers and difficult to implement because each asset usually has its min- imum transaction lot. Methods considering minimum transaction lots were developed based on some linear portfolio opti- mization models. However, no study has ever investigated the minimum transaction lot problem in portfolio optimization based on Markowitz’ model, which is probably the most well-known and widely used. Based on Markowitz’ model, this study presents three possible models for portfolio selection problems with minimum transaction lots, and devises corre- sponding genetic algorithms to obtain the solutions. The results of the empirical study show that the portfolios obtained using the proposed algorithms are very close to the efficient frontier, indicating that the proposed method can obtain near optimal and also practically feasible solutions to the portfolio selection problem in an acceptable short t