What does Acceptance Sampling for Buyers conclude, in numbers, about “The Expected Cost of Inbound Inspection: How Many Items Are Worth Checking”?

Answer: Chapter 6 writes inspection as expected cost: the best plan costs 327.82 per lot, 71.32 less than the tenth rule, and lot size enters through cost, not proportion.

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: 327.82, 71.32

rank n c cost/lot
124 1 327.82
225 1 327.89
323 1 327.89
426 1 328.09
522 1 328.12
optimum saves 32.18 per lot on no inspection
optimum saves 71.32 per lot on the tenth rule
supplier state p0.01: P(accept) = 0.9824
supplier state p0.04: P(accept) = 0.7523
supplier state p0.12: P(accept) = 0.1867
Show the full program
# Chapter 6. p62: the plan that minimises expected cost per lot.
# Model: the cost model and supplier mix of p61 (N = 300, K1 = 2,
# K2 = 60; 0.80 at 0.01, 0.15 at 0.04, 0.05 at 0.12). Exhaustive
# search over n = 0 to 150 and c = 0 to 5, exact hypergeometric
# with Fraction arithmetic. Parameters are illustrative.
import math
from fractions import Fraction

MIX = ((Fraction(80, 100), "0.01"), (Fraction(15, 100), "0.04"),
       (Fraction(5, 100), "0.12"))


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


def lot_cost(N, D, n, c, k1, k2):
    if n == 0:
        return Fraction(k2 * D)
    tot = math.comb(N, n)
    esc = 0
    pa = 0
    for d in range(0, min(c, D, n) + 1):
        w = math.comb(D, d) * math.comb(N - D, n - d)
        esc += w * (D - d)
        pa += w
    pa = Fraction(pa, tot)
    return k1 * n + (1 - pa) * k1 * (N - n) + k2 * Fraction(esc, tot)


def mix_cost(N, n, c, k1, k2, mix=MIX):
    acc = Fraction(0)
    for w, p in mix:
        acc += w * lot_cost(N, defects(N, p), n, c, k1, k2)
    return acc


if __name__ == "__main__":
    N, k1, k2 = 300, 2, 60
    rows = []
    for c in range(0, 6):
        for n in range(c + 1, 151):
            rows.append((mix_cost(N, n, c, k1, k2), n, c))
    rows.sort()
    print("  rank    n   c   cost/lot")
    for i, (cost, n, c) in enumerate(rows[:5], 1):
        print("  {:4d}  {:3d}  {:2d}   {:7.2f}".format(i, n, c, float(cost)))
    best, n, c = rows[0]
    none = mix_cost(N, 0, 0, k1, k2)
    tenth = mix_cost(N, 30, 0, k1, k2)
    print("optimum saves {:.2f} per lot on no inspection".format(
        float(none - best)))
    print("optimum saves {:.2f} per lot on the tenth rule".format(
        float(tenth - best)))
    for w, p in MIX:
        D = defects(N, p)
        tot = math.comb(N, n)
        pa = Fraction(0)
        for d in range(0, min(c, D) + 1):
            pa += Fraction(math.comb(D, d) * math.comb(N - D, n - d), tot)
        print("  supplier state p = {}: P(accept) = {:.4f}".format(
            p, float(pa)))

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 6: The Expected Cost of Inbound Inspection: How Many Items Are Worth Checking. 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