Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (8.19): zLP≤zLR≤z∗z_{LP} \le z_{LR} \le z^*zLP​≤zLR​≤z∗

Proved
SupplyChainTheory.lagrangian_dual_bounds

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

dualityfacility-locationlagrangian-relaxationoperations-research

With zLR=max⁡λzLR(λ)z_{LR} = \max_\lambda z_{LR}(\lambda)zLR​=maxλ​zLR​(λ) the Lagrangian dual value (8.17), for every instance with at least one candidate site,

zLP  ≤  zLR  ≤  z∗.z_{LP} \;\le\; z_{LR} \;\le\; z^*.zLP​≤zLR​≤z∗.

The right inequality is (8.16) taken over all λ\lambdaλ; the left is Theorem D.2 of the book, that the Lagrangian dual is at least as tight as the LP relaxation, because for each λ\lambdaλ the subproblem value is bounded by the value of the same Lagrangian over the LP-relaxed set, and LP duality bounds that by zLPz_{LP}zLP​. Corollary 8.2 sharpens the left inequality to an equality.

Preamble
import Definitions.Def_SupplyChainTheory_location
Formal statement
namespace SupplyChainTheory

theorem lagrangian_dual_bounds {n m : ℕ} (h : Fin n → ℝ) (c : Fin n → Fin m → ℝ) (f : Fin m → ℝ)
    (hm : 0 < m) : uflpLP h c f ≤ zLRbest h c f ∧ zLRbest h c f ≤ uflpOpt 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. 275, Sect. 8.2.3.3, Eq. (8.18)-(8.19) ('Combining (8.16) and (8.18), we now know that zLP ≤ zLR ≤ z∗')
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