Every number on this page is computed by the Volume II Chapter 10 notebook's own code; chances under Chapter 9's law use the book's 100,000 paths (seed 8) and 100,000 fresh paths (seed 26209). Your notes stay on this page until you leave it; copy the memo before you go.
The audit committee doubts the law behind Chapter 9's package and asks for a guarantee that does not depend on odds. The engineering office and the treasury have stated, in words, how far deviations and a closure could go; the board has stated a goal for cost. The committee wants the guarantee, its price, and how it would fare if the law were right. You support the team preparing the answer.
Use AXIOM to solve robust counterparts on declared sets, grade the declarations and choose by max-min, judge the packages against Chapter 9's law, and learn and certify a neuro-fuzzy price surface.
Worked Example 10.1: the engineering office declares that execution and market deviations stay within D of plan in every quarter; the treasury, that at most one funding window closes during the program, removing at most S. The floor of $350 million must hold in every quarter on every such future. A standby line costs 3 percent of its size over the program; a quarter of delay costs $8 million. In their own words, deviations are "usually within $50 million of plan, never beyond $200 million", and a closure is "most plausibly about $120 million, never above $300 million". The board: a guarantee "should cost about $5 million or less and surely no more than $20 million".
In the uncertainty-set builder, enter bounds on deviations and on a closure; solve the robust counterpart and find the binding quarter and the worst case.
The worst case on the set (Proposition 10.1(ii)): deviations at −D in every quarter and the closure in the first quarter. Bars: the plan's margin above the floor, quarter by quarter, split into what the deviations use, what is left for the closure, and the delay's lift. The robust commitment in quarter k: mk + ℓkφ − D − (S − l)+ ≥ 0.
Deviations at −$125 million in every quarter, the $203 million line, a closure of $210 million in the quarter shown: the least slack over the 12 quarters ($ million).
In the membership editor, enter the offices' words, compute the cuts and the cost of each, and find the max-min choice against the board's goal.
Evaluate the robust packages on Chapter 9's paths and on fresh ones; place them beside the chance-constrained frontier.
100,000 paths; fresh paths within 0.3 points. D, S: the bounds on deviations and on a closure; Paths: share of the law's paths inside the set ($ million; delays in quarters; percent).
In the neuro-fuzzy trainer, learn the price surface rule by rule and overall; read the rules and compare their accuracy.
Compare the surface with exact solutions on a grid; find where it errs most, and certify one revised declaration exactly.
Surface minus exact robust cost on the $5 million grid, D from $25 to $250 million, S from $0 to $350 million. Teal: the surface charges more; red: less.
A binding quarter where the plan's margin is smallest (Proposition 10.1); a set's guarantee that fails often under the law when the set leaves out deviations (Theorem 10.1(iii)); a graded price and a max-min choice near Chapter 9's cost (Theorem 10.2); rules that rediscover the line's fee and the price of delay, and an error that peaks at the corner (Theorem 10.3).
The guarantee, its set and price, its chance of a breach if the law is right, the max-min choice, and the declarations it rests on.