关于「毛利稀释矩阵与「砍三成」的边界」,《瓶颈、自蚕食与顾问定价》给出的定量结论是什么?

结论:第四章写出毛利稀释矩阵,发现副线 A3 每少卖一件被接回 RM 51.4,高于它自己的毛利;在 400 个随机世界中,按表面贡献砍三成有 218 个亏损,「砍三成」不是定律。

数据口径:书中的团队产能、需求参数、毛利、噪声与合约参数均为示意或合成模型;全部数据由书中程序生成;本书不是投资、法律或税务意见。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 218, 400

   base world: greedy keeps F A1 B1 (+16.7%)
   cut 3 lowest naive        mean -0.5%  profit falls in 218/400
   cut 3 lowest incremental  mean +5.4%  profit falls in  74/400
   greedy optimum            mean +8.1%  profit falls in   0/400
   SKUs the optimum removes (count: worlds)
     0: 35, 1: 48, 2: 72, 3: 78, 4: 63
     5: 40, 6: 29, 7: 22, 8: 10, 9: 3
   naive rule leaves on average 8.6% of profit
   when eta > 0.2 the naive cut loses in 144/150 worlds
查看完整验算程序
# Chapter 4. p08: Is "delist the bottom 30%" a law? Greedy pruning (drop
# the SKU whose removal raises profit most, until none does) against two
# fixed 30% rules, over 400 random worlds: qualities +/- 0.4, margins
# x U(0.7, 1.3), lambda_A in [0.4, 0.9], lambda_B in [0.6, 1.0], outside
# utility in [1, 3], listing cost RM 1,000 to 4,000 a month, and a
# traffic elasticity eta in [0, 0.3]: a shop with n of its 10 SKUs draws
# (n / 10)^eta of the shoppers (range brings visits). Seed 83.
import importlib.util
import random

def load(name):
    spec = importlib.util.spec_from_file_location(name, name + ".py")
    m = importlib.util.module_from_spec(spec)
    spec.loader.exec_module(m)
    return m

p05 = load("p05_nested_logit")

def profit(active, skus, lam, u0, fixed, eta=0.0):
    s = p05.shares(active, lam, skus, u0)
    mg = {x[0]: x[3] for x in skus}
    n = p05.SHOPPERS * (len(active) / len(skus)) ** eta
    return sum(n * s[j] * mg[j] for j in active) - fixed * len(active)

def greedy(skus, lam, u0, fixed, eta=0.0):
    act = [x[0] for x in skus]
    cur = profit(act, skus, lam, u0, fixed, eta)
    while len(act) > 1:
        best = max(act, key=lambda j: profit([a for a in act if a != j],
                                             skus, lam, u0, fixed, eta))
        new = profit([a for a in act if a != best], skus, lam, u0, fixed,
                     eta)
        if new <= cur:
            break
        act.remove(best)
        cur = new
    return act, cur

def rule(skus, lam, u0, fixed, eta, incremental):
    act = [x[0] for x in skus]
    base = profit(act, skus, lam, u0, fixed, eta)
    if incremental:
        key = {j: base - profit([a for a in act if a != j], skus, lam, u0,
                                fixed, eta) for j in act}
    else:
        s = p05.shares(act, lam, skus, u0)
        key = {x[0]: p05.SHOPPERS * s[x[0]] * x[3] - fixed for x in skus}
    cut = sorted(act, key=key.get)[:3]
    return profit([a for a in act if a not in cut], skus, lam, u0, fixed,
                  eta)

if __name__ == "__main__":
    act, best = greedy(p05.SKUS, p05.LAM, p05.U0, 2500.0)
    base = profit(p05.ALL, p05.SKUS, p05.LAM, p05.U0, 2500.0)
    print("   base world: greedy keeps {} ({:+.1%})".format(
        " ".join(act), best / base - 1))
    rng = random.Random(83)
    stats = {"naive": [], "incr": [], "opt": []}
    counts, etas = {}, []
    for _ in range(400):
        sk = tuple((n, g, p, m * rng.uniform(0.7, 1.3),
                    q + rng.uniform(-0.4, 0.4))
                   for n, g, p, m, q in p05.SKUS)
        lam = {"A": rng.uniform(0.4, 0.9), "B": rng.uniform(0.6, 1.0)}
        u0, fx = rng.uniform(1, 3), rng.uniform(1000, 4000)
        eta = rng.uniform(0, 0.3)
        b = profit([x[0] for x in sk], sk, lam, u0, fx, eta)
        a, o = greedy(sk, lam, u0, fx, eta)
        stats["opt"].append(o / b - 1)
        stats["naive"].append(rule(sk, lam, u0, fx, eta, False) / b - 1)
        stats["incr"].append(rule(sk, lam, u0, fx, eta, True) / b - 1)
        etas.append((eta, stats["naive"][-1]))
        k = 10 - len(a)
        counts[k] = counts.get(k, 0) + 1
    for key, label in (("naive", "cut 3 lowest naive"),
                       ("incr", "cut 3 lowest incremental"),
                       ("opt", "greedy optimum")):
        v = stats[key]
        print("   {:<25} mean {:+.1%}  profit falls in {:3d}/400".format(
            label, sum(v) / len(v), sum(1 for x in v if x < 0)))
    ks = sorted(counts)
    print("   SKUs the optimum removes (count: worlds)")
    for half in (ks[:5], ks[5:]):
        print("     " + ", ".join("{}: {}".format(k, counts[k])
                                 for k in half))
    gap = [o - n for o, n in zip(stats["opt"], stats["naive"])]
    print("   naive rule leaves on average {:.1%} of profit".format(
        sum(gap) / len(gap)))
    hi = [g for e, g in etas if e > 0.2]
    print("   when eta > 0.2 the naive cut loses in {}/{} worlds".format(
        sum(1 for g in hi if g < 0), len(hi)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《企业瓶颈诊断、产品线自蚕食审计与自动化改造回报边界》第 4 章「毛利稀释矩阵与「砍三成」的边界」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090217

DOI: 10.5281/zenodo.24090217 · 阅读本章所在专著 · 5DL-B-083 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026083,
  author    = {Fan, Yafu},
  title     = {Enterprise Bottleneck Diagnostics, SKU Cannibalization Audits and Automation Return Bounds},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090217},
  url       = {https://doi.org/10.5281/zenodo.24090217}
}

本书其他章节结论