Eq. (6.5): is attained
ProvedInventoryControl.rq_discrete_min_existsdiscrete-optimizationinventory-controloperations-researchreorder-point
For every batch quantity there is a reorder point that minimizes the total cost rate over all of :
for a discrete lead-time demand with finite mean and costs , .
Equation (6.5) defines as a minimum over and the algorithm of Sect. 6.1.1.1 manipulates throughout; the minimum exists because as , so the average of over the window also tends to infinity in both directions and a lowest value is attained. Establishing this separately keeps the later statements free of an infimum that could be junk.
Preamble
import Definitions.Def_InventoryControl_rqDiscrete
Formal statement
namespace InventoryControl
theorem rq_discrete_min_exists (D : DiscreteDemand) (h b1 A μ : ℝ) (hh : 0 < h) (hb : 0 < b1)
(Q : ℕ) (hQ : 0 < Q) :
∃ Rstar : ℤ, ∀ R : ℤ, rqDiscreteCost D h b1 A μ Rstar Q ≤ rqDiscreteCost D h b1 A μ R Q := by sorry
end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 108, Sect. 6.1.1.1, Eq. (6.5): 'Let us now define C(Q) as C(Q) = min_R {C(R, Q)}'; the minimum is written without comment, which presupposes this
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.