Proof of Lemma 1, p. 215 — every feasible integer allocation is extreme,
ProvedMaxPressure.ReversedLeontief.intAllocs_subset_extremeAllocsextreme-allocationinteger-allocationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
In a stochastic processing network satisfying the standing assumptions of §2, every feasible integer allocation is an extreme allocation:
Here is the set of allocations satisfying (1) and (2), and the set of extreme points of the allocation set .
This is one inclusion of Lemma 1; §7 (p. 206) records it for every network ("each allocation in is an extreme one").
Formalization Note. The reversed Leontief hypothesis is not assumed: the inclusion holds for every network satisfying the standing assumptions, as §7 states.
Preamble
import Mathlib import Definitions.Def_MaxPressure_ReversedLeontief_Network
Formal statement
namespace MaxPressure.ReversedLeontief
/-- §7, p. 206, and proof of Lemma 1, p. 215: every feasible integer allocation is extreme,
`𝒩 ⊆ ℰ`. (The page states it for every network in §7; reversed Leontief is not needed.) -/
theorem intAllocs_subset_extremeAllocs {I J K : ℕ} (N : Network I J K) (hN : N.Standing) :
intAllocs N ⊆ extremeAllocs N := by sorry
end MaxPressure.ReversedLeontief
Source
Dai & Lin, Maximum pressure policies in stochastic processing networks, Oper. Res. 53(2) (2005), p. 215, Appendix B, proof of Lemma 1, last sentence; p. 206, §7
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.