Lemma 8.6: customer violates complementary slackness iff for at least two
ProvedSupplyChainTheory.dualoc_cs_violationdualitydualocfacility-locationoperations-research
Lemma 8.6. Let and satisfy PDP1 and PDP2, let be a nearest facility of to each customer, and let be the primal solution (8.52)-(8.53). Then customer violates the complementary slackness condition (8.51), for all , if and only if for at least two .
A violation is a facility other than with ; since , the nearest facility is then a second one. This identifies the dual variables that the dual-adjustment procedure of DUALOC reduces.
Preamble
import Definitions.Def_SupplyChainTheory_location
Formal statement
namespace SupplyChainTheory
theorem dualoc_cs_violation {n m : ℕ} (chat : Fin n → Fin m → ℝ) (f : Fin m → ℝ) (v : Fin n → ℝ)
(Jp : Finset (Fin m)) (a : Fin n → Fin m) (hPDP : PDP chat f v Jp) (ha : NearestIn chat Jp a)
(i : Fin n) :
ViolatesCS chat v Jp a i ↔ 2 ≤ (Jp.filter (fun j => chat i j < v i)).card := 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. 289, Sect. 8.2.4.3, Lemma 8.6 and its proof
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.