Arithmetization of distributions and linear goal programming (Q1584590): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127814663, #quickstatements; #temporary_batch_1722203565125 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127814663 / rank | |||
Normal rank |
Latest revision as of 22:56, 28 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Arithmetization of distributions and linear goal programming |
scientific article |
Statements
Arithmetization of distributions and linear goal programming (English)
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
0 references