Computing semiparametric bounds on the expected payments of insurance instruments via column generation

It has been recently shown that numerical semiparametric bounds on the expected payoff of fi- nancial or actuarial instruments can be computed using semidefinite programming. However, this approach has practical limitations. Here we use column generation, a classical optimization technique, to address these limitations. From column generation, it follows that practical univari- ate semiparametric bounds can be found by solving a series of linear programs. In addition to moment information, the column generation approach allows the inclusion of extra information about the random variable; for instance, unimodality and continuity, as well as the construction of corresponding worst/best-case distributions in a simple way.

[1]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[2]  Ioana Popescu,et al.  On the Relation Between Option and Stock Prices: A Convex Optimization Approach , 2002, Oper. Res..

[3]  Li Chen,et al.  Tight Bounds for Some Risk Measures, with Applications to Robust Portfolio Selection , 2011, Oper. Res..

[4]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[5]  S. Jaimungal,et al.  Catastrophe options with stochastic interest rates and compound Poisson losses , 2006 .

[6]  Samuel H. Cox,et al.  Valuation of structured risk management products , 2004 .

[7]  Samuel H. Cox.  Bounds on Expected Values of Insurance Payments and Option Prices , 1990 .

[8]  A. Lo.  Semi-parametric upper bounds for option prices and expected payoffs , 1987 .

[9]  X. Sheldon Lin,et al.  Modeling and Evaluating Insurance Losses Via Mixtures of Erlang Distributions , 2010 .

[10]  Ioana Popescu,et al.  A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions , 2005, Math. Oper. Res..

[11]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[12]  L. Zuluaga,et al.  Mortality Portfolio Risk Management , 2011 .

[13]  José H. Dulá,et al.  Bounding separable recourse functions with limited distribution information , 1991, Ann. Oper. Res..

[14]  Ann De Schepper,et al.  Distribution-free option pricing , 2007 .

[15]  G. Dantzig,et al.  The decomposition algorithm for linear programming: notes on linear programming and extensions-part 57. , 1961 .

[16]  Phelim P. Boyle,et al.  Bounds on contingent claims based on several assets , 1997 .

[17]  J. Kemperman.  The General Moment Problem, A Geometric Approach , 1968 .

[18]  Melvyn Sim,et al.  Beyond Risk: Ambiguity in Supply Chains , 2011 .

[19]  Andrés L. Medaglia,et al.  Computing bounds on the expected payoff of Alternative Risk Transfer products , 2012 .

[20]  L. Zuluaga,et al.  Bounds for Probabilities of Extreme Events Defined by Two Random Variables , 2010 .

[21]  Nikolaos V. Sahinidis,et al.  A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..

[22]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[23]  Monique Laurent,et al.  Semidefinite optimization , 2019, Graphs and Geometry.

[24]  Javier Peña,et al.  A Conic Programming Approach to Generalized Tchebycheff Inequalities , 2005, Math. Oper. Res..

[25]  G. Dantzig,et al.  THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

[26]  Yinyu Ye,et al.  Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems , 2010, Oper. Res..

[27]  Marc Goovaerts,et al.  Upper bounds on stop-loss premiums in case of known moments up to the fourth order☆ , 1986 .