关于「最小可运行原型:Kano 分类与背包取舍」,《愿望形式化编译》给出的定量结论是什么?
结论:背包动态规划在 15 天剩余预算里选出价值 37 的组合,比贪心多一分;预算曲线在 28 天后边际价值跌到每天 1.00,最小原型的上限由此算出。Kano 问卷 40 份答卷里,设定为一元居首的书评功能被判成了无差异,说明分类本身要写明票差与样本量。「越晚改越贵」不当定律,原型做小的理由是学得早。
数据口径:书中金额为无币种示意单位,参数为示意,全部计算由书中程序生成;本书是非个人化经营建议,不作个人财务或投资建议,心理学文献只写关联与适用条件,区间下界不是任何收入承诺。 书中以标注框区分已发表的证据、可运行的 Python 计算(22 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 15, 37
| budget 23 days; must-be features take 8; 15 left | |
| DP pick value | 37: bundle price, reviews, sample chapter, search |
| greedy value | 36: bundle price, reading list, reviews, sample chapter |
| dropped as indifferent: dark mode |
查看完整验算程序
# Chapter 6. p61: smallest acceptable prototype as a 0-1 knapsack
# Features of a direct book-sales prototype with Kano class, build cost
# in days and a value score (all illustrative). Must-be (M) features are
# forced in, indifferent (I) ones are dropped, and dynamic programming
# picks the best one-dimensional (O) and attractive (A) set for the
# remaining days. Greedy by value per day is shown for comparison.
FEATS = [
("catalogue page", "M", 3, 0), ("checkout", "M", 4, 0),
("order email", "M", 1, 0), ("sample chapter", "O", 2, 9),
("bundle price", "O", 3, 8), ("search", "O", 4, 7),
("reading list", "A", 3, 6), ("gift note", "A", 2, 3),
("reviews", "O", 6, 13), ("dark mode", "I", 2, 0),
("wish list", "A", 4, 5), ("referral link", "A", 3, 4),
]
BUDGET = 23
forced = [f for f in FEATS if f[1] == "M"]
pool = [f for f in FEATS if f[1] in "OA"]
left = BUDGET
for f in forced:
left -= f[2]
best = [[0] * (left + 1) for _ in range(len(pool) + 1)]
for i, (_, _, w, v) in enumerate(pool, 1):
for b in range(left + 1):
best[i][b] = best[i - 1][b]
if w <= b and best[i - 1][b - w] + v > best[i][b]:
best[i][b] = best[i - 1][b - w] + v
pick, b = [], left
for i in range(len(pool), 0, -1):
if best[i][b] != best[i - 1][b]:
pick.append(pool[i - 1])
b -= pool[i - 1][2]
greedy, g_left, g_val = [], left, 0
for f in sorted(pool, key=lambda f: (-f[3] / f[2], f[0])):
if f[2] <= g_left:
greedy.append(f)
g_left -= f[2]
g_val += f[3]
print("budget {} days; must-be features take {}; {} left".format(
BUDGET, BUDGET - left, left))
print("DP pick value {:>3}: {}".format(
best[len(pool)][left], ", ".join(sorted(f[0] for f in pick))))
print("greedy value {:>3}: {}".format(
g_val, ", ".join(sorted(f[0] for f in greedy))))
print("dropped as indifferent: {}".format(
", ".join(f[0] for f in FEATS if f[1] == "I")))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《创始人模糊愿望形式化编译、约束反演与可执行商业系统生成母典》第 6 章「最小可运行原型:Kano 分类与背包取舍」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-414 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026414,
author = {Fan, Yafu},
title = {Formalising Fuzzy Founder Wishes: Constraint Inversion, Falsifiable Spec Synthesis and Executable Revenue System Compilation},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}