Proof of Lemma 1, p. 9 — EOQ_{K₂,H₂}(M ± 1) = EOQ_{K₂,H₂}(M) + H₂/(M ± 1) ≥ EOQ_{K₂,H₂}(M) + K₀
ProvedJRPHard.Aperiodic.eoq_shifteoqjoint-replenishmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be an integer and consider item 2 of the instance of Lemma 1, with and , and the discount . Moving item 2's cycle one step away from in either direction costs exactly , and this is at least the discount :
Both signs are asserted: the identity for and for , and each added term is at least .
This is the computation that makes item 2's period rigid: no saving on the discount can pay for moving away from .
Formalization Note The cycle is the natural-number , which equals the real because ; the divisor on the right is real subtraction.
Preamble
import Mathlib import Definitions.Def_JRPHard_Aperiodic_Setting
Formal statement
namespace JRPHard.Aperiodic
theorem eoq_shift (M : ℕ) (hM : 2 ≤ M) :
(eoq2 M (M + 1) = eoq2 M M + (coefH2 M : ℝ) / ((M : ℝ) + 1) ∧
(coefK0 M : ℝ) ≤ (coefH2 M : ℝ) / ((M : ℝ) + 1)) ∧
(eoq2 M (M - 1) = eoq2 M M + (coefH2 M : ℝ) / ((M : ℝ) - 1) ∧
(coefK0 M : ℝ) ≤ (coefH2 M : ℝ) / ((M : ℝ) - 1)) := by sorry
end JRPHard.Aperiodic
Source
Schulz and Telha, Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard, arXiv:2007.09045v1, p. 9, proof of Lemma 1, "Optimal replenishment cycle for item 2", second display
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.