Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 5 — a generic cut Σ aₑxₑ ≥ b becomes Σⱼ (Σₑ aₑqⱼᵉ) λⱼ ≥ b

Proved
RobustBCPCVRP.Formulation.generic_cut_translation

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

column-generationinteger-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1vehicle-routing

Let G=(V,E)G=(V,E)G=(V,E) be a graph, let λ\lambdaλ be finitely supported weights on client lists (columns jjj with edge incidences qjeq^e_jqje​), and let xxx satisfy (5), xe=∑jqjeλjx_e=\sum_j q^e_j\lambda_jxe​=∑j​qje​λj​ for all e∈Ee\in Ee∈E. Then for every coefficient vector aaa and every b∈Rb\in\mathbb Rb∈R,

∑e∈Eaexe≥b  ⟺  ∑j(∑e∈Eaeqje)λj≥b.\sum_{e\in E}a_e x_e\ge b\iff\sum_j\Big(\sum_{e\in E}a_e q^e_j\Big)\lambda_j\ge b .e∈E∑​ae​xe​≥b⟺j∑​(e∈E∑​ae​qje​)λj​≥b.

Any valid inequality on the edge variables can therefore be added to the Dantzig–Wolfe Master without changing the structure of the pricing problem; this is what makes the method "robust".

Formalization Note The statement needs neither nonnegativity of λ\lambdaλ nor that its support consists of q-routes; it holds for any weights satisfying (5).

Preamble
import Mathlib
import Definitions.Def_LysgaardCVRP_Shrink_cut
import Definitions.Def_LysgaardCVRP_Shrink_roundedCapacityBound
import Definitions.Def_RobustBCPCVRP_Formulation_Setting
import Definitions.Def_RobustBCPCVRP_Formulation_Polytopes
open LysgaardCVRP.Shrink
Formal statement
namespace RobustBCPCVRP.Formulation
theorem generic_cut_translation {n : ℕ} (E : Finset (Sym2 (Fin (n + 1))))
    (x : Sym2 (Fin (n + 1)) → ℝ) (lam : List (Fin (n + 1)) →₀ ℝ)
    (h5 : ∀ e ∈ E, colSum lam e = x e) (a : Sym2 (Fin (n + 1)) → ℝ) (b : ℝ) :
    b ≤ ∑ e ∈ E, a e * x e ↔
      b ≤ ∑ r ∈ lam.support, (∑ e ∈ E, a e * (inc r e : ℝ)) * lam r := by sorry
end RobustBCPCVRP.Formulation
Source
Fukasawa, Longo, Lysgaard, Poggi de Aragão, Reis, Uchoa & Werneck, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Math. Program. (DOI 10.1007/s10107-005-0644-x); accepted manuscript, p. 5, §2, last paragraph
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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