关于「每次从 ATM 取多少:经济批量公式」,《换汇点差、DCC 陷阱与居留天数》给出的定量结论是什么?

结论:第三章用经济批量公式回答每次取多少:固定费用 25 时最优每次 10954;剩余现金要以 0.06 换回时,最优是 12000 而不是取满。

数据口径:书中的汇率、费率与行程均为示意模型;全部计算由书中程序生成;本书不是税务、移民、法律或投资建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

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

fee FQ*withdrawalscost at Q*cost at capcost at 2,000
25109542.19109.5109.5310.0
50154921.55154.9154.9610.0
100219091.10219.1220.01210.0
查看完整验算程序
# Chapter 3. p05: How much cash to take out of the ATM at a time? The
# Baumol-Tobin rule: a trip needs D = 24,000 of local cash over L = 10
# days; each withdrawal costs a fixed F; cash held loses theta = 0.001
# of its value per day (loss, theft, the cost of guarding it). Holding
# Q/2 on average for L days costs theta L Q / 2, so the best amount is
# Q* = sqrt(2 F D / (theta L)). Many ATMs cap a withdrawal at 20,000.
# No sampling.
from math import sqrt

D, L, THETA, CAP = 24000.0, 10.0, 0.001, 20000.0

def cost(q, f):
    return f * D / q + THETA * L * q / 2

if __name__ == "__main__":
    print("   fee F   Q*       withdrawals   cost at Q*   cost at cap"
          "   cost at 2,000")
    for f in (25.0, 50.0, 100.0):
        q = sqrt(2 * f * D / (THETA * L))
        print("   {:5.0f}   {:6.0f}   {:11.2f}   {:10.1f}   {:11.1f}"
              "   {:13.1f}".format(f, q, D / q, cost(q, f),
                                   cost(min(q, CAP), f), cost(2000.0, f)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《多币种换汇点差微观结构、动态货币转换陷阱与税务居留天数规划》第 3 章「每次从 ATM 取多少:经济批量公式」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-108 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026108,
  author    = {Fan, Yafu},
  title     = {Multicurrency FX Spread Microstructure, Dynamic Currency Conversion Traps and Tax-Residency Day-Counting Thresholds},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论