No open-access location is known for this record yet.
No open-access location is known for this record yet.
A program is presented that finds the binomial double sampling plan satisfying:P(p1) ≥ 1 – αP(p2) ≤ βwhile minimizing w0ASN(p0) + w1ASN(p1) + w2ASN(p2). Here P(p) is the probability of accepting a lot with fraction nonconforming p, and ASN(p) is the average number sampled per lot for a series of lots with fraction nonconforming p. Values of p0, p1, p2, α, β, w0, and w1 are specified by the user (w2 = 1 – w0 – w1). This program provides an exact solution for the binomial distribution that does not require any restrictions on the five parameters describing a double sampling plan. Using this program, it is possible to obtain double sampling plans that are more efficient than those currently in use. An example is given showing that double sampling plans may be selected that are as efficient as the multiple sampling plans in Mil-Std-105D.
Loading…
Stored only when both papers are in the corpus — 8 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.