Theorem 9.10: in any optimal RFLP solution, consecutive backup assignments are in order of cost,
ProvedSupplyChainTheory.rflp_ordered_assignmentsTheorem 9.10. In any optimal solution to (RFLP) with positive demands and disruption probability , if customer is assigned to facility at level and to facility at level , with , then .
The formulation imposes no constraint that a customer's level- facility be closer than its level- facility; the theorem says that ordering by cost is always optimal, so it need not be enforced. The book omits the proof (Problem 9.22): swapping the two assignments changes the cost by when neither is the emergency facility, and when moving up to level and dropping changes it by ; optimality forces both to be nonnegative. The case cannot occur, since an assignment to at level leaves nothing to assign at level by (9.62).
import Definitions.Def_SupplyChainTheory_disruptions
namespace SupplyChainTheory
theorem rflp_ordered_assignments {n m : ℕ} (h : Fin n → ℝ) (c : Fin n → Fin m → ℝ) (f : Fin m → ℝ)
(q : ℝ) (u : Fin m) (hq0 : 0 < q) (hq1 : q < 1) (hh : ∀ i, 0 < h i)
(x : Fin m → ℝ) (y : Fin n → Fin m → Fin m → ℝ) (hopt : RFLPOptimal h c f q u x y)
(i : Fin n) (j k : Fin m) (r r' : Fin m) (hr : r.val + 2 < m) (hr' : r'.val = r.val + 1)
(hj : y i j r = 1) (hk : y i k r' = 1) : c i j ≤ c i k := by sorry
end SupplyChainTheory
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.