Vol. I, Ch. 15 · Part 4. Integration and Transition · Week 7
Mathematical Formulation of Enterprise Optimization

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. 15Mathematical Formulation of Enterprise Optimization

Learning outcomes
After completing this chapter, the reader should be able to:
- Formulate a transformation decision as the General Enterprise Optimization Problem—decisions, objective, commitments, horizon, uncertainty, and the rules the company can implement, each with an owner—and explain why it must be posed on the unified company.
- Explain why feasibility comes before optimality, and read the binding commitments and their multipliers as the priced list of what the company has promised.
- Handle several objectives: recognize conflict, trace the efficiency frontier with constraint-based methods, and read its slopes as exchange rates that the board chooses.
- Choose among static, dynamic, stochastic, robust, and adaptive formulations, and explain rules versus plans, rolling plans and their terminal conditions, the flaw of averages, and the value of information.
- Explain how architecture shapes the optimum—decentralization with prices, the value of coordination, holdable optima—and what Volume II inherits: a solver-neutral problem with certificates.
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.
15.1 Why Enterprise Optimization?
15.2 The Problem, Stated
Definition 15.1 (General Enterprise Optimization Problem) · Proposition 15.1 (Enterprise Optimization Requires Unified Representation) · Theorem 15.1 (General Enterprise Optimization Representation Theorem) · Table 15.115.3 Decisions, Objectives, and Commitments
Definition 15.2 (Enterprise Decision Variable) · Definition 15.3 (Enterprise Policy) · Proposition 15.2 (Enterprise Transformation Policies Determine Enterprise Trajectories) · Definition 15.4 (Enterprise Objective Function and Value Functional) · Definition 15.5 (Enterprise Constraint) · Proposition 15.3 (Enterprise Constraints Define Feasible Evolution) · Table 15.2 · Table 15.315.4 Feasibility Before Optimality
Definition 15.6 (Feasible Enterprise Region, Solution Space, and Optimal Solution) · Proposition 15.4 (Enterprise Feasibility Precedes Enterprise Optimality) · Theorem 15.2 (Feasible Enterprise Solution Theorem)15.5 Optimality Conditions and Shadow Prices
Theorem 15.3 (Enterprise Optimality Conditions) · Proposition 15.5 (Stable Values, Twitchy Decisions)15.6 Time, Uncertainty, and Rules
Theorem 15.4 (Dynamic Enterprise Optimization Theorem) · Proposition 15.6 (Enterprise Optimization Is Path-Dependent) · Proposition 15.7 (Enterprise Uncertainty Modifies Optimal Policies) · Figure 15.115.7 Multiple Objectives and the Efficiency Frontier
Proposition 15.8 (Enterprise Performance Objectives May Conflict) · Definition 15.7 (Pareto Optimal Enterprise Solution) · Definition 15.8 (Enterprise Efficiency Frontier) · Theorem 15.5 (Enterprise Pareto Frontier Theorem)15.8 Architecture, Holdability, and the Unified Theorem
Proposition 15.9 (Enterprise Architectures Influence Feasible Solutions) · Theorem 15.6 (Enterprise Architecture Optimality Theorem) · Definition 15.9 (Enterprise Optimization Architecture) · Theorem 15.7 (Unified Enterprise Optimization Theorem) · Table 15.4Worked Example 15.1: What Does the Board's Appetite Cost?
Figure 15.2 · Table 15.5AXIOM Lab 1.15: Pricing Meridian's Commitments
Appendix 15.A: Formal Statements and Proofs
Theorem 15.3, formal statement and proof · Theorem 15.5, formal statement and proof · Theorem 15.6, formal statement and proof
Concepts in this chapter
AXIOM Lab
AXIOM Lab 1.15: Pricing Meridian's Commitments
The business situation. Meridian's board wants every major transformation decision brought to it as a problem it can audit: decisions with owners, objectives with declared weights, commitments with prices, and the formulation's promise stated. You prepare the first such pack, on the digital program's risk levers.
Your objective. Use AXIOM to build, audit, and solve a GEOP instance, read its prices and its frontier, and compare formulations.
What you will do. Open AXIOM, choose Lab 1.15 (module AXIOM-15), and load the Meridian model.
- GEOP builder. Assemble the digital program's instance from the declared inventories—the line and the phasing as decisions, the levers' costs as the objective, the appetite, the covenant, and the capability floor as commitments—and run the well-posedness checks.
- Constraint manager. Run the consistency and viability audits. Cap the line at $100 million and the delay at two quarters, then tighten the appetite below 3 percent; read the minimal infeasible set that the audit reports.
- A small allocation. In the preloaded allocation instance—one budget, three capital stocks—watch the unconstrained first-order point demand a negative investment, then find the optimum at the corner where the nonnegativity constraint binds, and read its multipliers.
- Multi-objective explorer. Trace the risk–cost frontier of the digital program by floors and by weight sweeps; compare the two, and read the exchange rate at the board's appetite.
- Scenario generator and policy simulator. Run the certainty-equivalent, robust, and stochastic formulations side by side; then test a rule that slows the build when cash runs low against the committed delay.
What to look for. Feasibility comes before optimality (Theorem 15.2); everything that binds has a price, and slack commitments have none (Theorem 15.3); the frontier's slope is the multiplier (Theorem 15.5(iv)); and the formulation's promise changes the answer (Proposition 15.7).
Discussion questions. (1) Which of Meridian's commitments would you price first, and who should see the price? (2) A director proposes moving the appetite from 5 to 3 percent “to be safe”. What would you show the board? (3) Which resources in your own organization are divided by fixed shares that prices would divide better?
Deliverable. A one-page priced-commitments exhibit for the board: the declared instance with its owners; the binding commitments and their prices; the frontier, with the chosen point and its exchange rate; the formulation's promise; and the certificate that the numbers carry.
Time and outcomes. About 90 minutes; supports LOS 15.1, 15.2, 15.3, and 15.4. The Chapter 15 Excel workbook and Python notebook on this page reproduce the lab's calculations.
This chapter is instrumented by:
These certificates are computed in AXIOMSee it in AXIOM →
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.




