-

 

 

 




Optimization Online





 

Multi-market Portfolio Optimization with Conditional Value at Risk

Stefano Nasini(s.nasini***at***ieseg.fr)
Martine Labbé(mlabbe***at***ulb.ac.be)
Luce Brotcorne(luce.brotcorne***at***inria.fr)

Abstract: In this paper we propose an optimization framework for multi-markets portfolio management, where a central headquarter relies upon local affiliates for the market-wise selection of investment options. Being averse to risk, the headquarter endogenously selects the maximum expected loss (conditional value at risk) for the affiliates, who respond designing portfolios and selecting management fees. In its essence, this problem constitutes a single-leader-multi-follower game resulting from the decentralized design of the investment selection. Starting from a bilevel formulation, our results build on the equivalence with the high point relaxation and provide theoretical insights about the decentralized portfolio properties and numerical solution approaches. We show that the problem is NP-Hard and propose a decomposition procedure and strong valid inequalities, capable of substantially boosting the efficiency of the computational solution, when instances become large. In the same line, optimality bounds exploiting overlooked properties of the conditional value at risk are deduced, to provide almost exact solutions with few seconds of computation. Building on this theoretical development, we conduct computational tests to validate and compare the proposed investment framework, using comprehensive firm-level data from 1999 to 2014 on 7256 U.S. listed enterprises. The numerical tests supports the effectiveness of the decomposition procedure, as well as the one resulting from the inclusion of strong valid inequalities, improving the LP relaxation by up to 98%.

Keywords: Portfolio optimization; Multi-market investment selection; Conditional value at risk; Polyhedral representation; Valid inequalities

Category 1: Applications -- OR and Management Sciences

Category 2: Integer Programming

Category 3: Integer Programming (Cutting Plane Approaches )

Citation:

Download: [PDF]

Entry Submitted: 01/19/2021
Entry Accepted: 01/19/2021
Entry Last Modified: 01/19/2021

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society