The policy keeps the position at until it falls to , and in the band thereafter
ProvedInventoryControl.rq_ip_closed_formUnder compound Poisson demand with cumulative demand after customers, batch quantity and initial inventory position , the inventory position of the policy after the -th demand is
for every outcome and every , and also at when ; and the
policy is the ordering rule rqOrders, in the sense that the general position
recursion ipPath driven by rqOrders reproduces for every .
The exclusion is exactly one point. The position before any demand is itself. If , the policy places its first order at the first demand epoch, so at the position is and not its band representative. The book's model avoids that case: "we always have " (p. 74).
This is the book's description of the policy in Sect. 5.3.1 made exact: before the first order the position simply decreases with demand, and from the first order on it stays in the band , always congruent to modulo because orders are multiples of . It is what identifies the position with the reduced process of the proof of Proposition 6.1 once the band has been entered.
import Definitions.Def_InventoryControl_rqPolicy
namespace InventoryControl
theorem rq_ip_closed_form {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω}
(X : CompoundPoissonDemand P) (R : ℤ) (Q : ℕ) (hQ : 0 < Q) (y0 : ℤ) (n : ℕ) (ω : Ω) :
(0 < n ∨ R + 1 ≤ y0 →
rqIP X R Q y0 n ω
= (if R + 1 ≤ y0 - (X.cumDemand n ω : ℤ) then y0 - (X.cumDemand n ω : ℤ)
else reduceToBand R Q (y0 - (X.cumDemand n ω : ℤ))))
∧ ipPath X Q y0 (rqOrders X R Q y0) n ω = rqIP X R Q y0 n ω := by sorry
end InventoryControl
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.