Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 95 — any lower bound on (PR_λ) is a lower bound for (P)

Proved
RossSolandGAP.Bound.lagrangean_bound_valid_for_P

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

generalized-assignmentinteger-programminglagrangean-relaxationp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix multipliers λj∈R\lambda_j\in\mathbb Rλj​∈R, one for each assignment constraint ∑ixij=1\sum_{i}x_{ij}=1∑i​xij​=1. The Lagrangean relaxation is

(PRλ)min⁡ ∑i∈I∑j∈Jcijxij+∑j∈Jλj(1−∑i∈Ixij)s.t.∑j∈Jrijxij≤bi (i∈I), xij∈{0,1}.\text{(PR}_\lambda)\qquad \min\ \sum_{i\in I}\sum_{j\in J}c_{ij}x_{ij}+\sum_{j\in J}\lambda_j\Bigl(1-\sum_{i\in I}x_{ij}\Bigr)\quad\text{s.t.}\quad \sum_{j\in J}r_{ij}x_{ij}\le b_i\ (i\in I),\ x_{ij}\in\{0,1\}.(PRλ​)min i∈I∑​j∈J∑​cij​xij​+j∈J∑​λj​(1−i∈I∑​xij​)s.t.j∈J∑​rij​xij​≤bi​ (i∈I), xij​∈{0,1}.

Every xxx feasible for (P) is feasible for (PRλ_\lambdaλ​), and there its (PRλ_\lambdaλ​) objective equals its (P) objective. Hence, if a real number LLL satisfies L≤L\leL≤ the (PRλ_\lambdaλ​) objective of every (PRλ_\lambdaλ​)-feasible xxx, then L≤∑i∑jcijxijL\le\sum_i\sum_j c_{ij}x_{ij}L≤∑i​∑j​cij​xij​ for every xxx feasible for (P).

This is why the bound "provided by (PRλ_\lambdaλ​)" is a valid bound for (P), whatever the multipliers.

Preamble
import Mathlib
import Definitions.Def_RossSolandGAP_Bound_Model
open Finset
Formal statement
namespace RossSolandGAP.Bound

theorem lagrangean_bound_valid_for_P {m n : ℕ} (c r : Fin m → Fin n → ℝ) (b : Fin m → ℝ)
    (lam : Fin n → ℝ) :
    (∀ x, FeasibleP r b x → FeasibleLag r b x ∧ lagObj c lam x = cost c x) ∧
    ∀ L : ℝ, (∀ x, FeasibleLag r b x → L ≤ lagObj c lam x) →
      ∀ x, FeasibleP r b x → L ≤ cost c x := by sorry

end RossSolandGAP.Bound
Source
Ross & Soland, A Branch and Bound Algorithm for the Generalized Assignment Problem, Mathematical Programming 8, 1975, p. 95, §2, first two paragraphs and (PR_λ); p. 96, second paragraph, last sentence
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

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