Equation (2.6): complementary conditions become conditions on B
ProvedKellyLossNetworks.Primal.change_of_variablesconvex-dualityloss-networksoperations-researchp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
For a multiplier vector and positive offered traffic, set . The primal and dual feasibility plus complementary slackness conditions (2.4)–(2.5) hold exactly when satisfies conditions (2.7): and the route flow through each link equals if , or is at most if .
The equality uses . It connects the multiplier and blocking descriptions without choosing a particular optimum.
Preamble
import Mathlib import Definitions.Def_KellyLossNetworks_Primal_Problem
Formal statement
namespace KellyLossNetworks.Primal
/-- Kelly, *Loss networks* (1991), §2.1, p. 328, (2.6)–(2.7).
The nonnegative multiplier condition is part of `complementary`. -/
theorem change_of_variables {J R : ℕ} (A : Fin J → Fin R → ℕ)
(ν : Fin R → ℝ) (C : Fin J → ℕ) (hν : ∀ r, 0 < ν r)
(y : Fin J → ℝ) :
complementary A ν C y ↔ ConditionsOnB A ν C (blockingFromDual y) := 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, (2.6)–(2.7)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.