Skip to content
Dynamic Corporate Transformation

Vol. II, Ch. 3 · Part 1. Enterprise Optimization Foundations · Week 9

Convex Enterprise Optimization

Learning outcomes

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

  1. Define convex sets and convex functions precisely, and verify convexity of declared enterprise objects from first principles and from the preservation calculus.
  2. Distinguish convex from non-convex enterprise optimization problems, and state exactly which guarantees are gained or lost at that boundary.
  3. Formulate convex enterprise optimization models in the canonical form min⁡f\min f subject to convex inequalities and affine equalities, starting from a declared GEOP instance.
  4. Analyze convex feasible regions: verify convexity blockwise, exploit closure under intersection, and read the geometry of binding constraints.
  5. Apply first-order and second-order convexity conditions to test declared objectives and constraints, with and without differentiability.
  6. Explain why local optimality implies global optimality in convex problems, and what this promise is worth in enterprise governance.
  7. Interpret Lagrangian duality within enterprise optimization: dual variables as shadow prices, weak duality as an audit bound, and strong duality as a certificate of optimality.
  8. Analyze convex enterprise resource allocation problems and derive the equal-marginal-value principle from the KKT conditions.
  9. Implement convex enterprise models computationally, using disciplined convex programming and modern solvers, and audit the returned certificates.
  10. Prepare enterprise optimization models for nonlinear generalization: identify which convex structures survive locally and which guarantees must be renegotiated.

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 Convex Enterprise Optimization

    Motivation for Convex Enterprise Optimization

  2. Convex Sets

    Convex Sets

  3. Convex Functions

    Convex Functions

  4. Convex Constraint Systems

    Convex Constraint Systems

  5. Convex Enterprise Decision Spaces

    Convex Enterprise Decision Spaces

  6. Optimality Conditions

    Optimality Conditions

  7. Duality Theory

    Duality Theory

  8. Computational Solution Methods

    Computational Solution Methods

  9. Enterprise Applications

    Enterprise Applications

  10. Preparation for Nonlinear Optimization

    Preparation for Nonlinear Optimization

  11. Computational Considerations

    Computational Considerations

  12. Worked Examples

    Worked Examples

  13. Chapter Summary

    Chapter Summary

  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

13 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 3.

A. Concept checks

  1. 3.1
    State the four clauses of the convex contract of Section (see book) and, for each, name one enterprise governance question it retires.
  2. 3.2
    The equal-marginal principle appeared three times (Examples (see book), (see book), (see book)).

B. Mathematical exercises

  1. 3.3
    Prove the first-order characterization of Table (see book): differentiable ff is convex on open convex CC iff the tangent-underestimation inequality (see book) holds.
  2. 3.4
    Prove the second-order characterization of Table (see book): twice-differentiable ff is convex on open convex CC iff ∇2f⪰0\nabla^2 f \succeq 0 on CC, and ff is mm-strongly convex iff ∇2f⪰mI\nabla^2 f \succeq mI.
  3. 3.5
    Prove the monotone composition rule (hh convex nondecreasing, gg convex ⇒h∘g\Rightarrow h \circ g convex) and exhibit convex h,gh, g with h∘gh \circ g non-convex when monotonicity fails.
  4. 3.6
    Prove that sublevel sets of convex functions are convex, and that the function f(x)=∥x∥2/(1+∥x∥2)f(\x) = \norm{\x}_2 / (1 + \norm{\x}_2) has all sublevel sets convex without being convex (quasiconvexity).
  5. 3.7
    Establish the properties of Euclidean projection onto a nonempty closed convex set Ω\feas: existence, uniqueness, the variational characterization (x−PΩ(x))⊤(y−PΩ(x))≤0(\x - P_{\feas}(\x))^{\top}(\mathbf{y} - P_{\feas}(\x)) \le 0 for all y∈Ω\mathbf{y} \in \feas, and nonexpansiveness ∥PΩ(x)−PΩ(y)∥≤∥x−y∥\norm{P_{\feas}(\x) - P_{\feas}(\mathbf{y})} \le \norm{\x - \mathbf{y}}.
  6. 3.8
    Complete the coercivity bootstrap in the proof of Proposition (see book)(i): show directly from (see book) with a fixed anchor that f(x)→∞f(\x) \to \infty as ∥x∥→∞\norm{\x} \to \infty on Ω\feas, and conclude boundedness of sublevel sets.
  7. 3.9
    Verify the convex-set fact used in Theorem (see book), Step 2: if CC is convex and x0∈∂C\x_0 \in \partial C, then x0\x_0 is not an interior point of cl⁡C\operatorname{cl} C.

C. Computational exercises

  1. 3.10
    Prove the subgradient existence claim of Section (see book): a convex f:Rn→Rf : \R^n \to \R has ∂f(x)≠∅\partial f(\x) \neq \emptyset at every point.

D. Enterprise applications

  1. 3.11
    Declare Example (see book) in CVXPY, confirm DCP verification passes, solve, and reconcile the returned budget multiplier with λ∗=1.0\lambda^{*} = 1.0 to solver tolerance.
  2. 3.12
    Rewrite Meridian's covenant requirement (interest cover within a declared band, standing price $0.9 a CEO block, and use (see book) to bound the value impact of…
  3. 3.13 ★
    Study the statistical stability of shadow prices: if declared data are estimated with sampling error, derive distributional statements for λ∗\boldsymbol{\lambda}^{*} under strong convexity and a stable binding pattern, and connect to the resolve-threshold policy of Section (see book).

Downloads

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