Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

pp. 852–853 — a maximizing pattern decides the pricing inequalities

Proved
GilmoreGomory61.CuttingStock.knapsack_maximum_test

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

column-generationcutting-stockknapsackp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Suppose all piece lengths are positive and the available stock length LLL is nonnegative. For any multipliers bib_ibi​ there is a feasible nonnegative integer pattern a∗a^*a∗ attaining the maximum price

Fm(L)=max⁡∑iℓiai≤L∑ibiai.F_m(L)=\max_{\sum_i\ell_i a_i\le L}\sum_i b_i a_i.Fm​(L)=∑i​ℓi​ai​≤Lmax​i∑​bi​ai​.

For any stock cost ccc, a pattern satisfying both the length constraint and ∑ibiai>c\sum_i b_i a_i>c∑i​bi​ai​>c exists exactly when this maximizing pattern has price greater than ccc. Thus one maximum calculation decides whether the paper's inequalities (6)–(7) are compatible.

Formalization Note Positive lengths make the feasible pattern set finite, and L≥0L\ge0L≥0 makes it nonempty. The page first says “positive integers” but immediately selects “nonnegative integers”; zero counts are allowed here. The maximum is compared through the extended-real value FmF_mFm​.

Preamble
import Mathlib
import Definitions.Def_GilmoreGomory61_CuttingStock_Knapsack
Formal statement
namespace GilmoreGomory61.CuttingStock

/-- A maximum pattern tests the compatibility of (6) and (7), pp. 852–853. -/
theorem knapsack_maximum_test {m k : ℕ} (I : Instance m k)
    (hℓ : ∀ i, 0 < I.ℓ i) (b : Fin m → ℝ) (L c : ℝ) (hL : 0 ≤ L) :
    ∃ aStar : Fin m → ℕ,
      patLen I aStar ≤ L ∧
      (∀ a : Fin m → ℕ, patLen I a ≤ L →
        (∑ i, b i * (a i : ℝ)) ≤ ∑ i, b i * (aStar i : ℝ)) ∧
      knapF I b m L = ((∑ i, b i * (aStar i : ℝ) : ℝ) : EReal) ∧
      ((∃ a : Fin m → ℕ, patLen I a ≤ L ∧
        c < ∑ i, b i * (a i : ℝ)) ↔ c < ∑ i, b i * (aStar i : ℝ)) := by sorry

end GilmoreGomory61.CuttingStock
Source
Gilmore and Gomory, A linear programming approach to the cutting-stock problem, Oper. Res. 9(6) (1961), pp. 852–853, after (7)
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