Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 854, step (3) — a nonbasic surplus variable prices out when its multiplier is negative

Proved
GilmoreGomory61.CuttingStock.step3_slack_test

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

cutting-stockp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1simplex-methodsurplus-variable

Let a current feasible basis be fixed. A nonbasic surplus variable in demand row iii can participate with the basic columns in a strictly cheaper feasible solution only if the corresponding first-row entry bib_ibi​ of B−1B^{-1}B−1 is negative:

improvement by surplus i ⟹ bi<0.\text{improvement by surplus }i\ \Longrightarrow\ b_i<0.improvement by surplus i ⟹ bi​<0.

If all basic values are strictly positive, the converse holds. This is the surplus-column test used before searching for a new cutting activity.

Formalization Note The paper's (i+1)(i+1)(i+1)st bordered row is the demand row at Lean index iii. The converse needs nondegeneracy, as acknowledged by the paper's separate zero-ratio procedure.

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

/-- Routine step (3): a nonbasic surplus variable prices out exactly for negative multiplier. -/
theorem step3_slack_test {m k : ℕ} (I : Instance m k)
    (β : Fin m → Col I) (hβ : IsFeasibleBasis I β)
    (i : Fin m) (hi : Sum.inr i ∉ Set.range β) :
    (Improves I β (Sum.inr i) → mult I β i < 0) ∧
    (IsNondegenerate I β → mult I β i < 0 → Improves I β (Sum.inr i)) := by sorry

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