The cost is convex in the reorder point
ProvedInventoryControl.rq_discrete_cost_convex_Rdiscrete-optimizationinventory-controloperations-researchreorder-point
Under a continuous review policy with discrete lead-time demand, batch quantity , and costs , , the total cost rate is a convex function of the integral reorder point: for every ,
The increments are by Eq. (5.60), and the ready rate is nondecreasing in because each of its terms is. Convexity is what lets the optimal reorder point for a given be characterized by a single comparison of service levels, Eq. (5.61).
Preamble
import Definitions.Def_InventoryControl_rqDiscrete
Formal statement
namespace InventoryControl
theorem rq_discrete_cost_convex_R (D : DiscreteDemand) (h b1 A μ : ℝ) (hh : 0 < h) (hb : 0 < b1)
(Q : ℕ) (hQ : 0 < Q) (R : ℤ) :
rqDiscreteCost D h b1 A μ (R + 1) Q - rqDiscreteCost D h b1 A μ R Q
≤ rqDiscreteCost D h b1 A μ (R + 2) Q - rqDiscreteCost D h b1 A μ (R + 1) Q := by sorry
end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 86, Sect. 5.9.1: 'Because the ready rate increases with the reorder point, it follows that C(R + 1) - C(R) is increasing with R, i.e., the cost is convex in the reorder point'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.