Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8.1: (xˉ,yˉ)(\bar x, \bar y)(xˉ,yˉ​) solves (UFLP-LRλ_\lambdaλ​) and zLR(λ)=∑jmin⁡{0,βj+fj}+∑iλiz_{LR}(\lambda) = \sum_j \min\{0, \beta_j + f_j\} + \sum_i \lambda_izLR​(λ)=∑j​min{0,βj​+fj​}+∑i​λi​

Proved
SupplyChainTheory.lagrangian_subproblem

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

facility-locationinteger-programminglagrangian-relaxationoperations-research

Theorem 8.1. For any multipliers λ\lambdaλ, let βj=∑imin⁡{0,hicij−λi}\beta_j = \sum_i \min\{0, h_i c_{ij} - \lambda_i\}βj​=∑i​min{0,hi​cij​−λi​} and set xˉj=1\bar x_j = 1xˉj​=1 if βj+fj<0\beta_j + f_j < 0βj​+fj​<0 and 000 otherwise (8.14), and yˉij=1\bar y_{ij} = 1yˉ​ij​=1 if xˉj=1\bar x_j = 1xˉj​=1 and hicij−λi<0h_i c_{ij} - \lambda_i < 0hi​cij​−λi​<0 and 000 otherwise (8.15). Then (xˉ,yˉ)(\bar x, \bar y)(xˉ,yˉ​) is feasible and optimal for the Lagrangian subproblem (UFLP-LRλ_\lambdaλ​), and its objective value, the optimal value zLR(λ)z_{LR}(\lambda)zLR​(λ), is

zLR(λ)  =  ∑j∈Jmin⁡{0,βj+fj}+∑i∈Iλi.z_{LR}(\lambda) \;=\; \sum_{j \in J} \min\{0, \beta_j + f_j\} + \sum_{i \in I} \lambda_i.zLR​(λ)=j∈J∑​min{0,βj​+fj​}+i∈I∑​λi​.

The subproblem decomposes by facility: opening jjj lets every customer with negative reduced cost hicij−λih_i c_{ij} - \lambda_ihi​cij​−λi​ be assigned to it, so jjj is worth opening exactly when its benefit outweighs its fixed cost. Customers may end up assigned to no facility or to several, since (8.4) has been relaxed.

Preamble
import Definitions.Def_SupplyChainTheory_location
Formal statement
namespace SupplyChainTheory

theorem lagrangian_subproblem {n m : ℕ} (h : Fin n → ℝ) (c : Fin n → Fin m → ℝ) (f : Fin m → ℝ)
    (lam : Fin n → ℝ) :
    LagrFeasible (lagrX h c f lam) (lagrY h c f lam)
      ∧ lagrObjective h c f lam (lagrX h c f lam) (lagrY h c f lam)
          = ∑ j, min 0 (benefit h c lam j + f j) + ∑ i, lam i
      ∧ zLR h c f lam = ∑ j, min 0 (benefit h c lam j + f j) + ∑ i, lam i := 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. 274, Sect. 8.2.3.2, Theorem 8.1, Eq. (8.13)-(8.15)
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