Home > Research > Publications & Outputs > Scenario generation for single-period portfolio...

Electronic data

  • 1511.04935v3

    Rights statement: Copyright © 2018, INFORMS

    Accepted author manuscript, 710 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

Scenario generation for single-period portfolio selection problems with tail risk measures: coping with high dimensions and integer variables

Research output: Contribution to journalJournal article

Published
<mark>Journal publication date</mark>2018
<mark>Journal</mark>INFORMS Journal on Computing
Issue number3
Volume30
Number of pages20
Pages (from-to)472-491
Publication statusPublished
Early online date21/09/18
Original languageEnglish

Abstract

In this paper we propose a problem-driven scenario generation approach to the single-period portfolio selection problem which use tail risk measures such as conditional value-at-risk. Tail risk measures are useful for quantifying potential losses in worst cases. However, for scenario-based problems these are problematic: because the value of a tail risk measure only depends on a small subset of the support of the distribution of asset returns, traditional scenario based methods, which spread scenarios evenly across the whole support of the distribution, yield very unstable solutions unless we use a very large number of scenarios. The proposed approach works by prioritizing the construction of scenarios in the areas of a probability distribution which correspond to the tail losses of feasible portfolios. The proposed approach can be applied to difficult instances of the portfolio selection problem characterized by high-dimensions, non-elliptical distributions of asset returns, and the presence of integer variables. It is also observed that the methodology works better as the feasible set of portfolios becomes more constrained. Based on this fact, a heuristic algorithm based on the sample average approximation method is proposed. This algorithm works by adding artificial constraints to the problem which are gradually tightened, allowing one to telescope onto high quality solutions.