A multicriteria approach for rating the credit risk of financial institutions

Within the new bank regulatory context, the assessment of the credit risk of financial institutions is an important issue for supervising authorities and investors. This study explores the possibility of a developing risk assessment model for financial institutions using a multicriteria classification method. The analysis is based on publicly available financial data for UK firms. The results indicate that the proposed multicriteria methodology provides promising results compared to well known statistical methods.     

Multiobjective bilevel optimization

In this work nonlinear non-convex multiobjective bilevel optimization problems are discussed using an optimistic approach. It is shown that the set of feasible points of the upper level function, the so-called induced set, can be expressed as the set of minimal solutions of a multiobjective optimization problem. This artificial problem is solved by using a scalarization approach by Pascoletti and Serafini combined with an adaptive parameter control based on sensitivity results for this problem. The bilevel optimization problem is then solved by an iterative process using again sensitivity theorems for exploring the induced set and the whole efficient set is approximated. For the case of bicriteria optimization problems on both levels and for a one dimensional upper level variable, an algorithm is presented for the first time and applied to two problems: a theoretical example and a problem arising in applications.     

TVaR-based capital allocation with copulas

Because of regulation projects from control organisations such as the European solvency II reform and recent economic events, insurance companies need to consolidate their capital reserve with coherent amounts allocated to the whole company and to each line of business. The present study considers an insurance portfolio consisting of several lines of risk which are linked by a copula and aims to evaluate not only the capital allocation for the overall portfolio but also the contribution of each risk over their aggregation. We use the tail value at risk (TVaR) as risk measure. The handy form of the FGM copula permits an exact expression for the TVaR of the sum of the risks and for the TVaR-based allocations when claim amounts are exponentially distributed and distributed as a mixture of exponentials. We first examine the bivariate model and then the multivariate case. We also show how to approximate the TVaR of the aggregate risk and the contribution of each risk when using any copula.     

TVaR-based capital allocation with copulas

Because of regulation projects from control organisations such as the European solvency II reform and recent economic events, insurance companies need to consolidate their capital reserve with coherent amounts allocated to the whole company and to each line of business. The present study considers an insurance portfolio consisting of several lines of risk which are linked by a copula and aims to evaluate not only the capital allocation for the overall portfolio but also the contribution of each risk over their aggregation. We use the tail value at risk (TVaR) as risk measure. The handy form of the FGM copula permits an exact expression for the TVaR of the sum of the risks and for the TVaR-based allocations when claim amounts are exponentially distributed and distributed as a mixture of exponentials. We first examine the bivariate model and then the multivariate case. We also show how to approximate the TVaR of the aggregate risk and the contribution of each risk when using any copula.     

Numerically intensive computing in Japanese financial institutions

Two major sophisticated services are needed by Japanese financial institutions. They are fund management and the development of new financial products. These are needed because of the increase of fund to be managed and deregulation. This paper will first, explain the current situation in Japanese financial institutions and, second, introduce the use of numerically intensive computing to provide these new services.     

Excess based allocation of risk capital

In this paper we propose a new rule to allocate risk capital to portfolios or divisions within a firm. Specifically, we determine the capital allocation that minimizes the excesses of sets of portfolios in a lexicographical sense. The excess of a set of portfolios is defined as the expected loss of that set of portfolios in excess of the amount of risk capital allocated to them. The underlying idea is that large excesses are undesirable, and therefore the goal is to determine the allocation for which the largest excess is as small as possible. We show that this allocation rule yields a unique allocation, and that it satisfies some desirable properties. We also show that the allocation can be determined by solving a series of linear programming problems.     

Multiobjective optimization using differential evolution for real-world portfolio optimization

Portfolio optimization is an important aspect of decision-support in investment management. Realistic portfolio optimization, in contrast to simplistic mean-variance optimization, is a challenging problem, because it requires to determine a set of optimal solutions with respect to multiple objectives, where the objective functions are often multimodal and non-smooth. Moreover, the objectives are subject to various constraints of which many are typically non-linear and discontinuous. Conventional optimization methods, such as quadratic programming, cannot cope with these realistic problem properties. A valuable alternative are stochastic search heuristics, such as simulated annealing or evolutionary algorithms. We propose a new multiobjective evolutionary algorithm for portfolio optimization, which we call DEMPO??Differential Evolution for Multiobjective Portfolio Optimization. In our experimentation, we compare DEMPO with quadratic programming and another well-known evolutionary algorithm for multiobjective optimization called NSGA-II. The main advantage of DEMPO is its ability to tackle a portfolio optimization task without simplifications, while obtaining very satisfying results in reasonable runtime.     

