Claim 1.1, p. 2 — C(T) = K/T + HT is positive and strictly convex, √(K/H) is its unique minimizer, and C(θT*) = ½(θ + 1/θ)C(T*)
ProvedContJRP.Align.claim_1_1_eoq_propertiesconvexityeoqinventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and for . Then:
- for every ;
- is strictly convex on ;
- minimizes over , and it is the unique minimizer;
- for every ,
These are the classical facts on the EOQ cost that the analysis of the easy policy and of the assignability bound (Lemma 3.6) rely on.
Formalization Note The positivity conjunct encodes the codomain of the page's ; is what makes the unique minimizer.
Preamble
import Mathlib import Definitions.Def_ContJRP_Align_Model
Formal statement
namespace ContJRP.Align
theorem claim_1_1_eoq_properties (K H : ℝ) (hK : 0 < K) (hH : 0 < H) :
(∀ T, 0 < T → 0 < eoqCost K H T) ∧
StrictConvexOn ℝ (Set.Ioi 0) (eoqCost K H) ∧
(0 < Real.sqrt (K / H) ∧ ∀ T, 0 < T → eoqCost K H (Real.sqrt (K / H)) ≤ eoqCost K H T) ∧
(∀ T, 0 < T → eoqCost K H T = eoqCost K H (Real.sqrt (K / H)) → T = Real.sqrt (K / H)) ∧
∀ θ, 0 < θ → eoqCost K H (θ * Real.sqrt (K / H)) =
1 / 2 * (θ + 1 / θ) * eoqCost K H (Real.sqrt (K / H)) := by sorry
end ContJRP.Align
Source
Segev, The Continuous-Time Joint Replenishment Problem: ϵ-Optimal Policies via Pairwise Alignment, arXiv:2302.09941v1, p. 2, Claim 1.1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.