In this paper we outline the Lagrangian constrained optimization method to solve complex problems subject to constraints. Firstly we summarize the Lagrangian constrained optimization routine. Secondly we outline a detailed implementation strategy. Thirdly and finally we provide example and solve...

We study the optimal loan securitization policy of a commercial bank which is mainly engaged in lending activities. For this we propose a stylized dynamic model which contains the main features affecting the securitization decision. In line with reality we assume that there are non-negligible...

In this short technical note we present an efficient algorithm for the maximization of the Liquidity Cover Ratio (LCR) when lower level asset caps are activated. This algorithm acts by selecting the most efficient assets to remove from the pool of such assets in order to maximize the LCR without...

The mining industry can be extremely volatile during times of economic downturn. We compare extreme risk in mining share portfolios from each of the world's seven leading mining areas using Conditional Value at Risk (CVaR) which measures those risks beyond traditional Value at Risk (VaR)...

Purpose This paper aims to present a literature review of the most recent optimisation methods applied to Credit Scoring Models (CSMs). Design/methodology/approach The research methodology employed technical procedures based on bibliographic and exploratory analyses. A traditional investigation...

We characterize policy interventions directed to minimize the cost to the deposit guarantee scheme and the taxpayers of banks with legacy problems. Non-performing loans (NPLs) with low and risky returns create a debt overhang that induces bank owners to forego profitable lending opportunities....

This paper introduces a formulation of the optimal network compression problem for financial systems. This general formulation is presented for different levels of network compression or rerouting allowed from the initial inter-bank network. We prove that this problem is, generically, NP-hard....