Computational aspects in multistage bayesian acceptance sampling

K.‐H. Waldmann

Naval Research Logistics Quarterly, 1986, vol. 33, issue 3, 399-412

Abstract: Simple criteria are found for reducing the computational effort in multistage Bayesian acceptance sampling. Regions of optimality are given for both terminal actions accept and reject. Also, criteria are presented for detecting nonoptimality of sets of sample sizes. Finally, nearly optimal (z,c−,c+)‐sampling plans are constructed by restricting attention to a small subset of sample sizes.

Date: 1986
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800330306

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:33:y:1986:i:3:p:399-412

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().