Multiobjective optimization problems with equilibrium constraints

The paper is devoted to new applications of advanced tools of modern variational analysis and generalized differentiation to the study of broad classes of multiobjective optimization problems subject to equilibrium constraints in both finite-dimensional and infinite-dimensional settings. Performance criteria in multiobjective/vector optimization are defined by general preference relationships satisfying natural requirements, while equilibrium constraints are described by parameterized generalized equations/variational conditions in the sense of Robinson. Such problems are intrinsically nonsmooth and are handled in this paper via appropriate normal/coderivative/subdifferential constructions that exhibit full calculi. Most of the results obtained are new even in finite dimensions, while the case of infinite-dimensional spaces is significantly more involved requiring in addition certain “sequential normal compactness” properties of sets and mappings that are preserved under a broad spectrum of operations.     

GlueVaR risk measures in capital allocation applications

GlueVaR risk measures defined by Belles-Sampera et al. (2014) generalize the traditional quantile-based approach to risk measurement, while a subfamily of these risk measures has been shown to satisfy the tail-subadditivity property. In this paper we show how GlueVaR risk measures can be implemented to solve problems of proportional capital allocation. In addition, the classical capital allocation framework suggested by Dhaene et al. (2012) is generalized to allow the application of the Value-at-Risk (VaR) measure in combination with a stand-alone proportional allocation criterion (i.e., to accommodate the Haircut allocation principle). Two new proportional capital allocation principles based on GlueVaR risk measures are defined. An example based on insurance claims data is presented, in which allocation solutions with tail-subadditive risk measures are discussed.     

Dynamic capital allocation with irreversible investments

Capital allocation models generally assume that the risk portfolio is constructed at a single point in time, when the underwriter has full information about available underwriting opportunities. However, in practice, opportunities are not all known at the beginning but instead arrive over time. Moreover, a commitment to an opportunity is not easy to change as time passes. Thus, to optimize a portfolio, the underwriter must make decisions on opportunities as they arrive while making use of assumptions about what will arrive in the future. This paper studies capital allocation rules in this setting, finding important differences from the static setting. The pricing of an opportunity is based on an expected future marginal cost of risk associated with that opportunity—one that will be fully understood only after the risk portfolio is finalized. The risk charge for today’s opportunity is thus a probability-weighted average of the product of the marginal value of capital in future states of the world and the amount of capital consumed by the opportunity in those future states. Our numerical examples illustrate how the marginal cost of risk for an opportunity is shaped by when it arrives in time, as well as what has arrived before it.     

A novel elitist multiobjective optimization algorithm: Multiobjective extremal optimization

Recently, a general-purpose local-search heuristic method called extremal optimization (EO) has been successfully applied to some NP-hard combinatorial optimization problems. This paper presents an investigation on EO with its application in numerical multiobjective optimization and proposes a new novel elitist (1 + λ) multiobjective algorithm, called multiobjective extremal optimization (MOEO). In order to extend EO to solve the multiobjective optimization problems, the Pareto dominance strategy is introduced to the fitness assignment of the proposed approach. We also present a new hybrid mutation operator that enhances the exploratory capabilities of our algorithm. The proposed approach is validated using five popular benchmark functions. The simulation results indicate that the proposed approach is highly competitive with the state-of-the-art multiobjective evolutionary algorithms. Thus MOEO can be considered a good alternative to solve numerical multiobjective optimization problems.     

