鲁棒信用风险优化的线性锥优化模型

考虑了具有强健性的信用风险优化问题. 根据最差条件在值风险度量信用风险的方法,建立了信用风险优化问题的模型. 由于信用风险的损失分布存在不确定性,考虑了两类不确定性区间,即箱子型区间和椭球型区间. 把具有强健性的信用风险优化问题分别转化成线性规划问题和二阶锥规划问题. 最后,通过一个信用风险问题的例子来说明此模型的有效性.     

The risk-averse newsvendor problem with random capacity

We study the effect of capacity uncertainty on the inventory decisions of a risk-averse newsvendor. We consider two well-known risk criteria, namely Value-at-Risk (VaR) included as a constraint and Conditional Value-at-Risk (CVaR). For the risk-neutral newsvendor, we find that the optimal order quantity is not affected by the capacity uncertainty. However, this result does not hold for the risk-averse newsvendor problem. Specifically, we find that capacity uncertainty decreases the order quantity under the CVaR criterion. Under the VaR constraint, capacity uncertainty leads to an order decrease for low confidence levels, but to an order increase for high confidence levels. This implies that the risk criterion should be carefully selected as it has an important effect on inventory decisions. This is shown for the newsvendor problem, but is also likely to hold for other inventory control problems that future research can address.     

Robust assortment optimization using worst-case CVaR under the multinomial logit model

We consider robust assortment optimization problems with partial distributional information of parameters in the multinomial logit choice model. The objective is to find an assortment that maximizes a revenue target using a distributionally robust chance constraint, which can be approximated by the worst-case Conditional Value-at-Risk. We show that our problems are equivalent to robust assortment optimization problems over special uncertainty sets of parameters, implying the optimality of revenue-ordered assortments under certain conditions.     

多目标条件风险值问题的等价定理

条件风险值问题是研究信用风险最优化的一种新的模型，本文研究了一类多目标条件风险值问题等价定理，我们引入了多个损失函数在对应的置信水平下关于一个证券组合的α-VaR损失值(最小信用风险值)和α-CVaR损失值(最小信用风险值对应的条件期望损失值或条件风险价值度量)概念，为了求得α-CVaR损失值下的弱：Pareto有效解，我们证明了它等价于求解另一个多目标规划问题的Pateto有效解，这样使得问题的求解变得简单．     

Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization

We consider general nonlinear programming problems with cardinality constraints. By relaxing the binary variables which appear in the natural mixed-integer programming formulation, we obtain an almost equivalent nonlinear programming problem, which is thus still difficult to solve. Therefore, we apply a Scholtes-type regularization method to obtain a sequence of easier to solve problems and investigate the convergence of the obtained KKT points. We show that such a sequence converges to an S-stationary point, which corresponds to a local minimizer of the original problem under the assumption of convexity. Additionally, we consider portfolio optimization problems where we minimize a risk measure under a cardinality constraint on the portfolio. Various risk measures are considered, in particular Value-at-Risk and Conditional Value-at-Risk under normal distribution of returns and their robust counterparts under moment conditions. For these investment problems formulated as nonlinear programming problems with cardinality constraints we perform a numerical study on a large number of simulated instances taken from the literature and illuminate the computational performance of the Scholtes-type regularization method in comparison to other considered solution approaches: a mixed-integer solver, a direct continuous reformulation solver and the Kanzow–Schwartz regularization method, which has already been applied to Markowitz portfolio problems.     

Distributionally robust chance constrained problem under interval distribution information

This paper is concerned with distributionally robust chance constrained problem under interval distribution information. Using worst-case CVaR approximation, we present a tractable convex programming approximation for distributionally robust individual chance constrained problem under interval sets of mean and covariance information. We prove the worst-case CVaR approximation problem is an exact form of the distributionally robust individual chance constrained problem. Then, our result is applied to worst-case Value-at-Risk optimization problem. Moreover, we discuss the problem under several ambiguous distribution information and investigate tractable approximations for distributionally robust joint chance constrained problem. Finally, we provide an illustrative example to show our results.     

证券投资组合优化问题的强健性的锥优化方法(英)

本文研究了具有强健性的证券投资组合优化问题.模型以最差条件在值风险为风险度量方法,并且考虑了交易费用对收益的影响.当投资组合的收益率概率分布不能准确确定但是在有界的区间内,尤其是在箱型区间结构和椭球区域结构内时,我们可以把具有强健性的证券投资组合优化问题的模型分别转化成线性规划和二阶锥规划形式.最后,我们用一个真实市场数据的算例来验证此方法.     

证券投资组合优化问题的强健性的锥优化方法(英文)

