Lemma 4, p. 213 — maximum-pressure fluid equation (20)
ProvedMaxPressure.Throughput.fluid_limit_max_pressurefluid-limitmaximum-pressurep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Consider a preemptive, processor-splitting maximum-pressure process satisfying EAA and the network equations. On a sample path where the primitive limits (3)–(4) hold, let be any fluid limit. At each positive regular time , its instantaneous activity allocation attains the greatest pressure among the extreme allocations:
This supplies the policy equation that distinguishes maximum-pressure fluid limits from those of a general service policy. Regularity means that both fluid paths are differentiable at .
Preamble
import Mathlib import Definitions.Def_MaxPressure_Throughput_Dynamics
Formal statement
namespace MaxPressure.Throughput
/-- Lemma 4, p. 213: every fluid limit of the maximum-pressure process
satisfies fluid equation (20). -/
theorem fluid_limit_max_pressure {I J K : ℕ} {Ω : Type*}
(N : Network I J K) (hN : N.Standing) (hEAA : EAA N)
(E : Finset (Fin J → ℝ)) (hE : (E : Set (Fin J → ℝ)) = extremeAllocs N)
(P : Primitives I J Ω) (Z : Ω → ℝ → Fin I → ℝ)
(Ta : Ω → (Fin J → ℝ) → ℝ → ℝ) (ω : Ω)
(heq : NetworkEquations N P Z (activityTime E Ta) ω)
(hmp : MPProcess N E Z Ta ω)
(Zb : ℝ → Fin I → ℝ) (Tb : ℝ → Fin J → ℝ)
(hlim : IsFluidLimit N P Z (activityTime E Ta) ω Zb Tb) :
MPFluidEq N Zb Tb := by sorry
end MaxPressure.Throughput
Source
Dai & Lin, Maximum pressure policies in stochastic processing networks, Oper. Res. 53(2) (2005), p. 213, Lemma 4; equation (20) p. 203; proof p. 214; https://doi.org/10.1287/opre.1040.0170
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.