§6.1, proof of Theorem 6, p. 204 — it suffices to find a maximizing extreme allocation vanishing on J₀
ProvedMaxPressure.StrictLeontief.reductioneaa-assumptionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strict-leontief
Consider a strict Leontief network satisfying the standing assumptions of §2, a buffer-level vector , and the set of service activities with . If there is an allocation
then there is an extreme allocation with such that for every constituent buffer of , which is the conclusion of Assumption 1 at .
This is the reduction with which the proof of Theorem 6 begins.
Formalization Note "argmax" and "maximum" are stated in domination form over .
Preamble
import Mathlib import Definitions.Def_MaxPressure_StrictLeontief_Network
Formal statement
namespace MaxPressure.StrictLeontief
/-- Proof of Theorem 6, p. 204 ("It is sufficient to show"): for `z ∈ ℝ^I_+`, if some
extreme allocation maximizes `p(·, z)` over `ℰ` and vanishes on `𝒥₀`, then some extreme
allocation maximizes `p(·, z)` over `ℰ` and every constituent buffer of it has a positive
level, which is the conclusion of Assumption 1 at `z`. -/
theorem reduction {I J K : ℕ} (N : Network I J K) (hN : N.Standing)
(hSL : IsStrictLeontief N) (z : Fin I → ℝ) (hz : ∀ i, 0 ≤ z i)
(h : ∃ a ∈ extremeAllocs N,
(∀ a' ∈ extremeAllocs N, pressure N a' z ≤ pressure N a z) ∧
∀ j ∈ J0 N z, a j = 0) :
∃ a ∈ extremeAllocs N,
(∀ a' ∈ extremeAllocs N, pressure N a' z ≤ pressure N a z) ∧
∀ i ∈ constituentBuffers N a, 0 < z i := by sorry
end MaxPressure.StrictLeontief
Source
Dai & Lin, Maximum pressure policies in stochastic processing networks, Oper. Res. 53(2) (2005), p. 204, §6.1, proof of Theorem 6, sentences 4–5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.