What does Acceptance Sampling for Buyers conclude, in numbers, about “The Buyer's Receiving Sheet and a Plan to Refute the Book”?

Answer: Chapter 8 gives the buyer's receiving sheet, the distilled Inbound Inspection Sampling Plan Calculator and a pre-registered test. Marked boxes separate published evidence, runnable Python calculations (22 programs), classical sources and the author's hypotheses.

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 only

barrier p = 0.10 at risk 0.10; process average 0.02
NnctenthPa(0.02)AOQLATI
2417021.00000.012217.0
6030161.00000.018630.0
150472150.97060.023050.0
400633400.97600.027671.1
10007741000.98530.031490.6
30009053000.99160.0346114.4
Show the full program
# Chapter 8. p81: the buyer's inbound inspection table.
# Model: for each lot size, the Dodge-Romig style single plan of p72
# with a shop-level barrier: lots with 0.10 defective accepted with
# prob <= 0.10, least ATI at the process average 0.02; then the
# exact AOQL (rectifying, D up to 0.4 N) and P(accept) at 0.02.
# Exact hypergeometric; D rounded half up. Parameters illustrative.
import math
from fractions import Fraction


def defects(N, p):
    return int(Fraction(p) * N + Fraction(1, 2))


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))


def aoq(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) * (D - d)
    return Fraction(num, math.comb(N, n) * N)


def best_plan(N, pt, beta, pbar, cmax=8):
    Dt, Db = defects(N, pt), defects(N, pbar)
    rows = []
    for c in range(0, cmax + 1):
        if c >= Dt:
            break
        n = c + 1
        while n <= N and hyper(N, Dt, n, c) > beta:
            n += 1
        if n > N:
            break
        pa = hyper(N, Db, n, c)
        rows.append((n + (1 - pa) * (N - n), n, c))
    return min(rows)


if __name__ == "__main__":
    beta = Fraction(1, 10)
    print("barrier p = 0.10 at risk 0.10; process average 0.02")
    print("      N    n   c   tenth  Pa(0.02)   AOQL     ATI")
    for N in (24, 60, 150, 400, 1000, 3000):
        ati, n, c = best_plan(N, "0.10", beta, "0.02")
        top = int(0.4 * N)
        q = max(aoq(N, D, n, c) for D in range(0, top + 1))
        pa = hyper(N, defects(N, "0.02"), n, c)
        print("  {:5d}  {:3d}  {:2d}   {:4d}   {:.4f}   {:.4f}  {:6.1f}"
              .format(N, n, c, N // 10, float(pa), float(q), float(ati)))

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 8: The Buyer's Receiving Sheet and a Plan to Refute the Book. 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