Article ID: | iaor20163534 |
Volume: | 245 |
Issue: | 1 |
Start Page Number: | 47 |
End Page Number: | 66 |
Publication Date: | Oct 2016 |
Journal: | Annals of Operations Research |
Authors: | Kksalan Murat, Sakar Ceren |
Keywords: | combinatorial optimization, stochastic processes, decision |
We consider expected return, Conditional Value at Risk, and liquidity criteria in a multi‐period portfolio optimization setting modeled by stochastic programming. We aim to identify a preferred solution of the decision maker (DM) by obtaining information on her/his preferences. We use a weighted Tchebycheff program to generate representative sets of solutions. Our approach models the stochasticity of market movements by stochastic programming. Working with multiple scenario trees, we construct confidence ellipsoids around representative solutions, and present them to the DM for her/him to make a choice. With each iteration of the approach, an increasingly concentrated set of ellipsoids around the DM’s choices are generated. The procedure is demonstrated with tests performed using stocks traded on Borsa Istanbul.