Sect. 6.1.1.1: the first with , with its best , is jointly optimal
ProvedInventoryControl.rq_discrete_joint_optimalThe joint optimization of the reorder point and the batch quantity for discrete demand, the capstone of Sect. 6.1.1.1 (Federgruen and Zheng, 1992).
A continuous review policy controls an item with discrete lead-time demand of finite mean , average demand per unit of time, ordering cost per batch, holding cost and shortage cost per unit and time unit. With the cost rate of holding the inventory position at , the total average cost rate is
and . Let be the smallest batch quantity with , and let be an optimal reorder point for . Then
The point of the result is algorithmic: is not convex in in any obvious sense, yet the recursion (6.6)-(6.7) and the monotonicity of the marginal cost show that once the costs stop decreasing they never decrease again, so the joint optimum is found by increasing one unit at a time and stopping at the first increase. The book applies the same idea to policies in Sect. 6.1.1.2 and to normally distributed demand in Sect. 6.1.2.
Formalization Note is a function CQ constrained to be the least value of
for every ; is characterized by the two stopping
conditions, and by optimality at . That such , and exist is
the content of two separate items of this mission.
import Definitions.Def_InventoryControl_rqDiscrete
namespace InventoryControl
theorem rq_discrete_joint_optimal (D : DiscreteDemand) (h b1 A μ : ℝ) (hh : 0 < h) (hb : 0 < b1)
(hA : 0 < A) (hμ : 0 < μ)
(CQ : ℕ → ℝ)
(hCQ : ∀ Q : ℕ, 1 ≤ Q →
IsLeast (Set.range fun R : ℤ => rqDiscreteCost D h b1 A μ R Q) (CQ Q))
(Qstar : ℕ) (hQ1 : 1 ≤ Qstar) (hstop : CQ Qstar ≤ CQ (Qstar + 1))
(hfirst : ∀ Q : ℕ, 1 ≤ Q → Q < Qstar → CQ (Q + 1) < CQ Q)
(Rstar : ℤ)
(hR : ∀ R : ℤ, rqDiscreteCost D h b1 A μ Rstar Qstar ≤ rqDiscreteCost D h b1 A μ R Qstar) :
∀ (R : ℤ) (Q : ℕ), 1 ≤ Q →
rqDiscreteCost D h b1 A μ Rstar Qstar ≤ 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.