Eq. (6.6)-(6.7): the optimal reorder point and cost for from those for
ProvedInventoryControl.rq_discrete_recursionThe Federgruen-Zheng recursion. Let be an optimal reorder point for batch quantity , under a discrete lead-time demand with finite mean, ordering cost , demand rate , and costs , . Define
Then is an optimal reorder point for batch quantity , and its cost is
where and .
The book's argument is that the optimal set of consecutive inventory positions, , grows into the optimal set of positions by adding whichever neighbour, on the left or on the right, has the smaller cost ; this rests on the convexity of . The cost identity is then bookkeeping: the window sum gains one term and the ordering cost is spread over instead of .
Formalization Note The statement holds for any optimal , not only the one the recursion generated, so the cost identity (6.7) shows that is the same whichever optimal reorder point was chosen at stage .
import Definitions.Def_InventoryControl_rqDiscrete
namespace InventoryControl
theorem rq_discrete_recursion (D : DiscreteDemand) (h b1 A μ : ℝ) (hh : 0 < h) (hb : 0 < b1)
(Q : ℕ) (hQ : 0 < Q) (Rstar : ℤ)
(hR : ∀ R : ℤ, rqDiscreteCost D h b1 A μ Rstar Q ≤ rqDiscreteCost D h b1 A μ R Q) :
let Rnext : ℤ := if sPolicyCost D h b1 Rstar ≤ sPolicyCost D h b1 (Rstar + Q + 1)
then Rstar - 1 else Rstar
(∀ R : ℤ, rqDiscreteCost D h b1 A μ Rnext (Q + 1) ≤ rqDiscreteCost D h b1 A μ R (Q + 1))
∧ rqDiscreteCost D h b1 A μ Rnext (Q + 1)
= rqDiscreteCost D h b1 A μ Rstar Q * (Q / (Q + 1 : ℝ))
+ min (sPolicyCost D h b1 Rstar) (sPolicyCost D h b1 (Rstar + Q + 1))
* (1 / (Q + 1 : ℝ)) := by sorry
end InventoryControl
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.