Computing near-optimal Value-at-Risk portfolios using Integer Programming techniques
Onur Babat, Juan C. Vera, Luis F. Zuluaga

TL;DR
This paper introduces an algorithm leveraging MILP formulations to compute near-optimal Value-at-Risk portfolios, providing solution guarantees and outperforming existing methods in terms of tight lower bounds.
Contribution
It presents a novel algorithm for near-optimal VaR portfolio optimization that guarantees solution quality and improves lower bound computations using MILP techniques.
Findings
Algorithm computes near-optimal VaR portfolios with guarantees.
Outperforms existing algorithms in tight lower bound computation.
Validated with historical US financial market data.
Abstract
Value-at-Risk (VaR) is one of the main regulatory tools used for risk management purposes. However, it is difficult to compute optimal VaR portfolios; that is, an optimal risk-reward portfolio allocation using VaR as the risk measure. This is due to VaR being non-convex and of combinatorial nature. In particular, it is well known that the VaR portfolio problem can be formulated as a mixed integer linear program (MILP) that is difficult to solve with current MILP solvers for medium to large-scale instances of the problem. Here, we present an algorithm to compute near-optimal VaR portfolios that takes advantage of this MILP formulation and provides a guarantee of the solution's near-optimality. As a byproduct, we obtain an algorithm to compute tight lower bounds on the VaR portfolio problem that outperform related algorithms proposed in the literature for this purpose. The near-optimality…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRisk and Portfolio Optimization · Capital Investment and Risk Analysis · Economic theories and models
