A Bayesian Algorithm for Determining Optimal Single Sample Acceptance Plans for Product Attributes

Herbert Moskowitz and William L. Berry
Additional contact information
Herbert Moskowitz: Purdue University
William L. Berry: Purdue University

Management Science, 1976, vol. 22, issue 11, 1238-1250

Abstract: The Bayesian algorithm presented in this paper provides a generalized procedure for determining the minimum cost sample size (n*) and acceptance number (c*) for single sample attribute acceptance plans. The algorithm is applicable to a broad range of acceptance sampling problems, assuming only that the distributions of product quality are discrete, and that the sampling cost is either a linear or strictly convex function of the sample size. Experimental results are presented that compare the solution quality and the computational requirements of this algorithm with three types of previously reported procedures: (1) Bayesian decision tree methods, (2) analytic approximation methods, and (3) direct search techniques. The results indicate that the algorithm produces the optimal solution with minimal computational requirements over a wide range of acceptance sampling problem types.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.22.11.1238 (application/pdf)

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:inm:ormnsc:v:22:y:1976:i:11:p:1238-1250

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().