Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — z(RF(β, λ, μ)) is a lower bound on the cost of every feasible 2E-CVRP solution

Proved
TwoEchelonCVRP.LowerBound.theorem_1

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

lagrangean-relaxationlower-boundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1vehicle-routing

Consider a 2E-CVRP instance with positive demands and route families M\mathcal MM, R\mathcal RR. Let λ∈RNC\lambda \in \mathbb R^{N_C}λ∈RNC​, μk≤0\mu_k \le 0μk​≤0 for every k∈NSk \in N_Sk∈NS​ and μ0≤0\mu_0 \le 0μ0​≤0, and let β=(βik)\beta = (\beta_{ik})β=(βik​) satisfy the penalty system (12). Then for every feasible solution (x,y,q)(x, y, q)(x,y,q) of formulation FFF,

z(RF(β,λ,μ))≤∑k∈NS∑l∈Rkcklxkl+∑r∈Mgryr.z(RF(\beta,\lambda,\mu)) \le \sum_{k \in N_S}\sum_{l \in \mathcal R_k} c_{kl}x_{kl} + \sum_{r \in \mathcal M} g_r y_r .z(RF(β,λ,μ))≤k∈NS​∑​l∈Rk​∑​ckl​xkl​+r∈M∑​gr​yr​.

In words, z(RF(β,λ,μ))z(RF(\beta,\lambda,\mu))z(RF(β,λ,μ)) is a valid lower bound on the 2E-CVRP for any admissible choice of (β,λ,μ)(\beta,\lambda,\mu)(β,λ,μ).

This is the first link in the chain that produces the paper's lower bound LD1; it also yields the reduced-cost elimination of Corollary 1.

Formalization Note The optimal value z(RF)z(RF)z(RF) is an infimum in the extended reals (+∞+\infty+∞ if RFRFRF is infeasible), and "valid lower bound" is stated as the inequality against every feasible solution of FFF, which is equivalent to z(RF)≤z(F)z(RF) \le z(F)z(RF)≤z(F).

Preamble
import Mathlib
import Definitions.Def_TwoEchelonCVRP_LowerBound_Model
import Definitions.Def_TwoEchelonCVRP_LowerBound_RF
Formal statement
namespace TwoEchelonCVRP.LowerBound

/-- Theorem 1 (p. 301): for any solution `β` of (12) and penalties `λ ∈ ℝ^{N_C}`,
`μ ∈ ℝ_−^{N_S+1}`, `z(RF(β, λ, μ))` is at most the cost of every feasible solution of F. -/
theorem theorem_1 (I : Instance) (RS : RouteSystem I)
    (β : Fin I.nc → Fin I.ns → ℝ) (lam : Fin I.nc → ℝ) (μ : Fin I.ns → ℝ) (μ0 : ℝ)
    (hμ : ∀ k, μ k ≤ 0) (hμ0 : μ0 ≤ 0) (hβ : SatisfiesPenalty RS β lam μ μ0)
    (s : SolF RS) (hs : IsFeasibleF RS s) :
    zRF RS β lam μ μ0 ≤ ((costF RS s : ℝ) : EReal) := by sorry

end TwoEchelonCVRP.LowerBound
Source
Baldacci, Mingozzi, Roberti & Wolfler Calvo, An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem, Oper. Res. 61(2) (2013), p. 301, Theorem 1
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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