Simulated annealing for complex portfolio selection problems

摘要: Abstract This paper describes the application of a simulated annealing approach to solution complex portfolio selection model. The model is mixed integer quadratic programming problem which arises when Markowitz’ classical mean–variance enriched with additional realistic constraints. Exact optimization algorithms run into difficulties in this framework and motivates investigation heuristic techniques. Computational experiments indicate that promising for class problems.