Arithmetization of distributions and linear goal programming (Q1584590)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1525242
Language Label Description Also known as
default for all languages
No label defined
    English
    Arithmetization of distributions and linear goal programming
    scientific article; zbMATH DE number 1525242

      Statements

      Arithmetization of distributions and linear goal programming (English)
      0 references
      0 references
      8 January 2003
      0 references
      This is an interesting article about arithmetization of probability distribution functions (PDF). It can be viewed as an extension of Panjer's algorithm used in the numerical evaluation of PDFs [see \textit{H. H. Panjer} and \textit{G. E. Willmot}, Insurance risk models. Society of Actuaries, Schaumburg (1992)]. When trying to replace a discrete or mixed type PDF by an arithmetic one, it can happen that the local moments matching method up to the second order fails for every appropriate span, giving some negative mass. A possible solution to this problem is retreating to first order local moment matching. This article explores an alternative approach, consisting in looking for the arithmetic probability function (PF) with equal expectation and closest second moment to the original PDF. The determination of this arithmetic PF is done by means of linear goal programming, which makes possible the junction of both the ideas of moment matching and closest second moment in a single method called the method of the nearest second moment.
      0 references
      arithmetic distribution
      0 references
      local moment matching
      0 references
      linear goal programming
      0 references
      simplex method
      0 references
      Panjer's algorithm
      0 references

      Identifiers