M.A. Lejeune, Carnegie Mellon University
(SPEPS)
To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.
| edoc-Server der Humboldt-Universität zu Berlin |
| Author(s): |
P. Bonami, IBM TJ Watson Research Center M.A. Lejeune, Carnegie Mellon University | Title: | An Exact Solution Approach for Portfolio Optimization Problems under Stochastic and Integer Constraints |
| Date of Acceptance: | 29.05.2007 |
| Submission Date: | 08.02.2007 |
| Series Title: |
Stochastic Programming E-Print Series (SPEPS) |
| Editors: | Julie L. Higle; Werner Römisch; Surrajeet Sen |
| To appear in: | Operations Research |
| Metadata export:
To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.
|
Endnote Bibtex |
| Abstract (eng): | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| In this paper, we study extensions of the classical Markowitz’ mean-variance portfolio optimization model. First, we consider that the expected asset returns are stochastic by introducing a probabilistic constraint imposing that the expected return of the constructed portfolio must exceed a prescribed return level with a high confidence level. We study the deterministic equivalents of these models. In particular, we define under which types of probability distributions the deterministic equivalents are second-order cone programs, and give exact or approximate closed-form formulations. Second, we account for real-world trading constraints, such as the need to diversify the investments in a number of industrial sectors, the non-profitability of holding small positions and the constraint of buying stocks by lots, modeled with integer variables. To solve the resulting problems, we propose an exact solution approach in which the uncertainty in the estimate of the expected returns and the integer trading restrictions are simultaneously considered. The proposed algorithmic approach rests on a non-linear branch-and-bound algorithm which features two new branching rules. The first one is a static rule, called idiosyncratic risk branching, while the second one is dynamic and called portfolio risk branching. The proposed branching rules are implemented and tested using the open-source framework of the solver Bonmin. The comparison of the computational results obtained with standard MINLP solvers and with the proposed approach shows the effectiveness of this latter which permits to solve to optimality problems with up to 200 assets in a reasonable amount of time. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Access Statistics:
These data concerning access statistics for individual documents
have been compiled using the webserver log files aggregated by AWSTATS.
They refer to a monthly access count to the full text documents as well as to the entry page.
As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly. To see the detailled access numbers please move the mouse pointer over the single bars of the digaram. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Gesamtzahl der Zugriffe seit May 2011:
|
|
| |||