本文研究了具有强健性的证券投资组合优化问题.模型以最差条件在值风险为风险度量方法,并且考虑了交易费用对收益的影响.当投资组合的收益率概率分布不能准确确定但是在有界的区间内,尤其是在箱型区间结构和椭球区域结构内时,我们可以把具有强健性的证券投资组合优化问题的模型分别转化成线性规划和二阶锥规划形式.最后,我们用一个真实市场数据的算例来验证此方法.     

Distributionally robust inference for extreme Value-at-Risk

Under general multivariate regular variation conditions, the extreme Value-at-Risk of a portfolio can be expressed as an integral of a known kernel with respect to a generally unknown spectral measure supported on the unit simplex. The estimation of the spectral measure is challenging in practice and virtually impossible in high dimensions. This motivates the problem studied in this work, which is to find universal lower and upper bounds of the extreme Value-at-Risk under practically estimable constraints. That is, we study the infimum and supremum of the extreme Value-at-Risk functional, over the infinite dimensional space of all possible spectral measures that meet a finite set of constraints. We focus on extremal coefficient constraints, which are popular and easy to interpret in practice. Our contributions are twofold. First, we show that optimization problems over an infinite dimensional space of spectral measures are in fact dual problems to linear semi-infinite programs (LSIPs) – linear optimization problems in Euclidean space with an uncountable set of linear constraints. This allows us to prove that the optimal solutions are in fact attained by discrete spectral measures supported on finitely many atoms. Second, in the case of balanced portfolia, we establish further structural results for the lower bounds as well as closed form solutions for both the lower- and upper-bounds of extreme Value-at-Risk in the special case of a single extremal coefficient constraint. The solutions unveil important connections to the Tawn–Molchanov max-stable models. The results are illustrated with two applications: a real data example and closed-form formulae in a market plus sectors framework.     

Concentration bounds for empirical conditional value-at-risk: The unbounded case

Conditional Value-at-Risk (CVaR) is a popular risk measure for modelling losses in the case of a rare but extreme event. We consider the problem of estimating CVaR from i.i.d. samples of an unbounded random variable, which is either sub-Gaussian or sub-exponential. We derive a novel one-sided concentration bound for a natural sample-based CVaR estimator in this setting. Our bound relies on a concentration result for a quantile-based estimator for Value-at-Risk (VaR), which may be of independent interest.     

Robust combinatorial optimization with variable cost uncertainty

We present in this paper a new model for robust combinatorial optimization with cost uncertainty that generalizes the classical budgeted uncertainty set. We suppose here that the budget of uncertainty is given by a function of the problem variables, yielding an uncertainty multifunction. The new model is less conservative than the classical model and approximates better Value-at-Risk objective functions, especially for vectors with few non-zero components. An example of budget function is constructed from the probabilistic bounds computed by Bertsimas and Sim. We provide an asymptotically tight bound for the cost reduction obtained with the new model. We turn then to the tractability of the resulting optimization problems. We show that when the budget function is affine, the resulting optimization problems can be solved by solving n+1$n+1$ deterministic problems. We propose combinatorial algorithms to handle problems with more general budget functions. We also adapt existing dynamic programming algorithms to solve faster the robust counterparts of optimization problems, which can be applied both to the traditional budgeted uncertainty model and to our new model. We evaluate numerically the reduction in the price of robustness obtained with the new model on the shortest path problem and on a survivable network design problem.     

Robust portfolio choice with CVaR and VaR under distribution and mean return ambiguity

We consider the problem of optimal portfolio choice using the Conditional Value-at-Risk (CVaR) and Value-at-Risk (VaR) measures for a market consisting of n risky assets and a riskless asset and where short positions are allowed. When the distribution of returns of risky assets is unknown but the mean return vector and variance/covariance matrix of the risky assets are fixed, we derive the distributionally robust portfolio rules. Then, we address uncertainty (ambiguity) in the mean return vector in addition to distribution ambiguity, and derive the optimal portfolio rules when the uncertainty in the return vector is modeled via an ellipsoidal uncertainty set. In the presence of a riskless asset, the robust CVaR and VaR measures, coupled with a minimum mean return constraint, yield simple, mean-variance efficient optimal portfolio rules. In a market without the riskless asset, we obtain a closed-form portfolio rule that generalizes earlier results, without a minimum mean return restriction.     

Solvency II,regulatory capital,and optimal reinsurance: How good are Conditional Value-at-Risk and spectral risk measures?

