Theorem 7.9: the long chain maximizes expected sales among all 2-flexibility designs
ProvedSupplyChainTheory.long_chain_optimalTheorem 7.9. Consider a balanced system of size with exchangeable demand: products, plants of equal capacity, and a random demand vector whose joint law is invariant under permutations of the products. A 2-flexibility design is a set of plant-product capabilities in which every plant can produce exactly two products and every product can be produced by exactly two plants; the long chain , in which plant makes products and (and plant makes and ), is one of them. Let be the set of all 2-flexibility designs. Then
that is, is a 2-flexibility design and for every 2-flexibility design , where is the expected maximum sales under .
The book's proof: a 2-flexibility design is a disjoint union of closed chains of lengths summing to , so by Lemma 7.8; each increment is at most by Lemma 7.7 through the identity (7.31), and gives . This is the analytical explanation of Jordan and Graves's observation that one long chain outperforms several short ones.
Formalization Note Edges are (product, plant) pairs and product indices wrap modulo . The decomposition of a 2-regular bipartite graph into cycles is part of the proof, not of the statement.
import Definitions.Def_SupplyChainTheory_flexibility
namespace SupplyChainTheory
theorem long_chain_optimal {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω}
[MeasureTheory.IsProbabilityMeasure P] {n : ℕ} (S : BalancedSystem P n) (hn : 2 ≤ n) :
TwoFlex (longChain n) ∧ ∀ A : Finset (Fin n × Fin n), TwoFlex A →
S.expPerf A ≤ S.expPerf (longChain n) := by sorry
end SupplyChainTheory
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.