What does Cross-Border Settlement Friction and Conversion Batches conclude, in numbers, about “A Month's Conversion Calendar: Dynamic Programming, Minimum Charges and Volume Tiers”?
Answer: Chapter 5 lays out a monthly conversion calendar by dynamic programming at 174.2 dollars against 1003.1 for converting only on payment days; with a minimum charge the best batch sits at the kink of 30000 dollars, not the square-root 73993.
Scope of the numbers: All fees, rates, volatilities, amounts and group structures are illustrative; all calculations are generated by the book's programs; the book is not individual legal, tax or financial advice. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 1003.1, 174.2
| receipts 319000 USD; payments due on days 10, 20, 30 | ||||||
| calendar | convs | fees | hold | risk | total | SD |
| daily | 30 | 300.0 | 0.0 | 0.0 | 300.0 | 0 |
| weekly | infeasible | |||||
| due days only | 3 | 30.0 | 150.9 | 822.2 | 1003.1 | 907 |
| every 4th day | 8 | 80.0 | 51.2 | 110.9 | 242.1 | 333 |
| DP optimum | 12 | 120.0 | 24.8 | 29.4 | 174.2 | 171 |
| DP conversion days: 3 6 8 10 13 16 18 20 22 24 27 30 |
Show the full program
# Chapter 5. p51: the month's conversion calendar by dynamic programming.
# Known receipts r_t for 30 days (weekday pattern and one promotion day,
# illustrative) and home-currency supplier payments due on days 10, 20
# and 30. A conversion at the end of day j converts the whole waiting
# balance (zero-balance property, as in Wagner and Whitin 1958). Cost of
# a calendar: F per conversion + funding rate on every overnight balance
# + theta * sigma^2 * balance^2 per night. Converted money must cover
# each payment by its due day. Exact DP over the last conversion day.
import math
F, I_DAY, SIGMA, THETA = 10.0, 0.04 / 365.0, 0.003, 0.001
WEEK = [1.1, 1.0, 1.0, 0.9, 1.0, 1.2, 0.8]
REC = [round(10000 * WEEK[t % 7] * (3.0 if t == 17 else 1.0))
for t in range(30)]
NEED = {9: 80000, 19: 90000, 29: 100000} # day index -> USD-equivalent
CUM = [0]
for x in REC:
CUM.append(CUM[-1] + x)
def need_by(t):
return math.fsum(v for d, v in NEED.items() if d <= t)
def segment(i, j):
# receipts of days i..j wait until the end of day j
if any(CUM[i] < need_by(t) for t in range(i, j)):
return None
if CUM[j + 1] < need_by(j):
return None
nights = [CUM[t + 1] - CUM[i] for t in range(i, j)]
hold = math.fsum(I_DAY * b for b in nights)
risk = math.fsum(THETA * SIGMA ** 2 * b * b for b in nights)
return F, hold, risk, math.fsum(b * b for b in nights)
def cost_of(days):
parts, start = [], 0
for j in days:
seg = segment(start, j)
if seg is None:
return None
parts.append(seg)
start = j + 1
return [math.fsum(p[k] for p in parts) for k in range(4)]
best = [None] * 31
best[0] = (0.0, [])
for j in range(30):
for i in range(j + 1):
if best[i] is None or segment(i, j) is None:
continue
c = best[i][0] + math.fsum(segment(i, j)[:3])
if best[j + 1] is None or c < best[j + 1][0]:
best[j + 1] = (c, best[i][1] + [j])
plans = [("daily", list(range(30))),
("weekly", [6, 13, 20, 27, 29]),
("due days only", [9, 19, 29]),
("every 4th day", [3, 7, 11, 15, 19, 23, 27, 29]),
("DP optimum", best[30][1])]
print("receipts %d USD; payments due on days 10, 20, 30" % CUM[-1])
print("%-14s %5s %6s %6s %6s %7s %5s"
% ("calendar", "convs", "fees", "hold", "risk", "total", "SD"))
for name, days in plans:
c = cost_of(days)
if c is None:
print("%-14s infeasible" % name)
continue
sd = SIGMA * math.sqrt(c[3])
print("%-14s %5d %6.1f %6.1f %6.1f %7.1f %5.0f"
% (name, len(days), c[0], c[1], c[2], math.fsum(c[:3]), sd))
print("DP conversion days: " + " ".join(str(d + 1) for d in best[30][1]))Single source and citation
Fan, Y. (2026). Cross-Border Settlement Frictions and Compliant Treasury Scheduling: Minimum-Loss Network Flows over Multi-Currency Channel Fees and Conversion Slippage (Version 1.0.0), Chapter 5: A Month's Conversion Calendar: Dynamic Programming, Minimum Charges and Volume Tiers. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-280 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026280,
author = {Fan, Yafu},
title = {Cross-Border Settlement Frictions and Compliant Treasury Scheduling: Minimum-Loss Network Flows over Multi-Currency Channel Fees and Conversion Slippage},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Each Receipt or in Batches: One Month's Ledger of Conversion Friction
- Chapter 2 · The Price of Waiting: How Exchange-Rate Risk Pushes the Square Root towards a Cube Root
- Chapter 3 · A Network of Currency Channels: Minimum-Loss Flows and the Shadow Price of Money
- Chapter 4 · Offset Before You Transfer: Multilateral Netting and the Fewest Payments
- Chapter 6 · Robustness: Wrong Parameters, Fat-Tailed Rates and a Written Loss Budget
- Chapter 7 · Eastern and Western Sources Examined: the Quanfu Office Gathers and Releases, Fibonacci Chains the Rates
- Chapter 8 · Closing the Loop: the Monthly Batch Table, the Conversion Batch Calculator and a Pre-Registered Test