5D Library › 企业瓶颈诊断、产品线自蚕食审计与自动化改造回报边界 · English
第四章 毛利稀释矩阵与「砍三成」的边界
稀释矩阵:每少卖一件,谁接回多少毛利
把转移分流率乘以接收商品的单件毛利,就得到毛利稀释矩阵:第 行第 列表示商品 每少卖一件,商品 接回多少毛利。一行的总和是「接回毛利」。如果某个商品的接回毛利高于它自己的单件毛利,它每卖出一件,公司的总毛利就少一点:它的销量主要是从兄弟商品那里拿来的。
推导
# Chapter 4. p07: The margin dilution matrix. Entry (j, k) = diversion
# j -> k times the unit margin of k: the RM that SKU k recaptures for
# every unit of j that disappears. A SKU's true (incremental) monthly
# contribution is profit with it minus profit without it; its naive
# contribution ignores what it takes from its siblings.
import importlib.util
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")
p06 = load("p06_pruning")
M = p06.MARGIN
def incremental(j, active):
return p06.profit(active) - p06.profit([a for a in active if a != j])
if __name__ == "__main__":
allv = list(p05.ALL)
nest_a = [s[0] for s in p05.SKUS if s[1] == "A"]
print(" dilution matrix, nest A (RM recaptured per unit lost)")
print(" from/to " + "".join("{:>7}".format(k) for k in nest_a)
+ " margin")
for j in nest_a:
dv = p05.diversion(j, allv)
cells = "".join("{:>7}".format("." if k == j else
"{:.1f}".format(dv[k] * M[k]))
for k in nest_a)
rec = sum(dv[k] * M[k] for k in allv if k != j)
print(" {:<7} {} {:>4} (recaptured {:.1f})".format(
j, cells, M[j], rec))
u = p06.units(allv)
print(" SKU naive RM incremental RM")
rows = [(j, u[j] * M[j] - p06.FIXED, incremental(j, allv))
for j in allv]
for j, nv, inc in rows:
print(" {:<4} {:8,.0f} {:12,.0f}".format(j, nv, inc))
neg = [j for j, _, inc in rows if inc < 0]
print(" SKUs that lower total profit: {}".format(", ".join(neg)))
# dilution matrix, nest A (RM recaptured per unit lost)
# from/to F A1 A2 A3 A4 margin
# F . 11.8 10.1 5.3 3.6 120 (recaptured 33.9)
# A1 26.5 . 8.7 4.5 3.1 90 (recaptured 45.7)
# A2 27.6 10.6 . 4.7 3.2 60 (recaptured 49.1)
# A3 26.5 10.2 8.7 . 3.1 40 (recaptured 51.4)
# A4 25.9 10.0 8.6 4.4 . 32 (recaptured 51.8)
# SKU naive RM incremental RM
# F 128,786 91,750
# A1 48,053 22,367
# A2 40,775 5,340
# A3 19,968 -8,904
# A4 12,715 -11,900
# B1 12,809 1,405
# B2 9,068 -1,247
# B3 5,969 -3,324
# B4 3,416 -4,929
# B5 900 -5,727
# SKUs that lower total profit: A3, A4, B2, B3, B4, B5副线 A3 的单件毛利是 RM 40,下架后每少卖一件,其他商品接回 RM 51.4,其中旗舰品接回 RM 26.5;A4 单件毛利 RM 32,接回 RM 51.8。旗舰品自己每少卖一件只有 RM 33.9 被接回,远低于它的单件毛利 RM 120。
于是有两种贡献。「表面贡献」是销量乘以毛利减去维持成本;「增量贡献」是有它与没有它时公司总利润之差。A3 的表面贡献是 RM 19,968,增量贡献却是 RM -8,904;A4 是 RM 12,715 对 RM -11,900。旗舰品的表面贡献 RM 128,786,增量贡献 RM 91,750。十个商品中有六个单独看都在拉低总利润:A3、A4、B2、B3、B4、B5。
注
按表面贡献排序会砍错。 第三章按表面贡献砍掉的是 B3、B4、B5,而稀释最严重的是副线 A3 与 A4:它们的表面贡献排在中间,增量贡献却是全线最低的两个。
「砍掉尾部三成」不是定律
逐个计算增量贡献也有局限:砍掉一个商品后,其他商品的增量贡献会变。更稳妥的做法是逐步贪心:每一步下架能让总利润增加最多的商品,直到再也没有。下面在 400 个随机世界中比较三种做法;每个世界的质量、毛利、巢参数、外部选项、维持成本都不同,并加入一个现实因素:商品线越完整,进店的买家越多,进店人数按在售款数的 次方变化。
推导
# 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)))
# 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在第三章的基准世界中(没有进店效应),贪心法只留下 F、A1、B1,利润 +16.7%。这暴露了嵌套 Logit 的偏向:模型中每个商品都只是替代品,不会带来新的买家,所以它总是偏爱窄的产品线。加入进店效应之后:按表面贡献砍三成,平均利润 -0.5%,400 个世界中有 218 个利润下降;按增量贡献砍三成,平均 +5.4%,74 个世界下降;贪心最优平均 +8.1%。贪心最优恰好砍掉三款的只有 78 个世界;在进店效应大于 0.2 的 150 个世界中,按表面贡献砍三成在 144 个世界里亏损。
假说 · 尚未验证
作者的假说(尚未验证): 在多 SKU 的电商店铺中,按增量贡献(以下架实验估计转移分流率)删减 SKU,比按表面贡献删减同样数量的 SKU,六个月后的营业利润更高。什么会证明它错: 在按店铺或按地区随机分配删减规则的试验中,前者的营业利润不高于后者。
小结
毛利稀释矩阵显示,接回毛利高于自身毛利的副线(本例中的 A3 与 A4)每多卖一件都在拉低总利润。「砍掉尾部三成」不是定律:按表面贡献砍,在加入进店效应的随机世界中多数亏损;按增量贡献砍好得多;最优的删减数量因店而异,恰好是三成的情形并不多。
Fan, Y. (2026). Enterprise Bottleneck Diagnostics, SKU Cannibalization Audits and Automation Return Bounds: Theory-of-Constraints Queueing Networks, Margin Dilution Matrices and Value-Based Advisory Pricing [企业瓶颈诊断、产品线自蚕食审计与自动化改造回报边界] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090217 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).