Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4959425 | European Journal of Operational Research | 2018 | 31 Pages |
Abstract
Due to the definition of second-order stochastic dominance (SSD) in terms of utility theory, portfolio optimization with SSD constraints is of major practical interest. We contribute to the field in two ways: first, we present a self-contained theory with some new results and new proofs of known results; second, we perform a set of tests for computational efficiency. We provide new and simple arguments for the formulation of SSD constraints in a mathematical programming framework. For many individuals, an SSD constraint may seem too severe wherefore various relaxations (ASSD), have been proposed. We introduce yet another relaxation, directional SSD, where a candidate portfolio is admissible if a step from the benchmark in the direction of the candidate yields a dominating portfolio. Optimal step size depends on individual preferences reflected by the objective function. We compare computational efficiency of seven approaches for SD constrained portfolio problems, including SSD and ASSD constrained cases.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Markku Kallio, Nasim Dehghan Hardoroudi,