Simulated annealing for complex portfolio selection problems

被引:218
作者
Crama, Y
Schyns, M
机构
[1] Univ Namur, Dept Business Adm, B-5000 Namur, Belgium
[2] Univ Liege, Sch Business Adm, B-4000 Liege, Belgium
基金
美国国家科学基金会;
关键词
finance; simulated annealing; metaheuristics; portfolio selection; quadratic programming;
D O I
10.1016/S0377-2217(02)00784-1
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:546 / 571
页数:26
相关论文
共 27 条
[1]  
AARTS E, 1997, LOCAL SEARCH COMBINA
[2]  
[Anonymous], 1984, PORTFOLIO INVESTMENT
[3]   Computational study of a family of mixed-integer quadratic programming problems [J].
Bienstock, D .
MATHEMATICAL PROGRAMMING, 1996, 74 (02) :121-140
[4]  
CATANAS F, 1998, NEIGHBOURHOOD STRUCT
[6]   Heuristics for cardinality constrained portfolio optimisation [J].
Chang, TJ ;
Meade, N ;
Beasley, JE ;
Sharaiha, YM .
COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (13) :1271-1302
[7]  
*COMP SCI ED PROJ, 1995, MATH OPT
[8]  
CONSTANTINIDES GM, 1995, FINANCE, P1
[9]  
DAHL H, 1996, FINANCIAL OPTIMIZATI, P3
[10]   GLOBAL OPTIMIZATION AND SIMULATED ANNEALING [J].
DEKKERS, A ;
AARTS, E .
MATHEMATICAL PROGRAMMING, 1991, 50 (03) :367-393