Skip to content

DCT Lexicon · Optimization

Linear program (joint consistency)

A problem whose objective and constraints are linear; AXIOM uses one to test whether the declared commitments can hold together, and if they cannot, to name a minimal set that cannot.

Drafted for the author's approval from Vol. I, Theorem 16.4 (gate R2) and Theorem 13.5

In depth

In the book

(R2) Unified consistency: the ledgers’ declarations agree on what they share, and the commitments can hold together. Artifact: the consistency certificate, or a minimal set of commitments that cannot hold together.

Vol. I, Theorem 16.4, gate (R2), verbatim

Executive example

As first declared, the books did not close. The program’s deepest draw of $138 million and the treasury’s buffer of $187 million for a 90th-percentile closure of the funding window each passed its own sign-off against the $270 million of cash above the floor, but together they claim $325 million, $55 million more than there is (Chapter 13).

Vol. I, Worked Example 16.1, Step 2, verbatim

Common misreading

A common mistake is to treat two passed bilateral checks as a joint certificate.

Vol. I, LOS 13.4, verbatim

How AXIOM uses it

AXIOM writes the declared commitments as a linear feasibility problem, solves it with HiGHS and, if no plan meets them all, finds a minimal set that cannot hold together by a deletion filter. The answer is exact: feasible, or the named set and its owners.

Drafted for the author's approval, from AXIOM's method passport "R2 joint consistency"

In the book: Vol. I, Ch. 13: Unified Enterprise Transformation Architecture · Vol. I, Ch. 16: Synthesis, Future Directions, and Transition to Volume II

Related: Optimization Readiness R1–R4 · Mixed-integer programming (MILP)

V1.Thm.16.4 · V1.Thm.13.5 · V1.WE.16.1