Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Secs. 4–5, pp. 346 and 348 — with no negative marginal cost path, the restricted LP optimum solves the set covering LP, bounds every VRPTW solution, and is VRPTW-optimal when integral and exact

Proved
VRPTWColGen92.Bound.colgen_certificate

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

column-generationlinear-programminglower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1vehicle-routing

This is the optimality certificate of the column generation algorithm of Desrochers, Desrosiers and Solomon (1992) for the vehicle routing problem with time windows.

Fix a VRPTW instance. Let R0R_0R0​ be a finite set of 2-cycle-free paths (the current columns), let zˉ=(xˉ,Xˉd,Xˉc)\bar z = (\bar x, \bar X_d, \bar X_c)zˉ=(xˉ,Xˉd​,Xˉc​) be an optimal solution of the LP relaxation of the set covering type model (1)–(6) restricted to R0R_0R0​, and let (π,πd,πc)(\pi, \pi_d, \pi_c)(π,πd​,πc​) be an optimal solution of the dual of that restricted LP. Suppose the pricing subproblem finds no negative marginal cost path: for every 2-cycle-free path (d,i1,…,iK,d)(d, i_1, \dots, i_K, d)(d,i1​,…,iK​,d) of the instance,

∑k=0K[(1−πc) cikik+1−πik] ≥ 0,πi0=πd.\sum_{k=0}^{K}\big[(1-\pi_c)\,c_{i_k i_{k+1}} - \pi_{i_k}\big] \ \ge\ 0,\qquad \pi_{i_0} = \pi_d.k=0∑K​[(1−πc​)cik​ik+1​​−πik​​] ≥ 0,πi0​​=πd​.

Then:

  1. zˉ\bar zzˉ is an optimal solution of the LP relaxation of (1)–(6) over all 2-cycle-free paths;
  2. if moreover all arc costs are nonnegative, its value ∑rcrxˉr\sum_r c_r\bar x_r∑r​cr​xˉr​ is at most the cost of every VRPTW solution;
  3. if moreover xˉ\bar xxˉ is integral and covers every customer exactly once (∑rγirxˉr=1\sum_r\gamma_{ir}\bar x_r = 1∑r​γir​xˉr​=1 for every customer iii), then the columns with xˉr>0\bar x_r > 0xˉr​>0 form a VRPTW solution whose cost equals ∑rcrxˉr\sum_r c_r\bar x_r∑r​cr​xˉr​ and is at most the cost of every VRPTW solution: it is optimal for the VRPTW.

This is the statement behind the paper's "Otherwise, the current solution is optimal" (p. 346) and "If the solution is integer and each customer is covered exactly once, the solution is also optimal for the VRPTW" (p. 348).

Formalization Note. The LP relaxation keeps Xd,Xc≥0X_d, X_c \ge 0Xd​,Xc​≥0 and relaxes xr∈{0,1}x_r\in\{0,1\}xr​∈{0,1} to xr≥0x_r\ge0xr​≥0 (root LP, no branching rows). Clauses 2 and 3 assume cij≥0c_{ij}\ge 0cij​≥0 on arcs, the paper's "the cost is taken to be the distance between iii and jjj": without it the bound is false, because (6) forces Xc≥0X_c \ge 0Xc​≥0 while a VRPTW solution may have negative cost. Clause 1 needs no condition on the data.

Preamble
import Mathlib
import Definitions.Def_VRPTWColGen92_Bound_Network
import Definitions.Def_VRPTWColGen92_Bound_CoveringLP
Formal statement
namespace VRPTWColGen92.Bound
theorem colgen_certificate {n : ℕ} (I : Instance n)
    (R₀ : Finset (List (Fin (n + 1)))) (hR₀ : ∀ p ∈ R₀, IsPath3 I p)
    (z : LPPoint n) (hz : LPOptimal I (↑R₀ : Set (List (Fin (n + 1)))) z)
    (y : DualPoint n) (hy : DualOptimal I R₀ y)
    (hprice : ∀ p, IsPath3 I p → 0 ≤ pathMarginal I y p) :
    LPOptimal I {p | IsPath3 I p} z ∧
    ((∀ i j, I.arc i j → 0 ≤ I.c i j) →
      (∀ S, IsVRPTWSolution I S → objective I z ≤ solCost I S) ∧
      ((∀ p, ∃ m : ℕ, z.x p = m) →
        (∀ i : Fin (n + 1), i ≠ 0 → ∑ p ∈ z.x.support, (p.count i : ℝ) * z.x p = 1) →
        IsVRPTWSolution I z.x.support ∧ solCost I z.x.support = objective I z ∧
          ∀ S, IsVRPTWSolution I S → solCost I z.x.support ≤ solCost I S)) := by sorry
end VRPTWColGen92.Bound
Source
Desrochers, Desrosiers & Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Oper. Res. 40 (1992), pp. 344, 346–348, Secs. 2, 4, 4.1 and 5
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