Eq. (5.61): the largest reorder point with is optimal
ProvedInventoryControl.rq_discrete_optimal_RThe discrete counterpart of the fill-rate rule for the reorder point. Under a continuous review policy with discrete lead-time demand, batch quantity , and costs , , let be the largest reorder point whose ready rate does not exceed , that is
Then minimizes the total cost rate over all integral reorder points.
The two inequalities say, through Eq. (5.60), that moving from to increases the cost while moving from to does not; with the cost convex in that is optimality. The book notes that for pure Poisson demand the same statement holds with the fill rate in place of the ready rate, since the two coincide.
Formalization Note is given together with the two service-level inequalities that define it as the largest such reorder point; existence of such an (the ready rate increases from to ) is not part of the claim.
import Definitions.Def_InventoryControl_rqDiscrete
namespace InventoryControl
theorem rq_discrete_optimal_R (D : DiscreteDemand) (h b1 A μ : ℝ) (hh : 0 < h) (hb : 0 < b1)
(Q : ℕ) (hQ : 0 < Q) (Rstar : ℤ)
(hlo : rqDiscreteReadyRate D Rstar Q ≤ b1 / (h + b1))
(hhi : b1 / (h + b1) < rqDiscreteReadyRate D (Rstar + 1) Q) :
∀ R : ℤ, rqDiscreteCost D h b1 A μ Rstar Q ≤ rqDiscreteCost D h b1 A μ R Q := by sorry
end InventoryControl
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.