§6.1, proof of Theorem 6, p. 204 — an extreme allocation in a decomposition of ã is a maximizer vanishing on J₀
ProvedMaxPressure.StrictLeontief.extreme_maximizer_vanishingextreme-allocationmaximum-pressurep2o-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 . Suppose satisfies
Then there is an extreme allocation with and for all .
In the paper, is one of the extreme allocations of which is a convex combination. This step turns the maximizer produced by truncation back into an extreme allocation, as Assumption 1 requires.
Formalization Note "Maximum" is 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: if `ã ∈ 𝒜` maximizes `p(·, z)` over `𝒜` and vanishes on
`𝒥₀`, then some extreme allocation `a* ∈ ℰ` (one of the extreme allocations of which `ã`
is a convex combination) maximizes `p(·, z)` over `𝒜` and vanishes on `𝒥₀`. -/
theorem extreme_maximizer_vanishing {I J K : ℕ} (N : Network I J K) (hN : N.Standing)
(hSL : IsStrictLeontief N) (z : Fin I → ℝ) (hz : ∀ i, 0 ≤ z i)
(at' : Fin J → ℝ) (hat : at' ∈ allocSet N)
(hmax : ∀ a' ∈ allocSet N, pressure N a' z ≤ pressure N at' z)
(hvan : ∀ j ∈ J0 N z, at' j = 0) :
∃ a ∈ extremeAllocs N,
(∀ a' ∈ allocSet N, pressure N a' z ≤ pressure N a z) ∧
∀ j ∈ J0 N z, a j = 0 := 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, last three sentences
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.