Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 814, §2.4 — integer lifting optimum is at most the rounded LP optimum

Proved
CJP83.CoverSeparation.integer_lift_bound

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

knapsackliftingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

For a positive-weight row, let zkz_kzk​ be the attained maximum of the zero–one lifting problem (2.10), with integer objective coefficients fjf_jfj​ on SSS. Let zˉk\bar z_kzˉk​ be the attained maximum of its linear relaxation, in which 0≤yj≤10\le y_j\le10≤yj​≤1 for j∈Sj\in Sj∈S. For k∉Sk\notin Sk∈/S,

zk≤⌊zˉk⌋.z_k\le \lfloor\bar z_k\rfloor.zk​≤⌊zˉk​⌋.

This bounds the integer optimum by the integer part of the relaxation optimum, the value denoted zk∗z_k^*zk∗​ in the paper. The two maximum hypotheses exclude the infeasible case; fj∈Zf_j\in\mathbb Zfj​∈Z is explicit because the floor step requires integrality.

Preamble
import Mathlib
import Definitions.Def_CJP83_CoverSeparation_KnapsackRow
Formal statement
namespace CJP83.CoverSeparation

theorem integer_lift_bound {ι : Type*} [Fintype ι] [DecidableEq ι]
    (a : ι → ℚ) (a₀ : ℚ) (hpos : ∀ j, 0 < a j)
    (S : Finset ι) (f : ι → ℤ) (k : ι) (hk : k ∉ S)
    (z : ℤ) (hz : IsGreatest (liftValues a a₀ S f k) z)
    (zbar : ℝ) (hzbar : IsGreatest (relaxedLiftValues a a₀ S f k) zbar) :
    z ≤ Int.floor zbar := by sorry
end CJP83.CoverSeparation
Source
Crowder, Johnson and Padberg, Solving Large-Scale Zero-One Linear Programming Problems, Operations Research 31 (1983), p. 814, Section 2.4, (2.10), relaxed lifting paragraph
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