Skip to content
Dynamic Corporate Transformation

Vol. II, Ch. 5 · Part 2. Dynamic Enterprise Optimization · Week 10

Dynamic Enterprise Optimization

Learning outcomes

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

  1. Explain the distinction between static and dynamic enterprise optimization, and identify the declared mechanisms—stocks, delays, feedback, path constraints—that force the dynamic formulation.
  2. Formulate enterprise optimization problems over continuous time in the canonical Bolza form, identifying state, decision, dynamics, running and terminal value, and path requirements.
  3. Construct enterprise state trajectories as solutions of declared state-transition equations, and verify the hypotheses under which they exist, are unique, and depend continuously on data.
  4. Define time-dependent decision variables and policy functions, and distinguish open-loop schedules from feedback rules by their information structure.
  5. Interpret enterprise dynamics as optimization constraints that couple every instant's decision to every later state.
  6. Formulate dynamic objective functionals with running and terminal components, discounting, and horizon conventions.
  7. Analyze intertemporal enterprise trade-offs: investment versus harvest, smoothing versus timing, dips endured for landings.
  8. Evaluate enterprise evolution under dynamic constraints, including corridors, integral budgets, and terminal targets, and read feasibility as a property of whole trajectories.
  9. Develop complete dynamic enterprise optimization models for capital, workforce, transformation, innovation, restructuring, and sustainability planning.
  10. Prepare enterprise models for optimal control: state the formulation contract that Pontryagin's theory (Chapter 6), dynamic programming (Chapter 8), and direct transcription consume.

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. Motivation for Dynamic Enterprise Optimization

    Motivation for Dynamic Enterprise Optimization

  2. Enterprise Dynamics

    Enterprise Dynamics

  3. Time-Dependent Enterprise States

    Time-Dependent Enterprise States

  4. Enterprise Decision Policies

    Enterprise Decision Policies

  5. Dynamic Objective Functionals

    Dynamic Objective Functionals

  6. Dynamic Enterprise Constraints

    Dynamic Enterprise Constraints

  7. Enterprise State Trajectories

    Enterprise State Trajectories

  8. Intertemporal Trade-Offs

    Intertemporal Trade-Offs

  9. Dynamic Enterprise Policy Design

    Dynamic Enterprise Policy Design

  10. Computational Considerations

    Computational Considerations

  11. Preparation for Optimal Control

    Preparation for Optimal Control

  12. Chapter Summary

    Chapter Summary

  13. Worked Examples

    Worked Examples

  14. Exercises

    Exercises

  15. 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

12 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 5.

A. Concept checks

  1. 5.1
    A planning model treats "integration fatigue" as an exogenous quarterly adjustment.
  2. 5.2
    State the composition law (see book) in words and explain why it licenses planning [0,T][0, T] in stages.

B. Mathematical exercises

  1. 5.3
    Prove the integral form of Gr"onwall's inequality used in Theorem (see book)(i): if ϕ(t)≤a+b∫0tϕ(s) ds\phi(t) \le a + b\int_0^t \phi(s)\, ds with b>0b > 0, then ϕ(t)≤aebt\phi(t) \le a e^{bt}.
  2. 5.4
    For the pipeline system of Example (see book), write AA and BB, compute the eigenvalues and eAte^{At}, and derive the senior-pool response to a unit hiring impulse.
  3. 5.5
    Derive u∗(T,S)=A(T,S)/D(T)u^{*}(T, S) = A(T, S)/D(T) of Proposition (see book) in closed form (evaluate the integrals), and complete the numeric verification of strict monotonicity in TT on (0,2.1](0, 2.1] left to this exercise by the proof.
  4. 5.6
    Construct an instance with a mixed constraint on built capability under which two admissible concentration plans blend to an inadmissible plan, completing the caveat of Theorem (see book)(iii).

C. Computational exercises

  1. 5.7
    Prove the differential form of Gr"onwall's inequality (if ϕ˙≤b(t)ϕ+a(t)\dot\phi \le b(t)\phi + a(t) a.
  2. 5.8
    Prove Jensen's inequality in the integral form used by Proposition (see book)(i), with the equality characterization.

D. Enterprise applications

  1. 5.9
    Implement the capital instance with an error-controlled integrator; reproduce the four policy values of Example (see book) to three decimals and plot Figure (see book)'s trajectories.
  2. 5.10
    Implement gradient-through-simulation for the capital instance: forward simulate, backward accumulate the discrete adjoint, and verify the gradient of JJ in the mesh decisions against finite differences.
  3. 5.11
    Formulate Meridian's covenant management dynamically: leverage state with declared amortization, covenant band as a state corridor, response schedule as the declared feedback family; audit trajectory-level admissibility across the standing scenario fan and identify the binding quarters.
  4. 5.12 ★
    Extend the admissibility theory to state-constrained instances with viability kernels: formalize the feasibility funnel of Example (see book) as a viability kernel, develop its computation, and prove the monotone shrinkage that the simulation exhibits.

Downloads

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