IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v25y1978i2p263-271.html
   My bibliography  Save this article

A recursive algorithm for a summed multinomial density function

Author

Listed:
  • Raymond K. Fink
  • Herbert Moskowitz

Abstract

An algorithm for calculating the probabilities of a summed multinomial density function which is recursive with n (the number of trials) is presented. Having application in inspector error models for auditing and quality control problems with Cartesian product structures, the algorithm is discussed in the context of computing optimal economic sampling plans. Computational experience with the algorithm is presented.

Suggested Citation

  • Raymond K. Fink & Herbert Moskowitz, 1978. "A recursive algorithm for a summed multinomial density function," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 25(2), pages 263-271, June.
    • Handle: RePEc:wly:navlog:v:25:y:1978:i:2:p:263-271
    DOI: 10.1002/nav.3800250206
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800250206
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800250206?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navlog:v:25:y:1978:i:2:p:263-271. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.