关于「帕累托前沿与加权和盲区:三种权重比较」,《同心圆志业与亲密配置》给出的定量结论是什么?
结论:第六章证明加权求和只找到示意前沿 601 点中的 132 点,看不见核心层刚好越过阈值那一段,而先设下限的 ε 约束法能找回它。
数据口径:书中参数为示意;全部计算由书中程序生成;本书不替代心理咨询、婚恋咨询或家庭辅导,也不是个人化建议。 第二章用社会脑层级与衰减动力学算出核心底座定额,示意参数下每周 14.38 小时。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 132, 601
Pareto points on the grid: 601
points reached by any weighted sum: 132
gap: core hours 0.0 to 15.8 never chosen
edge values v 0.0000 to 0.8696, u 1.000 to 0.783
gap: core hours 31.4 to 32.8 never chosen
edge values v 0.9999 to 1.0000, u 0.553 to 0.531
gap: core hours 32.8 to 60.0 never chosen
edge values v 1.0000 to 1.0000, u 0.531 to 0.000
short gaps under 1 hour (weight-grid resolution): 12
at h = 12.0 (threshold centre): v = 0.499, u = 0.837
share of the front invisible to weighted sums: 0.780查看完整验算程序
# Chapter 6. p61: weighted sums miss the non-convex part of the front
# One budget of 60 hours: h to the core, 60 - h to mission.
# Core value is S-shaped (a maintenance threshold): v(h) is a logistic
# curve centred at 12 hours, scale 2, rescaled to [0, 1].
# Mission value is concave: u(h) = ((60 - h) / 60) ** 0.8.
# Every grid point is Pareto optimal (v rises, u falls). We scan 1,001
# weights w and record which points maximise w v + (1 - w) u
# (Das and Dennis 1997). Shapes are illustrative.
import math
N = 601
HS = [k * 0.1 for k in range(N)]
def logistic(h):
return 1.0 / (1.0 + math.exp(-(h - 12.0) / 2.0))
L0, L1 = logistic(0.0), logistic(60.0)
V = [(logistic(h) - L0) / (L1 - L0) for h in HS]
U = [((60.0 - h) / 60.0) ** 0.8 for h in HS]
found = set()
for j in range(1001):
w = j / 1000.0
best = max(range(N), key=lambda i: (w * V[i] + (1 - w) * U[i], -i))
found.add(best)
hit = sorted(found)
print("Pareto points on the grid: %d" % N)
print("points reached by any weighted sum: %d" % len(hit))
gaps, short = [], 0
for a, b in zip(hit, hit[1:]):
if b - a > 10:
gaps.append((a, b))
elif b - a > 1:
short += 1
for a, b in gaps:
print("gap: core hours %.1f to %.1f never chosen" % (HS[a], HS[b]))
print(" edge values v %.4f to %.4f, u %.3f to %.3f"
% (V[a], V[b], U[a], U[b]))
print("short gaps under 1 hour (weight-grid resolution): %d" % short)
print("at h = 12.0 (threshold centre): v = %.3f, u = %.3f"
% (V[120], U[120]))
print("share of the front invisible to weighted sums: %.3f"
% (1.0 - len(hit) / N))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《普世志业大爱与私密关系小爱的相容边界:同心圆预算分配与非零和伦理母典》第 6 章「帕累托前沿与加权和盲区:三种权重比较」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-429 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026429,
author = {Fan, Yafu},
title = {Reconciling Universal Mission and Intimate Attachment: Concentric Time-Energy Allocation, Role-Conflict Damping and Non-Zero-Sum Ethics},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}