Multiobjective optimization problem with variational inequality constraints

 We study a general multiobjective optimization problem with variational inequality, equality, inequality and abstract constraints. Fritz John type necessary optimality conditions involving Mordukhovich coderivatives are derived. They lead to Kuhn-Tucker type necessary optimality conditions under additional constraint qualifications including the calmness condition, the error bound constraint qualification, the no nonzero abnormal multiplier constraint qualification, the generalized Mangasarian-Fromovitz constraint qualification, the strong regularity constraint qualification and the linear constraint qualification. We then apply these results to the multiobjective optimization problem with complementarity constraints and the multiobjective bilevel programming problem. Received: November 2000 / Accepted: October 2001 Published online: December 19, 2002 Key Words. Multiobjective optimization – Variational inequality – Complementarity constraint – Constraint qualification – Bilevel programming problem – Preference – Utility function – Subdifferential calculus – Variational principle Research of this paper was supported by NSERC and a University of Victoria Internal Research Grant Research was supported by the National Science Foundation under grants DMS-9704203 and DMS-0102496 Mathematics Subject Classification (2000): Sub49K24, 90C29     

Multiobjective PDE-constrained optimization using the reduced-basis method

In this paper the reduced basis (RB) method is applied to solve quadratic multiobjective optimal control problems governed by linear parametrized variational equations. These problems often arise in applications, where the quality of the system behavior has to be measured by more than one criterium. The weighted sum method is exploited for defining scalar-valued linear-quadratic optimal control problems built by introducing additional optimization parameters. The optimal controls corresponding to specific choices of the optimization parameters are efficiently computed by the RB method. The accuracy is guaranteed by an a-posteriori error estimate. An effective sensitivity analysis allows to further reduce the computational times for identifying a suitable and representative set of optimal controls.     

Assessing and managing credit risk in retail financial services

The paper reviews recent developments and future needs in modellingcredit risk in the retail portfolio and their recent regulatoryimplications, against the implications of the new frameworkproposed by the Basel Committee on Banking Supervision. It introducesfour related papers arising from a conference held at the Bankof England in November 2000, before outlining the history ofthe requirements and the determination of the minimum capitalrequired by banks to cover credit risk on their assets. Therationale for the mathematics behind the proposed new international‘internal-ratings based approach,’ relying on banks'own models, is then briefly discussed, with relevant bibliographyfor further reading.     

Optimal capital allocation in a hierarchical corporate structure

We consider capital allocation in a hierarchical corporate structure where stakeholders at two organizational levels (e.g., board members vs line managers) may have conflicting objectives, preferences, and beliefs about risk. Capital allocation is considered as the solution to an optimization problem whereby a quadratic deviation measure between individual losses (at both levels) and allocated capital amounts is minimized. Thus, this paper generalizes the framework of Dhaene et al. (2012), by allowing potentially diverging risk preferences in a hierarchical structure. An explicit unique solution to this optimization problem is given. In several examples, it is shown how the optimal capital allocation achieves a compromise between conflicting views of risk within the organization.     

Multiobjective vendor allocation in multiechelon inventory systems: a spreadsheet model

The vendor selection problem (VSP) is a critical element of the numerous managerial decisions in the consideration of both outsourcing and integrated supply chain management. Many papers in the literature have dealt with VSPs from a multicriteria perspective, but few have looked into the implications of such decisions in a multiechelon supply chain with the explicit consideration of multiple time-phased demands. A new integrated supply chain model is proposed for a multiechelon supply chain. This model takes into account the usual cost objective and other important criteria in a multiechelon supply chain ranging from the most upstream suppliers' quality to end customers' satisfaction level through a large-scale multiobjective linear programme (MOLP). Furthermore, various Pareto optimal solutions can be graphically presented to facilitate decision making and negotiations with existing and potential suppliers.     

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

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

Multiobjective evolutionary algorithms for complex portfolio optimization problems

This paper investigates the ability of Multiobjective Evolutionary Algorithms (MOEAs), namely the Non-dominated Sorting Genetic Algorithm II (NSGA-II), Pareto Envelope-based Selection Algorithm (PESA) and Strength Pareto Evolutionary Algorithm 2 (SPEA2), for solving complex portfolio optimization problems. The portfolio optimization problem is a typical bi-objective optimization problem with objectives the reward that should be maximized and the risk that should be minimized. While reward is commonly measured by the portfolio’s expected return, various risk measures have been proposed that try to better reflect a portfolio’s riskiness or to simplify the problem to be solved with exact optimization techniques efficiently. However, some risk measures generate additional complexities, since they are non-convex, non-differentiable functions. In addition, constraints imposed by the practitioners introduce further difficulties since they transform the search space into a non-convex region. The results show that MOEAs, in general, are efficient and reliable strategies for this kind of problems, and their performance is independent of the risk function used.