Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 2 — a strictly redundant column is never optimal for the ratio pricing problem (31)

Proved
Lubbecke2005.SubcolumnPricing.strictly_redundant_not_optimal

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

column-generationp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1pricingset-partitioning

Consider a set-partitioning master problem with rows {1,…,m}\{1,\dots,m\}{1,…,m}, a finite collection A\mathcal AA of nonempty columns (subsets of the rows, with incidence vectors a∈{0,1}m\mathbf a \in \{0,1\}^ma∈{0,1}m) and costs c\mathbf cc. Let (A,c)(\mathcal A, \mathbf c)(A,c) satisfy the subcolumn property (cr<csc_r < c_scr​<cs​ for all r,s∈Ar, s \in \mathcal Ar,s∈A with r⊊sr \subsetneq sr⊊s), and let uˉ∈Rm\bar{\mathbf u} \in \mathbb R^muˉ∈Rm be an arbitrary vector of dual multipliers. If as∈A\mathbf a_s \in \mathcal Aas​∈A is a strictly redundant column, i.e. there are λr≥0\lambda_r \ge 0λr​≥0 with

as=∑r∈A, r⊊sarλrandcs>∑r∈A, r⊊scrλr,\mathbf a_s = \sum_{r \in \mathcal A,\ r \subsetneq s} \mathbf a_r \lambda_r \qquad\text{and}\qquad c_s > \sum_{r \in \mathcal A,\ r \subsetneq s} c_r \lambda_r ,as​=r∈A, r⊊s∑​ar​λr​andcs​>r∈A, r⊊s∑​cr​λr​,

then as\mathbf a_sas​ is not an optimal solution of the ratio pricing problem

min⁡{c(a)−uˉTa1Ta  |  a∈A},(31)\min\left\{ \frac{c(\mathbf a) - \bar{\mathbf u}^{\mathsf T}\mathbf a}{\mathbf 1^{\mathsf T}\mathbf a} \;\middle|\; \mathbf a \in \mathcal A \right\}, \tag{31}min{1Tac(a)−uˉTa​​a∈A},(31)

that is, it is not the case that the ratio of as\mathbf a_sas​ is at most the ratio of every column of A\mathcal AA.

The result says that pricing by reduced cost per covered row, instead of by reduced cost alone (Dantzig's rule), never selects a column whose dual constraint is strictly implied by those of its subcolumns. The paper states the proposition and attributes the concept to Sol (1994); it gives no proof.

Formalization Note. The paper leaves the sign of λr\lambda_rλr​ in (30) implicit; this statement reads it as λr≥0\lambda_r \ge 0λr​≥0, the Farkas form of "the corresponding constraint is redundant for the dual problem" (with signed multipliers the proposition is false). The sums range over the columns of A\mathcal AA that are proper subsets of sss. The hypothesis ∅∉A\emptyset \notin \mathcal A∅∈/A is the reading of the denominator 1Ta\mathbf 1^{\mathsf T}\mathbf a1Ta in (31): a set-partitioning column covers at least one row (Lean's division by 000 would otherwise give the empty column ratio 000). The multipliers uˉ\bar{\mathbf u}uˉ are free, as the rows are equalities; no sign or optimality is assumed. "Cannot be an optimal solution" is stated literally as ¬(∀a∈A, ratio(as)≤ratio(a))\neg(\forall \mathbf a \in \mathcal A,\ \text{ratio}(\mathbf a_s) \le \text{ratio}(\mathbf a))¬(∀a∈A, ratio(as​)≤ratio(a)), which is equivalent to the existence of a column of A\mathcal AA with strictly smaller ratio. The subcolumn property is the paper's hypothesis and is kept, although the conclusion may not need it.

Preamble
import Mathlib
import Definitions.Def_Lubbecke2005_SubcolumnPricing_Columns
Formal statement
namespace Lubbecke2005.SubcolumnPricing

theorem strictly_redundant_not_optimal {m : ℕ} (𝒜 : Finset (Finset (Fin m)))
    (c : Finset (Fin m) → ℝ) (u : Fin m → ℝ)
    (h𝒜 : ∅ ∉ 𝒜) (hsub : SubcolumnProperty 𝒜 c)
    (s : Finset (Fin m)) (hs : s ∈ 𝒜) (hred : IsStrictlyRedundant 𝒜 c s) :
    ¬ (∀ a ∈ 𝒜, pricingRatio c u s ≤ pricingRatio c u a) := by sorry

end Lubbecke2005.SubcolumnPricing
Source
Lübbecke and Desrosiers, Selected Topics in Column Generation, Operations Research 53(6), 2005, p. 1016, Proposition 2, Eq. (31); definitions p. 1015, Eq. (30)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me