Eq. (5.67): the reorder point is cost-optimal exactly when its fill rate is
ProvedInventoryControl.rq_optimal_reorder_pointThe relationship between backorder costs and service levels that Axsäter calls "even more striking" than its discrete counterpart. A continuous review policy has a given batch quantity ; lead-time demand is normal with mean and standard deviation ; holding costs per unit and time unit and backorder costs per unit and time unit are charged on the steady-state inventory level, giving the expected cost rate
and is the fill rate, equal to the ready rate for continuous demand. The claim is that a reorder point minimizes over all real reorder points if and only if
Given a backorder cost, the equation says which service level to plan for; read the other way (Eq. 5.68, ), a chosen fill rate reveals the backorder cost it implicitly assumes. The book stresses that the equivalence holds only when is given and the optimization concerns alone; with ordering costs and a joint optimization of and it fails, which is the subject of Chapter 6.
Formalization Note Optimality is stated as for every real , with no sign restriction on either reorder point, and the biconditional carries both directions of the book's sentence: the stationary point is the optimum, and the optimum is stationary. Existence and uniqueness of a reorder point with the required fill rate are not asserted here.
import Definitions.Def_InventoryControl_rq
namespace InventoryControl
theorem rq_optimal_reorder_point (h b1 R Q m s : ℝ) (hh : 0 < h) (hb : 0 < b1) (hQ : 0 < Q)
(hs : 0 < s) :
(∀ R' : ℝ, rqCost h b1 R Q m s ≤ rqCost h b1 R' Q m s)
↔ rqReadyRate R Q m s = b1 / (h + b1) := by sorry
end InventoryControl
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.