In this paper we consider two different mixed integer linear programming models for solving the single period portfolio selection problem when integer stock units, transaction costs and a cardinality constraint are taken into account. The first model has been formulated by using the maximization of the worst conditional expectation as objective function. The second model is based on the maximization of the safety measure corresponding to the mean absolute deviation. Extensive computational results are provided to compare the financial characteristics of the optimal portfolios selected by the two models on real data from European stock exchange markets. Some simple heuristics are also introduced that provide efficient and effective solutions when an optimal integer solution cannot be found in a reasonable amount of time.
A comparison of MAD and CVaR with side constraints
ANGELELLI, Enrico;MANSINI, Renata;SPERANZA, Maria Grazia
2008-01-01
Abstract
In this paper we consider two different mixed integer linear programming models for solving the single period portfolio selection problem when integer stock units, transaction costs and a cardinality constraint are taken into account. The first model has been formulated by using the maximization of the worst conditional expectation as objective function. The second model is based on the maximization of the safety measure corresponding to the mean absolute deviation. Extensive computational results are provided to compare the financial characteristics of the optimal portfolios selected by the two models on real data from European stock exchange markets. Some simple heuristics are also introduced that provide efficient and effective solutions when an optimal integer solution cannot be found in a reasonable amount of time.File | Dimensione | Formato | |
---|---|---|---|
JBF_2684-PUBLISHED.pdf
gestori archivio
Tipologia:
Full Text
Licenza:
DRM non definito
Dimensione
234.48 kB
Formato
Adobe PDF
|
234.48 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.