The computation of the worst conditional expectation

Recent advances in risk theory identify risk as a measure related to the tail of a probability distribution function, since it represents the “worst” outcomes of the random variable. Measures like value-at-risk (VaR), conditional VaR, expected shortfall and so on have become familiar operational tools for many financial applications. In this paper, one of these measures, the worst conditional expectation with threshold α of a discrete random variable Z, shortly WCEα(Z), is considered. It has been found that its computation can be formulated as a fractional integer programming problem with a single linear constraint, but its complexity is NP-hard, therefore it must be solved by implicit enumeration. Due to its similarity with the knapsack problem, it has been found that a good upper bound and a sharp data structure allow the implementation of a branch-and-bound that is able to solve realistic size problems in less than one hundredth of a second.