We study the problem of optimal reinsurance as a means of risk management in the regulatory framework of Solvency II under Conditional Value-at-Risk and, as its natural extension, spectral risk measures. First, we show that stop-loss reinsurance is optimal under both Conditional Value-at-Risk and spectral risk measures. Spectral risk measures thus constitute a more general class of suitable regulatory risk measures than specific Conditional Value-at-Risk. At the same time, the established type of stop-loss reinsurance can be maintained as the optimal risk management strategy that minimizes regulatory capital. Second, we derive the optimal deductibles for stop-loss reinsurance. We show that under Conditional Value-at-Risk, the optimal deductible tends towards restrictive and counter-intuitive corner solutions or “plunging”, which is a serious objection against its use in regulatory risk management. By means of the broader class of spectral risk measures, we are able to overcome this shortcoming as optimal deductibles are now interior solutions. Especially, the recently discussed power spectral risk measures and the Wang risk measure are shown to avoid any plunging. They yield a one-to-one correspondence between the risk parameter and the optimal deductible and, thus, provide economically plausible risk management strategies.     

Distributionally robust discrete optimization with Entropic Value-at-Risk

We study the discrete optimization problem under the distributionally robust framework. We optimize the Entropic Value-at-Risk, which is a coherent risk measure and is also known as Bernstein approximation for the chance constraint. We propose an efficient approximation algorithm to resolve the problem via solving a sequence of nominal problems. The computational results show that the number of nominal problems required to be solved is small under various distributional information sets.     

On a Transform Method for the Efficient Computation of Conditional V@R (and V@R) with Application to Loss Models with Jumps and Stochastic Volatility

In this paper we consider Fourier transform techniques to efficiently compute the Value-at-Risk and the Conditional Value-at-Risk of an arbitrary loss random variable, characterized by having a computable generalized characteristic function. We exploit the property of these risk measures of being the solution of an elementary optimization problem of convex type in one dimension. An application to univariate loss models driven by Lévy or stochastic volatility risk factors dynamic is finally reported.     

Worst-case robust Omega ratio

The Omega ratio is a recent performance measure proposed to overcome the known shortcomings of the Sharpe ratio. Until recently, the Omega ratio was thought to be computationally intractable, and research was focused on heuristic optimization procedures. We have shown elsewhere that the Omega ratio optimization is equivalent to a linear program and hence can be solved exactly in polynomial time. This permits the investigation of more complex and realistic variants of the problem. The standard formulation of the Omega ratio requires perfect information for the probability distribution of the asset returns. In this paper, we investigate the problem arising from the probability distribution of the asset returns being only partially known. We introduce the robust variant of the conventional Omega ratio that hedges against uncertainty in the probability distribution. We examine the worst-case Omega ratio optimization problem under three types of uncertainty – mixture distribution, box and ellipsoidal uncertainty – and show that the problem remains tractable.     

多损失WCVaR模型的等价性定理

研究了多概率分布簇下的多损失下的WCVaR(Multi Worst Conditional Value-at-Risk)模型等价性定理, 根据概率分布簇的VaR测度值, 定义了多损失下的WCVaR风险测度值和对应的多目标优化模型(MWCVaR), 证明了多目标优化模型(MWCVaR)等价另一个多目标优化模型求解. 对于有限分布簇情形, 在一定条件下, 证明了用有限个分布簇就可以近似计算多损失(MWCVaR)优化模型.     

Capacity planning and warehouse location in supply chains with uncertain demands

We discuss the strategic capacity planning and warehouse location problem in supply chains operating under uncertainty. In particular, we consider situations in which demand variability is the only source of uncertainty. We first propose a deterministic model for the problem when all relevant parameters are known with certainty, and discuss related tractability and computational issues. We then present a robust optimization model for the problem when the demand is uncertain, and demonstrate how robust solutions may be determined with an efficient decomposition algorithm using a special Lagrangian relaxation method in which the multipliers are constructed from dual variables of a linear program.     

Bi-objective project portfolio selection and staff assignment under uncertainty

We formulate a project portfolio selection problem under uncertainty with two optimization criteria: a weighted average of economic and strategic gains, and a risk measure expressed as the expected total overtime cost. The optimal assignment of personnel with given skills to the tasks of the selected projects is incorporated as a subproblem. Searching for Pareto-optimal portfolios satisfying the given constraints amounts to a stochastic multi-objective combinatorial optimization problem, a problem type for which only a few general solution approaches are available at present. We apply a recently developed technique called adaptive Pareto sampling, solve a linear subproblem with an LP solver and use the NSGA-II algorithm for deterministic multi-objective optimization as an auxiliary procedure. A convergence result applicable in a more general context is also shown. To obtain objective function estimates, importance sampling is applied. The technique is tested on a benchmark derived from a real-world application case provided by the E-Commerce Competence Center Austria.