Vol. I, Ch. 5 · Part 2. Mathematical Representation · Week 3
Enterprise State Representation

Jump to any chapter
Volume I: Foundations and Mathematical Framework
- Ch. 1Introduction to Dynamic Corporate Transformation
- Ch. 2Enterprise Systems and Transformation
- Ch. 3Mathematical Foundations
- Ch. 4Enterprise Modeling Principles
- Ch. 5Enterprise State Representation
- Ch. 6Enterprise Transformation Operators
- Ch. 7Dynamic Enterprise Systems
- Ch. 8Stochastic Enterprise Dynamics
- Ch. 9Enterprise State Architecture
- Ch. 10Enterprise Capital Architecture
- Ch. 11Enterprise Performance Architecture
- Ch. 12Enterprise Risk, Resilience, and Robustness Architecture
- Ch. 13Unified Enterprise Transformation Architecture
- Ch. 14Mathematical Analysis of the Unified Enterprise Transformation Architecture
- Ch. 15Mathematical Formulation of Enterprise Optimization
- Ch. 16Synthesis, Future Directions, and Transition to Volume II
Volume II: Enterprise Optimization & Applications
- Ch. 1Introduction to Enterprise Optimization
- Ch. 2The General Enterprise Optimization Problem Revisited
- Ch. 3Convex Enterprise Optimization
- Ch. 4Nonlinear and Mixed-Integer Enterprise Optimization
- Ch. 5Dynamic Enterprise Optimization
- Ch. 6Optimal Control of Enterprise Systems
- Ch. 7Dynamic Programming for Enterprise Systems
- Ch. 8Hamilton–Jacobi–Bellman Enterprise Framework
- Ch. 9Stochastic Enterprise Optimization
- Ch. 10Neuro-Fuzzy Robust Enterprise Optimization
- Ch. 11Distributionally Robust Enterprise Optimization
- Ch. 12Multi-Objective Enterprise Optimization
- Ch. 13Machine Learning for Enterprise Transformation
- Ch. 14Artificial Intelligence for Enterprise Optimization
- Ch. 15Enterprise Digital Twins and Autonomous Enterprise Transformation
- Ch. 16Enterprise Applications and Integrated Transformation Case Studies
Lecture
Watch the chapter summary
Watch the chapter summary
Vol. I, Ch. 5Enterprise State Representation

Learning outcomes
After completing this chapter, the reader should be able to:
- Explain what a company's state is—the memory its future requires—and use that test to decide what belongs in a state description.
- Build a declared state for a company, with readings, units, types, and measurement sources, and distinguish state variables from parameters, explaining why the line between them moves with the planning horizon.
- Read a company's position in its state space: configurations as points, constraints as walls, the feasible region and its binding constraints, and when a blended operating model is feasible.
- Interpret transformation paths in continuous and discrete time, explain how program phases join, and explain why some models carry a built-in validity horizon.
- Explain equilibrium and its stability, estimate how long a company takes to settle using the contraction rule, and explain why a stable state need not be a good one.
Reading guide
Work through the chapter in section order; the full development, proofs, and worked examples are in the book — this page indexes them and does not replace them.
5.1 Why the State Needs a Foundation
5.2 The Minimal State: The Memory the Future Requires
Definition 5.1 (Enterprise State) · Proposition 5.1 (Instantaneous Uniqueness of State) · Theorem 5.1 (Enterprise State Representation Theorem)5.3 State Variables and Parameters
Definition 5.2 (Enterprise State Variable) · Definition 5.3 (Enterprise State Vector) · Table 5.1 · Table 5.25.4 State Spaces and Configurations
Definition 5.4 (Enterprise State Space) · Definition 5.5 (Enterprise Configuration) · Proposition 5.2 (Configurations Correspond to Points) · Theorem 5.2 (Enterprise Configuration Theorem) · Figure 5.15.5 Trajectories and Transitions
Definition 5.6 (Enterprise Trajectory) · Proposition 5.3 (Trajectories: Ordering, Concatenation, Sampling) · Theorem 5.3 (Trajectory Existence Theorem) · Proposition 5.4 (Evolution Through Transitions) · Figure 5.25.6 Equilibrium States
Definition 5.7 (Enterprise Equilibrium) · Theorem 5.4 (Enterprise Equilibrium Theorem) · Table 5.3 · Figure 5.35.7 Feasible Regions
Definition 5.8 (Enterprise State Constraint) · Definition 5.9 (Feasible Enterprise State) · Proposition 5.5 (Feasibility Is Simultaneous Satisfaction) · Theorem 5.5 (State Space Completeness Theorem) · Table 5.4 · Figure 5.45.8 Dimension and Visualization
Definition 5.10 (Enterprise State Dimension) · Figure 5.5Worked Example 5.1: Where Does the Turnaround Settle?
Table 5.5AXIOM Lab 1.5: Meridian's Room to Maneuver
Appendix 5.A: Formal Statements and Proofs
Theorem 5.1, formal statement and proof · Theorem 5.2, formal statement and proof · Theorem 5.4, formal statement and proof · Theorem 5.5, formal statement and proof
Concepts in this chapter
AXIOM Lab
AXIOM Lab 1.5: Meridian's Room to Maneuver
The business situation. Before choosing among its three options, Meridian's board has asked the strategy office for a one-page “state of the company”: where Meridian stands, which walls—covenants, liquidity floors, risk limits—are closest, how much room each option leaves, and where each would settle. You are in the strategy office.
Your objective. Use AXIOM to declare Meridian's state, map its feasible region, follow each option's path against the walls, and find where the turnaround settles and how fast.
What you will do. Open AXIOM, choose Lab 1.5 (module AXIOM-05), and load the Meridian state.
- Declare the state. In the state constructor, review Meridian's declaration (Table 5.2). Switch the attrition rate from parameter to state variable and rerun the digital program to see what the switch changes.
- Build the walls. In the constraint sculptor, add the constraints of Table 5.4 one at a time and watch the feasible region shrink. Probe today's state and the digital program's low point, and record the binding set and the slack on each wall.
- Sample a path. In the trajectory sampler, run the digital program in continuous time, take quarterly readings, and join its two phases. Check that half-yearly readings equal two quarterly steps.
- Find the steady state. In the equilibrium bench, run the turnaround's annual map from today and from two other starting states, with the day-one bound overlaid. Then run the start-up map and watch it leave zero for the market wall.
- Compare profiles. In the profile theater, display today's state and the three Year-5 states in parallel coordinates, with the distance readout alongside.
What to look for. Every starting point of the turnaround converges to the same steady state, inside the day-one bound (Theorem 5.4); the binding set is empty today, but the liquidity floor comes close on the digital path; and profiles that look alike on the page can be far apart in the declared distance.
Discussion questions. (1) How high could the board raise its liquidity floor before the digital program, as modeled, becomes infeasible, and what floor would you recommend? (2) Is the turnaround's steady state a configuration the board should want? (3) Which of Meridian's parameters would become state variables in a ten-year plan?
Deliverable. A one-page note to the CFO: Meridian's binding and near-binding constraints today and along each option's path, the slack at the tightest point, and where and when the turnaround settles.
Time and outcomes. About 45–60 minutes; supports LOS 5.2, 5.3, and 5.5. The Chapter 5 Excel workbook and Python notebook on this page reproduce the lab's calculations.
This chapter is instrumented by:
Launch the module, load the chapter model, modify inputs, run the optimization, and compare against the worked examples in the book.
Downloads
All three companions come from the chapter's seeded engine: the notebook and workbook reproduce the book's Worked Example and AXIOM Lab and check every number against it — the MFMF convention, carried forward.




