Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 948 — the interest charge per piece is (1/240M)(CX + S), and Y = interest + S/X + C

Proved
HarrisEOQ.Lot.cost_per_unit_eq

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

economic-order-quantityinventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let M>0M > 0M>0, and let CCC, SSS, XXX be real numbers. Take one-tenth (the ten per cent annual charge) of the value 12(CX+S)\tfrac12(CX + S)21​(CX+S) of the average stock and divide it by the 12M12M12M units used in a year. Then

  1. the interest charge per piece equals
110⋅12(CX+S)12M=1240M(CX+S);\frac{\tfrac1{10}\cdot\tfrac12(CX+S)}{12M} = \frac{1}{240M}(CX + S);12M101​⋅21​(CX+S)​=240M1​(CX+S);
  1. the cost per unit Y(X)=1240M(CX+S)+SX+CY(X) = \frac{1}{240M}(CX + S) + \frac SX + CY(X)=240M1​(CX+S)+XS​+C is the interest charge per piece plus the set-up cost per piece S/XS/XS/X plus the unit cost CCC.

This is the step that links Harris's verbal derivation to the display YYY whose minimization is the goal of the mission.

Formalization Note Only M>0M > 0M>0 is assumed: the identity is algebra away from M=0M = 0M=0, so the page's implicit X>0X > 0X>0, C>0C > 0C>0, S>0S > 0S>0 are not needed and are dropped.

Preamble
import Mathlib
import Definitions.Def_HarrisEOQ_Lot_Setting
Formal statement
namespace HarrisEOQ.Lot

theorem cost_per_unit_eq (M C S X : ℝ) (hM : 0 < M) :
    interestPerPiece M C S X = 1 / (240 * M) * (C * X + S) ∧
      costPerUnit M C S X = interestPerPiece M C S X + S / X + C := by sorry

end HarrisEOQ.Lot
Source
Harris, How many parts to make at once, Operations Research 38(6) (1990), p. 948, left column, fourth to sixth paragraphs and the display Y at the foot of the column
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