.png){kind=icon}
.png){kind=icon}
Return
Simulated annealing for complex portfolio selection problems
.png){kind=icon}
OA
AI
DOI：10.1016/S0377-2217(02)00784-1.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper describes the application of a simulated annealing approach to the solution of a complex portfolio selection model. The model is a mixed integer quadratic programming problem which arises when Markowitz' classical mean-variance model is enriched with additional realistic constraints. Exact optimization algorithms run into difficulties in this framework and this motivates the investigation of heuristic techniques. Computational experiments indicate that the approach is promising for this class of problems. (C) 2003 Elsevier B.V. All rights reserved.
Keywords:
finance
simulated annealing
metaheuristics
portfolio selection
quadratic programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available