Skip to content

Vol. I, Ch. 11 · Part 3. Enterprise Architectures · Week 5

Enterprise Performance Architecture

Learning outcomes

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

  1. Define enterprise performance mathematically: flow functionals of the enterprise state and decisions, distinguished from the stocks of Chapter 10.
  2. Distinguish performance from enterprise value, and constructs from the indicators and metrics that measure them.
  3. Construct enterprise performance vectors with declared scales, indicators, and error models.
  4. Analyze multidimensional performance architectures on the ESA, with dependency structure inherited from Chapter 9.
  5. Measure effectiveness, efficiency, and productivity as distinct, well-defined quantities.
  6. Evaluate performance dependencies, including transformation as the coupling channel and the J-curve as a theorem.
  7. Interpret performance trajectories and fans: performance dynamics as Chapter 7–8 dynamics of a flow functional.
  8. Explain performance trade-offs exactly: Pareto structure, frontier slopes as exchange rates, and what weighted indices can and cannot find.
  9. Model performance under multiple objectives, with aggregation's theorems—rank reversal, normalization sensitivity, compensability—as working knowledge.
  10. Prepare performance models for the risk architecture (Chapter 12) and the optimization of Chapter 15 and Volume II.

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 Enterprise Performance Architecture

    Motivation for Enterprise Performance Architecture
  2. Performance Beyond Financial Metrics

    Performance Beyond Financial Metrics
  3. Dimensions of Enterprise Performance

    Dimensions of Enterprise Performance
  4. Indicators, Metrics, and Measurement Systems

    Indicators, Metrics, and Measurement Systems
  5. Aggregation and Weighting

    Aggregation and Weighting
  6. Performance Dependencies

    Performance Dependencies
  7. Trade-offs and the Performance Frontier

    Trade-offs and the Performance Frontier
  8. Performance Dynamics

    Performance Dynamics
  9. Consistency of Measurement Systems

    Consistency of Measurement Systems
  10. Worked Examples

    Worked Examples
  11. Preparation for Enterprise Risk Architecture

    Preparation for Enterprise Risk Architecture
  12. Chapter Summary

    Chapter Summary
  13. Exercises

    Exercises
  14. 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

19 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 11.

A. Concept checks

  1. 11.1
    Classify each as stock (Chapter 10) or flow (this chapter), one sentence each: engineering capability; quarterly ROIC; customer relationships; on-time delivery rate; the innovation pipeline; new-product revenue share.
  2. 11.2
    For two dimensions of Table (see book), name the construct, one indicator, and one way the indicator's non-injectivity (Theorem (see book)(iii)) could lose a preference before any gaming occurs.
  3. 11.3
    Explain to a board in three sentences why, between two options neither of which dominates, "the scorecard says A" is a statement about the weights, citing which clause of Theorem (see book) you are invoking.
  4. 11.4
    State the evaluation-window doctrine of Theorem (see book)(iii) in plain language, and give one real program class where the window is habitually shorter than the build lag.
  5. 11.5
    Distinguish delivered performance from sustainable performance (Definition (see book)) and explain what "borrowed level" borrows from, in Chapter 10's terms.

B. Mathematical exercises

  1. 11.6 ★
    Write out the additive-index characterization (Theorem (see book)(i)) in full: the coordinate decomposition, the rational case of Cauchy's equation, and the monotone squeeze; then exhibit why dropping monotonicity admits pathological solutions (state the role of a Hamel basis without constructing one).
  2. 11.7
    For Example (see book)'s options AA and BB, compute the tie locus in the weight simplex restricted to w=(w,w,1−2w3,1−2w3,1−2w3)\mathbf{w} = (w, w, \tfrac{1-2w}{3}, \tfrac{1-2w}{3}, \tfrac{1-2w}{3}): find the w∗w^{\ast} at which the ranking flips, verifying Theorem (see book)(ii)'s intermediate-value clause.
  3. 11.8
    Construct your own normalization reversal: two non-dominated alternatives on two dimensions and two normalizations (min–max with two different reference ranges) such that equal weights rank them oppositely; verify with Theorem (see book)(iii)'s effective-weight reading.
  4. 11.9
    Build a three-division Simpson instance: all three margins improve, group margin falls; then prove the safe rule in general —the pooled ratio equals the mix-weighted average of component ratios, and exhibit the mix-effect/rate-effect bridge decomposition.
  5. 11.10
    Extend the J-curve to a KK-period ledger with geometric build decay: xk+1=(1−δ)xk+bukx_{k+1} = (1 - \delta)x_k + b u_k, program u1=uˉu_1 = \bar{u} only.
  6. 11.11
    Prove Theorem (see book)(ii) for weak Pareto optimality under nonnegative (not strictly positive) weights, and exhibit the gap: a weakly-but-not-strictly Pareto point selected by a weighting with a zero weight.
  7. 11.12 ★
    Generalize Theorem (see book)(iii): for the discrete set of alternatives (0,m)(0, m), (a,a)(a, a), and (m,0)(m, 0), determine exactly the pairs (a,m)(a, m) for which the balanced point is Pareto optimal yet unsupported, and interpret the boundary case geometrically (collinearity).
  8. 11.13
    Carry out the tangency computation of Theorem (see book)(iv) on the concrete frontier p12+2p22=100p_1^2 + 2p_2^2 = 100: find the supported point for w=(1,1)\mathbf{w} = (1, 1), verify the slope equals −1-1 there, and compute the exchange rate at the point selected by w=(1,3)\mathbf{w} = (1, 3).

C. Computational exercises

  1. 11.14
    (With AXIOM-11 or the Chapter 11 notebook.
  2. 11.15
    (With AXIOM-11 or the Chapter 11 notebook.
  3. 11.16
    (With AXIOM-11 or the Chapter 11 notebook.

D. Enterprise applications

  1. 11.17
    Write the one-page EPA declaration for an enterprise you know: six or more dimensions with supports on your Exercise 9.
  2. 11.18
    Audit one real scorecard for ratio aggregation: identify every ratio KPI that is averaged across units, test one for the Simpson condition with actual or realistic numbers, and draft the pooled-ratio-plus-mix-bridge replacement exhibit.
  3. 11.19
    Map a real target cascade as a constraint family: draw the coupling graph across six or more units/functions, run the tree-versus-cycle audit of Theorem (see book)(ii), and where you find a cycle, specify the joint feasibility session—members, shared resource, and the single consolidated check that replaces the bilateral sign-offs.

Downloads

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