What does Acceptance Sampling for Buyers conclude, in numbers, about “The Hypergeometric Operating-Characteristic Curve: Acceptance Probabilities Computed Item by Item”?

Answer: Read the table from both ends toward the middle. With no defectives the acceptance probability is of course 1.0000. At a defect share of 0.010, five defectives in five hundred, it is 0.9194, short of 0.95; to reach 0.95 the share must fall to 0.006, three defectives. At 0.020 the acceptance probability drops to 0.7365, so a supplier running steadily at two in a hundred will see roughly one lot in four rejected. At 0.050 it is 0.2636, still a better than one-in-four chance of passing; at 0.100 it is 0.0278, and only then are such lots essentially stopped.

Scope of the numbers: Lot sizes, defect shares and costs are illustrative; all calculations are generated by the book's programs; the book is general business analysis, not individualised business advice. Marked boxes separate published evidence, runnable Python calculations (22 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.006, 0.010, 0.020, 0.0278, 0.050, 0.100

OC curve, N = 500, n = 50, c = 1
pDP(accept)
0.00001.0000
0.01050.9194
0.020100.7365
0.030150.5469
0.040200.3865
0.050250.2636
0.060300.1749
0.070350.1134
0.080400.0722
0.090450.0451
0.100500.0278
producer point (Pa >= 0.95): p = 0.006
indifference(Pa ~ 0.50):p = 0.032
LTPD(Pa <= 0.10): p = 0.074
Show the full program
# Chapter 2. p22: the OC curve of one plan and its three landmarks.
# Model: lot N = 500, plan n = 50, c = 1, exact hypergeometric.
# Landmarks: the largest defect share accepted with prob >= 0.95
# (the producer's point), the share accepted with prob closest to
# 0.50 (indifference) and the smallest share accepted with prob
# <= 0.10 (LTPD, the consumer's point). Plan is illustrative.
import math
from fractions import Fraction


def hyper(N, D, n, c):
    num = 0
    for d in range(0, min(c, D, n) + 1):
        num += math.comb(D, d) * math.comb(N - D, n - d)
    return Fraction(num, math.comb(N, n))


if __name__ == "__main__":
    N, n, c = 500, 50, 1
    pa = [hyper(N, D, n, c) for D in range(0, 81)]
    print("OC curve, N = 500, n = 50, c = 1")
    print("  p       D    P(accept)")
    for D in range(0, 55, 5):
        print("  {:.3f}  {:2d}   {:.4f}".format(D / N, D, float(pa[D])))
    p95 = max(D for D in range(81) if pa[D] >= Fraction(95, 100))
    p50 = min(range(81), key=lambda D: abs(pa[D] - Fraction(1, 2)))
    p10 = min(D for D in range(81) if pa[D] <= Fraction(1, 10))
    print("producer point (Pa >= 0.95): p = {:.3f}".format(p95 / N))
    print("indifference   (Pa ~ 0.50):  p = {:.3f}".format(p50 / N))
    print("LTPD           (Pa <= 0.10): p = {:.3f}".format(p10 / N))

Single source and citation

Fan, Y. (2026). Acceptance Sampling Plans and Operating-Characteristic Curves: How Many Items a Buyer Must Inspect on Arrival (Version 1.0.0), Chapter 2: The Hypergeometric Operating-Characteristic Curve: Acceptance Probabilities Computed Item by Item. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-329 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026329,
  author    = {Fan, Yafu},
  title     = {Acceptance Sampling Plans and Operating-Characteristic Curves: How Many Items a Buyer Must Inspect on Arrival},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book