Optimal Risk Transfer: A Numerical Optimization Approach

Alexandru V. Asimit, Tao Gao, Junlei Hu, Eun Seok Kim

Research output: Contribution to journalArticlepeer-review

5 Citations (SciVal)
60 Downloads (Pure)


Capital efficiency and asset/liability management are part of the Enterprise Risk Management Process of any insurance/reinsurance conglomerate and serve as quantitative methods to fulfill the strategic planning within an insurance organization. A considerable amount of work has been done in this ample research field, but invariably one of the last questions is whether or not, numerically, the method is practically implementable, which is our main interest. The numerical issues are dependent on the traits of the optimization problem, and therefore we plan to focus on the optimal reinsurance design, which has been a very dynamic topic in the last decade. The existing literature is focused on finding closed-form solutions that are usually possible when economic, solvency, and other constraints are not included in the model. Including these constraints, the optimal contract can be found only numerically. The efficiency of these methods is extremely good for some well-behaved convex problems, such as Second-Order Conic Problems. Specific numerical solutions are provided to better explain the advantages of appropriate numerical optimization methods chosen to solve various risk transfer problems. The stability issues are also investigated together with a case study performed for an insurance group that aims capital efficiency across the entire organization.

Original languageEnglish
Pages (from-to)341-364
Number of pages24
JournalNorth American Actuarial Journal
Issue number3
Early online date28 Mar 2018
Publication statusPublished - 2018

ASJC Scopus subject areas

  • Statistics and Probability
  • Economics and Econometrics
  • Statistics, Probability and Uncertainty


Dive into the research topics of 'Optimal Risk Transfer: A Numerical Optimization Approach'. Together they form a unique fingerprint.

Cite this