Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 9.10: in any optimal RFLP solution, consecutive backup assignments are in order of cost, cij≤cikc_{ij} \le c_{ik}cij​≤cik​

Proved
SupplyChainTheory.rflp_ordered_assignments

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

facility-locationinteger-programmingoperations-researchsupply-uncertainty

Theorem 9.10. In any optimal solution to (RFLP) with positive demands and disruption probability 0<q<10 < q < 10<q<1, if customer iii is assigned to facility jjj at level rrr and to facility kkk at level r+1r + 1r+1, with 0≤r<∣J∣−20 \le r < |J| - 20≤r<∣J∣−2, then cij≤cikc_{ij} \le c_{ik}cij​≤cik​.

The formulation imposes no constraint that a customer's level-rrr facility be closer than its level-(r+1)(r+1)(r+1) 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 hiqr(1−q)2(cik−cij)h_i q^r (1-q)^2 (c_{ik} - c_{ij})hi​qr(1−q)2(cik​−cij​) when neither is the emergency facility, and when k=uk = uk=u moving uuu up to level rrr and dropping jjj changes it by hiqr(1−q)(θi−cij)h_i q^r(1-q)(\theta_i - c_{ij})hi​qr(1−q)(θi​−cij​); optimality forces both to be nonnegative. The case j=uj = uj=u cannot occur, since an assignment to uuu at level rrr leaves nothing to assign at level r+1r + 1r+1 by (9.62).

Preamble
import Definitions.Def_SupplyChainTheory_disruptions
Formal statement
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
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, p. 392, Sect. 9.6.3, Theorem 9.10: 'Proof. Omitted; see Problem 9.22'; the formulation is (9.61)-(9.67), pp. 391; after Snyder and Daskin (2005)
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me