Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (9.16) implies Eq. (9.18): the relaxed optimum is a lower bound for every powers-of-two policy

Proved
InventoryControl.serial_pot_lower_bound

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventory-controllot-sizingmulti-echelonoperations-researchpowers-of-two

Let QrelQ^{\mathrm{rel}}Qrel minimize the serial cost (9.17) over positive batch quantities satisfying the relaxed constraints (9.18). Then every family of positive batch quantities satisfying Roundy's constraints (9.16), Qi=2kiQi−1Q_i = 2^{k_i}Q_{i-1}Qi​=2ki​Qi−1​ with ki≥0k_i \ge 0ki​≥0, also satisfies (9.18), and its cost is at least the relaxed optimum:

Qi−1≤Qi  for all i,and∑i(eiQi2+AidQi)  ≥  ∑i(eiQirel2+AidQirel).Q_{i-1} \le Q_i \ \text{ for all } i, \qquad\text{and}\qquad \sum_{i}\Big(e_i\frac{Q_i}{2} + A_i\frac{d}{Q_i}\Big) \;\ge\; \sum_{i}\Big(e_i\frac{Q^{\mathrm{rel}}_i}{2} + A_i\frac{d}{Q^{\mathrm{rel}}_i}\Big).Qi−1​≤Qi​  for all i,andi∑​(ei​2Qi​​+Ai​Qi​d​)≥i∑​(ei​2Qirel​​+Ai​Qirel​d​).

This is the easy direction of Roundy's argument, and it is the sense in which the relaxed optimum is "a lower bound for the costs when using the constraints (9.16)". The book goes on to argue that the same value bounds the cost of any policy at all, including ones whose batch quantities vary over time; that stronger claim, which needs a model of time-varying policies, is not formalized in this mission.

Preamble
import Definitions.Def_InventoryControl_serial
Formal statement
namespace InventoryControl

theorem serial_pot_lower_bound {N : ℕ} (A e : Fin N → ℝ) (d : ℝ) (Qrel : Fin N → ℝ)
    (hopt : ∀ Q : Fin N → ℝ, (∀ i, 0 < Q i) → SerialNested Q →
      serialCost A e d Qrel ≤ serialCost A e d Q)
    (Q : Fin N → ℝ) (hpos : ∀ i, 0 < Q i) (hpot : SerialPowerOfTwo Q) :
    SerialNested Q ∧ serialCost A e d Qrel ≤ serialCost A e d Q := by sorry

end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 179, Sect. 9.2.2: 'Note that (9.16) implies (9.18) while the opposite is not true. Therefore, by using (9.18) we will get a lower bound for the costs when using the constraints (9.16)'
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me