Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (23) — LD1 = max over (β, λ, μ) of z(RF-bar) is a valid lower bound on the 2E-CVRP

Proved
TwoEchelonCVRP.LowerBound.ld1_lower_bound

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 satellite kkk, μ0≤0\mu_0 \le 0μ0​≤0, and let β\betaβ 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(\overline{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​.

Equivalently, the quantity

LD1=max⁡β,λ,μ{z(RF‾(β,λ,μ))}(23)\mathrm{LD1} = \max_{\beta,\lambda,\mu}\{z(\overline{RF}(\beta,\lambda,\mu))\} \qquad (23)LD1=β,λ,μmax​{z(RF(β,λ,μ))}(23)

is a valid lower bound on the 2E-CVRP, and so is every value of z(RF‾)z(\overline{RF})z(RF) reached along the way.

This is the lower bound that the paper's bounding procedure DP¹ computes, and on which its route elimination and its configuration enumeration rest.

Formalization Note The bound is stated for every admissible (β,λ,μ)(\beta,\lambda,\mu)(β,λ,μ), which is equivalent to LD1≤z(F)\mathrm{LD1} \le z(F)LD1≤z(F) and avoids defining the maximum. z(RF‾)z(\overline{RF})z(RF) is an infimum in the extended reals. The paper derives the bound from Theorem 1 and Theorem 3; Theorem 3 as printed is false (see the corrected milestone), but the bound itself holds because the RFRFRF solutions induced by feasible solutions of FFF respect the second-level fleets. Positive demands are needed: with a zero-demand customer the bound fails.


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

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

/-- Eq. (23) with Theorems 1 and 3 (pp. 301–302): `LD1 = max_{β,λ,μ} z(RF-bar(β, λ, μ))` is a valid
lower bound on the 2E-CVRP, i.e. for every solution `β` of (12) and every `λ`, `μ ≤ 0`, `μ_0 ≤ 0`,
`z(RF-bar(β, λ, μ))` is at most the cost of every feasible solution of F. -/
theorem ld1_lower_bound (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) :
    zRFbar 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. 302, Eq. (23), with Theorem 1 (p. 301) and Theorem 3 (p. 302)
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