Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2, Eq. (3) — the economic lot size uniquely minimizes variable cost

Proved
WhitinPrice.LotSize.optimal_lot_size

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventorylot-sizingoptimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let annual demand DDD and the setup cost SSS, carrying-rate factor III, and unit purchase cost CCC all be positive. Let kkk be any per-unit operating cost. Among positive lot sizes, the unique minimizer of the annual variable cost is

Q∗=2DSIC,TVC⁡(D,Q∗)≤TVC⁡(D,Q)(Q>0),Q^*=\sqrt{\frac{2DS}{IC}},\qquad \operatorname{TVC}(D,Q^*)\leq\operatorname{TVC}(D,Q) \quad(Q>0),Q∗=IC2DS​​,TVC(D,Q∗)≤TVC(D,Q)(Q>0),

with equality only when Q=Q∗Q=Q^*Q=Q∗. This is the lot-size choice used when annual profit is optimized jointly over price and order quantity.

Formalization Note Positivity of S,I,C,DS,I,C,DS,I,C,D and QQQ makes the square root and division represent the paper's cost model. The uniqueness and global comparison make the paper's phrase “optimal value of QQQ” explicit.

Preamble
import Mathlib
import Definitions.Def_WhitinPrice_LotSize_Model
Formal statement
namespace WhitinPrice.LotSize

/-- Whitin (1955), §2, Eq. (3), with global optimality and its equality case explicit. -/
theorem optimal_lot_size (S I C k D : ℝ)
    (hS : 0 < S) (hI : 0 < I) (hC : 0 < C) (hD : 0 < D) :
    0 < Real.sqrt (2 * D * S / (I * C)) ∧
      ∀ Q : ℝ, 0 < Q →
        tvc S I C k D (Real.sqrt (2 * D * S / (I * C))) ≤ tvc S I C k D Q ∧
          (tvc S I C k D (Real.sqrt (2 * D * S / (I * C))) = tvc S I C k D Q →
            Q = Real.sqrt (2 * D * S / (I * C))) := by sorry

end WhitinPrice.LotSize
Source
Whitin, Inventory Control and Price Theory, Management Sci. 2 (1955), p. 62, Section 2, Eqs. (2)–(3)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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