Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its more practical and realistic variants, which include various kinds of constraints and objectives, have in many cases to be tackled by approximate algorithms. In this work, we present a hybrid technique that combines a local search, as master solver, with a quadratic programming procedure, as slave solver. Experimental results show that the approach is very promising and achieves results comparable with, or superior to, the state of the art solvers.
Hybrid Local Search for Constrained Financial Portfolio Selection Problems / Di Gaspero, L.; di Tollo, G.; Roli, Andrea; Schaerf, A.. - STAMPA. - 4510:(2007), pp. 44-58. (Intervento presentato al convegno Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems 4th International Conference, CPAIOR 2007 tenutosi a Brussels (Belgium) nel May 23-26, 2007).
Hybrid Local Search for Constrained Financial Portfolio Selection Problems
ROLI, ANDREA;
2007
Abstract
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its more practical and realistic variants, which include various kinds of constraints and objectives, have in many cases to be tackled by approximate algorithms. In this work, we present a hybrid technique that combines a local search, as master solver, with a quadratic programming procedure, as slave solver. Experimental results show that the approach is very promising and achieves results comparable with, or superior to, the state of the art solvers.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
