Computing near-optimal value-at-risk portfolios using integer programming techniques
From MaRDI portal
Publication:1754091
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 guarantee provided by the proposed algorithm is obtained thanks to the relation between minimum risk portfolios satisfying a reward benchmark and the corresponding maximum reward portfolios satisfying a risk benchmark. These alternate formulations of the portfolio allocation problem have been frequently studied in the case of convex risk measures and concave reward functions. Here, this relationship is considered for general risk measures and reward functions. To illustrate the efficiency of the presented algorithm, numerical results are presented using historical asset returns from the US financial market.
Recommendations
- A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
- Value-at-risk optimization using the difference of convex algorithm
- Mean-variance-VaR portfolios: MIQP formulation and performance analysis
- CVaR proxies for minimizing scenario-based value-at-risk
- On the global minimization of the value-at-risk
Cites work
- A Branch-And-Price Approach for Graph Multi-Coloring
- A difference of convex formulation of value-at-risk constrained optimization
- A generalized approach to portfolio optimization: improving performance by constraining portfolio norms
- A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
- Ambiguous chance constrained problems and robust optimization
- Coherent measures of risk
- Comments on ``A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
- Constructing Risk Measures from Uncertainty Sets
- CVaR proxies for minimizing scenario-based value-at-risk
- Data-driven portfolio management with quantile constraints
- scientific article; zbMATH DE number 2065140 (Why is no real title available?)
- Making and evaluating point forecasts
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- On elicitable risk measures
- Risk and asset allocation.
- Robust Statistics
- Robustness and sensitivity analysis of risk measurement procedures
- Uncertain convex programs: randomized solutions and confidence levels
- Value-at-risk optimization using the difference of convex algorithm
- Variance Reduction Techniques for Estimating Value-at-Risk
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
Cited in
(14)- DC programming and DCA for globally solving the value-at-risk
- Value-at-risk optimization using the difference of convex algorithm
- An analysis of dollar cost averaging and market timing investment strategies
- A one-sided Vysochanskii-Petunin inequality with financial applications
- Improved algorithms for computing worst value-at-risk
- A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
- Integer programming approaches in mean-risk models
- VNS approach for solving a financial portfolio design problem
- A difference of convex formulation of value-at-risk constrained optimization
- A VaR Black-Litterman model for the construction of absolute return fund-of-funds
- Mean-variance-VaR portfolios: MIQP formulation and performance analysis
- Model and efficient algorithm for the portfolio selection problem with real‐world constraints under value‐at‐risk measure
- Robust optimization approaches for portfolio selection: a comparative analysis
- Comments on ``A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
This page was built for publication: Computing near-optimal value-at-risk portfolios using integer programming techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754091)
