Published online by Cambridge University Press: 29 August 2014
Quadratic programming means maximizing or minimizing a quadratic function of one or more variables subject to linear restrictions i.e. linear equations and/or inequalities.
Among the numerous insurance problems which can be formulated as quadratic programs we shall only discuss four, namely the Credibility, Retention, IBNR and the Cost Distribution problems.
Generally, there is no explicite solution to quadratic optimization problems, only statements about the existence of a solution can be made or some algorithm may be recommended in order to get exact or approximate numerical solutions. Restricting ourselves to typical problems of the above mentioned type, however, enables us to give an explicit solution in terms of general formulae for quite a number of cases, such as the onedimensional credibility problem, the retention problem and—under relatively week assumptions— for the IBNR-problem.
The results given here are by no means new. The only goal of this paper is to describe a few fundamental insurance problems from a common mathematical standpoint, namely that of quadratic programming and at the same time, to draw attention to a few special aspects and open questions in this field.