Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 8.2: for the UFLP, zLP=zLRz_{LP} = z_{LR}zLP​=zLR​

Proved
SupplyChainTheory.lagrangian_equals_lp

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

dualityfacility-locationinteger-programminglagrangian-relaxationoperations-research

Corollary 8.2. For the uncapacitated fixed-charge location problem, the Lagrangian dual value obtained by relaxing the assignment constraints (8.4) equals the LP relaxation value:

zLP  =  zLR  =  max⁡λzLR(λ).z_{LP} \;=\; z_{LR} \;=\; \max_\lambda z_{LR}(\lambda).zLP​=zLR​=λmax​zLR​(λ).

The Lagrangian subproblem has the integrality property: for every λ\lambdaλ its optimal value does not change when xj∈{0,1}x_j \in \{0, 1\}xj​∈{0,1} is relaxed to 0≤xj≤10 \le x_j \le 10≤xj​≤1, since the objective is linear and, after choosing yyy optimally for each xxx, linear in xxx. Lemma D.3 of the book (Geoffrion's theorem) then gives zLR=zLPz_{LR} = z_{LP}zLR​=zLP​. The book draws the consequence that the Lagrangian bound for the UFLP is exactly as tight as the LP bound, no more, and explains why the method is still used: the subproblem is solved by inspection, and the same scheme extends to nonlinear location models that LP solvers cannot handle.

Formalization Note zLRz_{LR}zLR​ is the supremum over all real multiplier vectors; the theorem asserts it equals the LP value, which is attained, so the supremum is attained as well.

Preamble
import Definitions.Def_SupplyChainTheory_location
Formal statement
namespace SupplyChainTheory

theorem lagrangian_equals_lp {n m : ℕ} (h : Fin n → ℝ) (c : Fin n → Fin m → ℝ) (f : Fin m → ℝ)
    (hm : 0 < m) : uflpLP h c f = zLRbest h c f := 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. 276, Sect. 8.2.3.3, Corollary 8.2 and the integrality-property discussion on p. 275; Lemma D.3 of Appendix D
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