Every number on this page is computed by the Volume II Chapter 2 notebook's own code; the automation program uses Volume I's point estimates, and Table 2.4 Volume I's 100,000 paths (seed 8). Your notes stay on this page until you leave it; copy the memo before you go.
Meridian's board has two executive pledges on its automation program and a standing rule that every proposal arrives as an instance, not a spreadsheet. You support the chief financial officer, who must turn the pledges into an instance, find out whether they can be kept, and give the board priced options.
Use AXIOM to build the instance block by block, check plans by simulation, diagnose the clash, price the repairs, and see how the terminal term changes the optimizer's answer.
Worked Example 2.1 (Volume I, Worked Example 6.1): a round costs $120 million, closes half the gap between efficiency and a ceiling of 85, and raises workforce capability by one point; each efficiency point above today's 71 saves $10 million a year; a round can start only with at least $470 million of liquidity and capability of at least 55. The COO pledges a round every year for six years; the CFO pledges to pay out half of each year's savings; the board wants $470 million at the end of year 6. All amounts undiscounted.
In the GEOP builder, declare the decisions, the dynamics, the commitments, the start and end conditions, and the empty uncertainty block. Try to enter savings as a decision and watch the decision-variable editor refuse an induced quantity.
The CFO's spreadsheet carries the six-round savings into every plan; a plan with three rounds saves less (Proposition 2.2).
In the policy comparator, run the joint plan forward and find the year it dies; compare it with the COO's plan with all savings kept.
One forward pass of the declared dynamics (Proposition 2.2). The plan keeps running after a breach so that every breach is seen.
For the pledged six rounds, the year-end liquidity some plan can reach while keeping every commitment so far, carried forward year by year.
Under uncertainty, checking a plan is a sample of paths with its error bar: the board's floor during Volume I's digital program, on 100,000 paths (seed 8). Below: each path's lowest liquidity.
In the feasibility bench, run the deletion filter twice, with the board's conditions first and with the pledges first, and record both clashes; confirm that dropping the floor alone repairs nothing.
For each repair, find the largest payout share or the most rounds the remaining commitments allow, and rebuild Table 2.7.
In the objective designer, add a terminal credit for year-6 savings and move it from 0 to 60 years; then switch the objective to Mayer form and confirm that no plan changes. Export the instance in standard form.
Both pledges dropped; the optimizer chooses the rounds and the payouts, keeping the floor, the capability condition and the end condition. Bolza form: the six-year payout plus M years of year-6 savings. Mayer form: the payout carried in an accumulator and credited at year 6 (Theorem 2.1(i)).
The convexity ledger (Theorem 2.2): lumpy outside, linear inside; each of the 64 schedules is a small linear program.
The refusal of an induced quantity as a decision (Proposition 2.2); two clashes and a repair that must break both, and the year the joint plan dies (Theorem 2.3); and a terminal credit that changes the program's size while the Mayer rewrite changes nothing (Theorem 2.1).
The instance card, the year the joint plan dies, the two clashes, the three repairs with their prices, and a recommendation on the terminal credit, with its owner.