Proof of Theorem 8.4 — the projection of P2 onto the n_i coordinates lies in P1
ProvedMulticlassQNet.SingleStation.proof_8_4_projection_subsetp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedraprojectionqueueing-network
Consider the multiclass single-server queue with classes , arrival rates , service rates and load , and the polyhedra P1 (Theorem 8.3) and P2 (Theorem 8.4). Let
be the projection of P2 onto the coordinates. Then
In words: whenever nonnegative , satisfy , () and , the vector satisfies every inequality (64) and the equality (65).
This is the easy half of Theorem 8.4; the paper obtains it from Theorem 4.4 (the nonparametric polyhedron is at least as tight as the first-order bounds), specialized to one station with work conservation.
Formalization Note The projection is written . Conventions are those of the definition MulticlassQNet.SingleStation.Polyhedra.
Preamble
import Mathlib import Definitions.Def_MulticlassQNet_SingleStation_Polyhedra
Formal statement
namespace MulticlassQNet.SingleStation
/-- Proof of Theorem 8.4 (p. 38), first half ("In Theorem 4.4 we have shown that P2' ⊆ P1"):
the projection of P2 on the `n_i` coordinates is contained in P1. -/
theorem proof_8_4_projection_subset {n : ℕ} (lam mu : Fin n → ℝ)
(hlam : ∀ i, 0 < lam i) (hmu : ∀ i, 0 < mu i) (hload : ∑ i, lam i / mu i < 1) :
{x : Fin n → ℝ | ∃ I, (x, I) ∈ P2 lam mu} ⊆ P1 lam mu := by sorry
end MulticlassQNet.SingleStation
Source
Bertsimas, Paschalidis, Tsitsiklis, Optimization of Multiclass Queueing Networks: Polyhedral and Nonlinear Characterizations of Achievable Performance, MIT Sloan WP #3509-92-MSA (Dec. 1992), p. 38, §8.2, proof of Theorem 8.4 (using Theorem 4.4, p. 21)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.