Peak-Shaving Periodic Quotas and Cross-Model Routing: Linear Programming against Reset Countdowns to Split Work between Heavy-Reasoning and Fast Models: chapter answers
Teams that work with writing and reasoning tools often hold two tiers of service: a heavy-reasoning model with a small quota and a fast model with an ample quota that errs more on hard problems, both reset per cycle with leftovers expiring. The common practice is first come, first served. This book tests that practice and corrects its founding blueprint against the original literature: Dantzig's Linear Programming and Extensions of 1963 supplies theory and the simplex method, not measurements of quota routing; that a linear programme is no worse than fixed routing is a theorem inside the mode…
DOI pending · monograph page goes live after publication · 5DL-B-270 · 中文版
- Chapter 1 · The Price of First Come, First Served: Exhaustion before the Reset and Waste at It
On the quiet day the picture reverses. Arrival order again exhausts H, this time by slot 8, because it spends H on a mass of routine work; only 5 of the 12 critical tasks get H, and output is 482.0 points. The fixed rul… - Chapter 2 · A Standard-Library Simplex: Exact Fractions, Bland's Rule and the Worst Case
Chapter 2 writes a simplex method in Fractions with Bland's rule and finds a shadow price of 9/40 for heavy quota. - Chapter 3 · Shadow Prices and the Reset Countdown: How the Marginal Value of Quota Falls with Time
Strong duality holds exactly on the problem of Chapter 1, and the shadow price of 9/40 for H is valid only between 400 and 900 units; with less quota it rises to 0.4375 and with more it falls to 0.0500. Tasks arriving o… - Chapter 4 · Routing across Models: Complexity Classes, Label Errors and Cascades
Chapter 4 treats changing quotas, misjudged complexity and cascades; a cascade raises the optimum from 893.00 to 944.65 points. - Chapter 5 · Peak Shaving and Valley Filling: Deferral, Pulling Forward and a Backlog under Short Reset Windows
Chapter 5 treats peak shaving under short reset windows: deferral alone yields 863.29 points, pulling routine work forward raises it to 881.75, and a backlog turns expiring quota into output. - Chapter 6 · Greedy against Linear Programming: Random Arrival, Prices Learned from a Sample, and Drift
Chapter 6 compares rules under random arrival: arrival order averages 0.8427 of the hindsight optimum, dynamic re-solving at geometric checkpoints 0.9875. - Chapter 7 · Eastern and Western Classics: Gathering and Releasing in the Guanzi, and Kantorovich's Resolving Multipliers
Chapter 7 examines "years bring dearth and plenty, so grain is dear or cheap" from the Guanzi and Kantorovich's resolving multipliers of 1939. - Chapter 8 · A Daily Task Routing Table: the Empirical Loop, the Distilled Tool and a Pre-registered Test
Chapter 8 gives the daily task routing table, the Quota Routing LP Planner and a pre-registered switchback protocol. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical source…
Illustrative model calculation, not a live quote