关于「季末降价的有限期动态规划:什么时候降、降多少」,《季前订货临界分位母典》给出的定量结论是什么?
结论:第五章用有限期动态规划求季末降价表,库存周数规则可得最优收入的 0.9878 以上,而按日历降价在库存偏少时不如不降价。
数据口径:书中的商品、门店与需求参数均为示意;全部计算由书中程序生成;本书是非个人化经营建议。 第一章用边际算术推出临界分位,示意参数下只有毛利率恰为 0.3750 时最优订量才等于平均数,毛利八成的商品按平均数订会少赚 6.96 %;据施韦策与卡雄实验的已发表数据重建,受试者把订量向平均数拉了 0.644(高利润)与 0.787(低利润)的距离。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.9878
| start n | rule | E[revenue] | E[units left] | vs optimal |
|---|---|---|---|---|
| 20 | never | 1849.0 | 1.78 | 0.9859 |
| 20 | calendar | 1761.8 | 0.04 | 0.9394 |
| 20 | cover | 1873.8 | 0.56 | 0.9991 |
| 20 | optimal | 1875.4 | 0.60 | 1.0000 |
| 30 | never | 2147.3 | 10.03 | 0.9052 |
| 30 | calendar | 2314.6 | 1.84 | 0.9758 |
| 30 | cover | 2357.0 | 0.57 | 0.9936 |
| 30 | optimal | 2372.2 | 1.38 | 1.0000 |
| 40 | never | 2300.0 | 20.00 | 0.8305 |
| 40 | calendar | 2576.1 | 9.37 | 0.9302 |
| 40 | cover | 2735.7 | 0.90 | 0.9878 |
| 40 | optimal | 2769.5 | 2.96 | 1.0000 |
核心公式
\[V_t(n,i) = \max_{j \ge i}\; E\big[p_j \min(D_j, n) + V_{t-1}(n - \min(D_j, n),\, j)\big].\]
查看完整验算程序
# Chapter 5. p52: Markdown rules of thumb against the optimal programme.
# Same market as p51 (ladder 100/80/60/40, Poisson demand with
# lam(p) = 2 exp(2.5 (1 - p/100)), 10 weeks, outlet value 15).
# Rules evaluated exactly by backward recursion:
# never hold full price, dump the rest at the outlet
# calendar 100 for weeks 10-6, 80 for weeks 5-3, 60 for weeks 2-1
# cover one step down whenever stock / (weekly demand * weeks
# left) exceeds 1.5 (weeks-of-cover trigger)
# optimal the dynamic programme of p51
# Output: expected revenue (incl. outlet) and expected units left over.
import math
PRICES = (100.0, 80.0, 60.0, 40.0)
T, NMAX, SALVAGE, K, BASE = 10, 60, 15.0, 2.5, 2.0
def lam(p):
return BASE * math.exp(K * (1.0 - p / 100.0))
def pmf_table(rate, nmax):
out = [math.exp(-rate)]
for d in range(1, nmax + 1):
out.append(out[-1] * rate / d)
return out
PMF = [pmf_table(lam(p), NMAX) for p in PRICES]
def step(v, n, j, money):
pm = PMF[j]
pay = PRICES[j] if money else 0.0
terms = [pm[d] * (pay * d + v[n - d][j]) for d in range(n)]
tail = 1.0 - math.fsum(pm[:n])
terms.append(tail * (pay * n + v[0][j]))
return math.fsum(terms)
def terminal(money):
unit = SALVAGE if money else 1.0
return [[unit * n for _ in PRICES] for n in range(NMAX + 1)]
def solve_optimal():
v = terminal(True)
for t in range(1, T + 1):
new = [[0.0] * len(PRICES) for _ in range(NMAX + 1)]
for n in range(NMAX + 1):
for i in range(len(PRICES)):
vals = [(step(v, n, j, True), j)
for j in range(i, len(PRICES))]
best = max(x for x, _ in vals)
OPT[(t, n, i)] = min(j for x, j in vals
if x >= best - 1e-9)
new[n][i] = best
v = new
def evaluate(rule, money=True):
v = terminal(money)
for t in range(1, T + 1):
new = [[0.0] * len(PRICES) for _ in range(NMAX + 1)]
for n in range(NMAX + 1):
for i in range(len(PRICES)):
new[n][i] = step(v, n, choose(rule, t, n, i), money)
v = new
return v
def choose(rule, t, n, i):
if rule == "optimal":
return OPT[(t, n, i)]
if rule == "never":
return i
if rule == "calendar":
target = 0 if t >= 6 else (1 if t >= 3 else 2)
return max(i, target)
cover = n / (lam(PRICES[i]) * t)
return min(i + 1, len(PRICES) - 1) if cover > 1.5 else i
OPT = {}
solve_optimal()
print("start n rule E[revenue] E[units left] vs optimal")
for n0 in (20, 30, 40):
res = {}
for rule in ("optimal", "never", "calendar", "cover"):
rev = evaluate(rule)[n0][0]
left = evaluate(rule, money=False)[n0][0]
res[rule] = (rev, left)
for rule in ("never", "calendar", "cover", "optimal"):
rev, left = res[rule]
print("{:7d} {:8} {:10.1f} {:13.2f} {:.4f}".format(
n0, rule, rev, left, rev / res["optimal"][0]))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《买手季前订货报童临界分位、尺码曲线狄利克雷先验与季末降价动态规划母典》第 5 章「季末降价的有限期动态规划:什么时候降、降多少」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-211 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026211,
author = {Fan, Yafu},
title = {Newsvendor Critical Fractiles for Pre-Season Buying, Dirichlet Size-Curve Priors and Dynamic-Programming End-of-Season Markdowns},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}