Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (8.16): zLR(λ)≤z∗z_{LR}(\lambda) \le z^*zLR​(λ)≤z∗ for every λ\lambdaλ

Proved
SupplyChainTheory.lagrangian_weak_duality

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

dualityfacility-locationlagrangian-relaxationoperations-research

For every vector of multipliers λ\lambdaλ and every instance with at least one candidate site,

zLR(λ)  ≤  z∗,z_{LR}(\lambda) \;\le\; z^*,zLR​(λ)≤z∗,

the optimal value of the Lagrangian subproblem is a lower bound on the optimal value of (UFLP). Every feasible solution of (UFLP) is feasible for the subproblem and has the same objective there, since the penalty term ∑iλi(1−∑jyij)\sum_i \lambda_i(1 - \sum_j y_{ij})∑i​λi​(1−∑j​yij​) vanishes when (8.4) holds. This is weak Lagrangian duality (Theorem D.1 of the book) for this problem, and it is what makes a feasible solution's cost and a subproblem value into a bracket on z∗z^*z∗.

Preamble
import Definitions.Def_SupplyChainTheory_location
Formal statement
namespace SupplyChainTheory

theorem lagrangian_weak_duality {n m : ℕ} (h : Fin n → ℝ) (c : Fin n → Fin m → ℝ) (f : Fin m → ℝ)
    (hm : 0 < m) (lam : Fin n → ℝ) : zLR h c f lam ≤ 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. 274, Sect. 8.2.3.3, Eq. (8.16) ('from Theorem D.1, we know that, for any λ, the optimal objective value of (UFLP-LRλ) is a lower bound')
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