Eq. (8.16): for every
ProvedSupplyChainTheory.lagrangian_weak_dualitydualityfacility-locationlagrangian-relaxationoperations-research
For every vector of multipliers and every instance with at least one candidate site,
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 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 .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.