Conditions on B imply a dual optimum
ProvedKellyLossNetworks.Primal.blocking_to_dualconvex-dualityloss-networksoperations-researchp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let , and suppose satisfies conditions (2.7), including . Then the multipliers
minimize the dual objective over . This is the converse direction of the correspondence between dual optima and solutions of the blocking conditions.
Preamble
import Mathlib import Definitions.Def_KellyLossNetworks_Primal_Problem
Formal statement
namespace KellyLossNetworks.Primal
/-- Kelly, *Loss networks* (1991), §2.1, p. 328, the converse direction of the
one-to-one correspondence after (2.7). -/
theorem blocking_to_dual {J R : ℕ} (A : Fin J → Fin R → ℕ)
(ν : Fin R → ℝ) (C : Fin J → ℕ) (hν : ∀ r, 0 < ν r)
(B : Fin J → ℝ) (hB : ConditionsOnB A ν C B) :
IsDualOpt A ν C (dualFromBlocking B) := by sorry
end KellyLossNetworks.Primal
Source
Kelly, Loss networks, Ann. Appl. Probab. 1(3):319–378 (1991), DOI 10.1214/aoap/1177005872, p. 328, §2.1, one-to-one correspondence after (2.7)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.