Skip to content
Dynamic Corporate Transformation

Vol. I, Ch. 15 · Part 4. Integration and Transition · Week 7

Mathematical Formulation of Enterprise Optimization

Learning outcomes

After completing this chapter, the reader should be able to:

  1. Formulate the General Enterprise Optimization Problem in canonical form and instantiate it for a declared enterprise.
  2. Identify enterprise decision variables and distinguish decisions from controls, policies, and programs.
  3. Define enterprise objective functions and value functionals from the ledgers of Parts II–IV.
  4. Construct enterprise constraint systems across the nine declared classes and audit their consistency.
  5. Formulate multi-objective enterprise optimization problems and interpret their scalarizations.
  6. Distinguish static, dynamic, multi-period, stochastic, robust, and adaptive formulations and know when each is the honest one.
  7. Analyze feasible enterprise solution spaces, including their viability-honest cores.
  8. Interpret Pareto-optimal enterprises and efficiency frontiers as governance objects.
  9. Evaluate enterprise trade-offs through multipliers, shadow prices, and frontier slopes.
  10. Prepare enterprise models for the solution methodologies of Volume II without committing to any of them.

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.

  1. Why Enterprise Optimization?

    Why Enterprise Optimization?

  2. The Problem, Stated

    The Problem, Stated

  3. Decision Variables and Policies

    Decision Variables and Policies

  4. Enterprise Objective Functions

    Enterprise Objective Functions

  5. Enterprise Constraint Systems

    Enterprise Constraint Systems

  6. Feasible Regions and Solution Spaces

    Feasible Regions and Solution Spaces

  7. Enterprise Optimality Conditions

    Enterprise Optimality Conditions

  8. Multi-Objective Optimization and the Pareto Frontier

    Multi-Objective Optimization and the Pareto Frontier

  9. Dynamic and Multi-Period Optimization

    Dynamic and Multi-Period Optimization

  10. Stochastic, Robust, and Adaptive Formulations

    Stochastic, Robust, and Adaptive Formulations

  11. Enterprise Policy Design

    Enterprise Policy Design

  12. Architecture and the Unified Optimization Theorem

    Architecture and the Unified Optimization Theorem

  13. Computational Architecture and AI-Assisted Optimization

    Computational Architecture and AI-Assisted Optimization

  14. Worked Examples

    Worked Examples

  15. Transition to Volume II

    Transition to Volume II

  16. Chapter Summary

    Chapter Summary

  17. Exercises

    Exercises

  18. Notes and Sources

    Notes and Sources

On the map

AXIOM

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.

Exercises

24 exercises, grouped A concept checks · B mathematical · C computational · D enterprise applications. Starred (★) exercises are on the advanced track. Full solutions appear in the Instructor's Manual, Chapter 15.

A. Concept checks

  1. 15.1
    For each of the three inherited frameworks criticized in Section (see book) (portfolio selection, capacity planning, valuation maximization), state precisely which blocks of (see book)–(see book) it freezes, per Theorem (see book)(ii).
  2. 15.2
    Build the decision inventory of Table (see book) for an enterprise you know: three declared levers with owners and admissible bands, and one commonly assumed lever that fails the declaration test—say why.
  3. 15.3
    Take one KPI and write its four declarations per Table (see book) (objective component, constraint, policy input, monitor).
  4. 15.4
    Express the difference between the stochastic, robust, and adaptive GEOPs as three one-sentence promises to a board, and state for each the declaration object that backs the promise.
  5. 15.5
    A consultancy proposes to "optimize first and patch feasibility after.
  6. 15.6
    Explain, without formulas, why the holdable optimum of Theorem (see book)(iii) can be strictly worse on paper yet strictly better as a plan, and which two Chapter 14 certificates it is buying.

B. Mathematical exercises

  1. 15.7
    Carry out the K=1K = 1 and static-lift reductions of Theorem (see book)(ii) and Theorem (see book)(iii) in full for a two-period instance: exhibit the lifted variables, constraints, and the identification of the dynamics' multipliers with the costates.
  2. 15.8 ★
    Prove the Farkas alternative used in Theorem (see book)(i) for polyhedral cones, and derive the KKT conditions (see book) from it under the Slater grade, including complementary slackness.
  3. 15.9
    Prove Theorem (see book)(iii) (the shadow-price derivative) from the perturbed value function's concavity, and compute the covenant multiplier in a two-dimensional capital-allocation instance with explicit data.
  4. 15.10
    Prove both directions of Theorem (see book)(ii), including the supporting-hyperplane converse under convexity, and construct a three-point nonconvex attainable set whose middle frontier point no weighted sum finds.
  5. 15.11
    Prove Theorem (see book)(iii) and its weak converse (maximizers of ε\varepsilon-constraint instances are weakly Pareto optimal; strengthen to Pareto optimal under uniqueness).
  6. 15.12
    Prove the maximum-theorem step of Theorem (see book)(i) in full for the finite horizon: upper hemicontinuity and compact-valuedness of the feasible decision correspondence, continuity of VkV_k, and attainment.
  7. 15.13 ★
    For the coordination result of Theorem (see book)(ii): state and prove strong duality for the partially relaxed convex GEOP under the Slater grade, show the coordinated block optima at λc∗\boldsymbol{\lambda}_c^{*} solve the unified problem, and bound the duality gap when convexity fails, relating it to the value of coordination.
  8. 15.14
    Prove Theorem (see book)(ii): the Bellman operator's contraction, uniqueness of the fixed point, geometric convergence of value iteration with a priori and a posteriori bounds, and existence of an optimal stationary selection.

C. Computational exercises

  1. 15.15
    (AXIOM-15) Assemble the capital-allocation instance of Example (see book) in the GEOP builder; run both audits; report the binding set, all multipliers, and the…
  2. 15.16
    (AXIOM-15) Trace the growth–trough frontier by weight sweep and by ε\varepsilon-constraint; locate the knee and the segment the weight sweep misses; report frontier slopes at three declared points and reconcile them with the instances' multipliers.
  3. 15.17
    (AXIOM-15) Reproduce the turnaround comparison of Example (see book): certainty-equivalent, stochastic, and robust optima with their mutual gaps; then vary the ambiguity radius and plot the price of distrust.
  4. 15.18
    (AXIOM-15) Run the roadmap instance of Example (see book) with and without the terminal viability and holdability constraints; report the two value gaps and exhibit the corner-trap trajectory the unconstrained window recommends.

D. Enterprise applications

  1. 15.19
    Draft the one-page "priced commitments" exhibit for a real or case enterprise: five plausibly binding constraints with owners, the multiplier each would carry, and the decision each price would inform.
  2. 15.20
    Prepare both ESG declarations of Example (see book) for a board: the ceiling form with its internal carbon price and the objective form with its frontier knee.
  3. 15.21
    Identify a coupling in an enterprise you know that is currently "coordinated" by negotiation.
  4. 15.22
    Design the measurement that would estimate the value of information for one dashboard upgrade: the two policy classes, the two GEOP instances, and the operational data needed to declare them honestly (Theorem (see book)(iii)).
  5. 15.23
    For a publicized turnaround or restructuring, reconstruct the instance qualitatively: decisions, objective, the three most plausible binding classes, and whether the observed plan shows corner-trap symptoms (per-window optimality with shrinking room).
  6. 15.24 ★
    Design a full multi-objective mandate for an enterprise of your choice: components with owners and units (Table (see book)), the chosen device of Table (see book) with justification, the frontier exhibit the board would see, and the governance protocol for moving along the frontier.

Downloads

All three companions consume the same seeded engine (26115), so their numbers agree by construction — the MFMF convention, carried forward.