Authors
1 Graduate Student, Industrial Engineering, Sharif University of Technology
2 Associate Professor, Faculty of Industrial Engineering; Sharif University of Technology
Abstract
One of the classical applications of operation research in investment decision making is the portfolio selection problem. In this problem a fixed sum of money is to be spread among different investments and there is a risk associated with the rate of return on each investment. The object of the portfolio selection problem is to determine how much money should be allocated to each investment to maximize the total expected return and minimize the portfolio’s risk. Since there is no specific algorithm to find an optimal feasible solution for large scale portfolio problems, in this paper two genetic algorithms are developed to find a near optimal solution. In the first algorithm the selection of investments is determined and in the second one the weight of each investment in the portfolio is calculated. Finally, the two algorithms have been applied successfully to the portfolio of stocks of the Tehran Stock Exchange with more than 200 stocks.
Keywords
)