TY - JOUR

T1 - A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs

AU - Espinoza, Daniel

AU - Moreno, Eduardo

N1 - Funding Information:
Daniel Espinoza was partially funded by the FONDECYT Grant 1110024 and Millenium Nucleus Information and Coordination in Networks ICM/FIC P10-024F. Eduardo Moreno acknowledges the financial support of the FONDECYT Grant 1130681 and Basal Center CMM-UCh. Both authors acknowledge Stan Uryasev for providing AORDA software for benchmarking purposes.
Publisher Copyright:
© 2014, Springer Science+Business Media New York.

PY - 2014/12/1

Y1 - 2014/12/1

N2 - Recent years have seen growing interest in coherent risk measures, especially in Conditional Value-at-Risk ($$\mathrm {CVaR}$$CVaR). Since $$\mathrm {CVaR}$$CVaR is a convex function, it is suitable as an objective for optimization problems when we desire to minimize risk. In the case that the underlying distribution has discrete support, this problem can be formulated as a linear programming (LP) problem. Over more general distributions, recent techniques, such as the sample average approximation method, allow to approximate the solution by solving a series of sampled problems, although the latter approach may require a large number of samples when the risk measures concentrate on the tail of the underlying distributions. In this paper we propose an automatic primal-dual aggregation scheme to exactly solve these special structured LPs with a very large number of scenarios. The algorithm aggregates scenarios and constraints in order to solve a smaller problem, which is automatically disaggregated using the information of its dual variables. We compare this algorithm with other common approaches found in related literature, such as an improved formulation of the full problem, cut-generation schemes and other problem-specific approaches available in commercial software. Extensive computational experiments are performed on portfolio and general LP instances.

AB - Recent years have seen growing interest in coherent risk measures, especially in Conditional Value-at-Risk ($$\mathrm {CVaR}$$CVaR). Since $$\mathrm {CVaR}$$CVaR is a convex function, it is suitable as an objective for optimization problems when we desire to minimize risk. In the case that the underlying distribution has discrete support, this problem can be formulated as a linear programming (LP) problem. Over more general distributions, recent techniques, such as the sample average approximation method, allow to approximate the solution by solving a series of sampled problems, although the latter approach may require a large number of samples when the risk measures concentrate on the tail of the underlying distributions. In this paper we propose an automatic primal-dual aggregation scheme to exactly solve these special structured LPs with a very large number of scenarios. The algorithm aggregates scenarios and constraints in order to solve a smaller problem, which is automatically disaggregated using the information of its dual variables. We compare this algorithm with other common approaches found in related literature, such as an improved formulation of the full problem, cut-generation schemes and other problem-specific approaches available in commercial software. Extensive computational experiments are performed on portfolio and general LP instances.

KW - Aggregation techniques

KW - Approximation methods

KW - Conditional value at risk

KW - Sample average approximation

UR - http://www.scopus.com/inward/record.url?scp=85027944689&partnerID=8YFLogxK

U2 - 10.1007/s10589-014-9692-6

DO - 10.1007/s10589-014-9692-6

M3 - Article

AN - SCOPUS:85027944689

VL - 59

SP - 617

EP - 638

JO - Computational Optimization and Applications

JF - Computational Optimization and Applications

SN - 0926-6003

IS - 3

ER -