Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, pp. 93–94 — assigning each task to a least-cost agent solves (PR), with value ZZZ

Proved
RossSolandGAP.Bound.cheapest_assignment_solves_PR

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

generalized-assignmentinteger-programmingp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the relaxation (PR) of the generalized assignment problem: minimize ∑i∈I∑j∈Jcijxij\sum_{i\in I}\sum_{j\in J}c_{ij}x_{ij}∑i∈I​∑j∈J​cij​xij​ subject to ∑i∈Ixij=1\sum_{i\in I}x_{ij}=1∑i∈I​xij​=1 for all jjj and xij∈{0,1}x_{ij}\in\{0,1\}xij​∈{0,1}. Choose for every task jjj an agent iji_jij​ with cijj=min⁡i∈Icijc_{i_j j}=\min_{i\in I}c_{ij}cij​j​=mini∈I​cij​, and let xˉijj=1\bar x_{i_j j}=1xˉij​j​=1, xˉij=0\bar x_{ij}=0xˉij​=0 for i≠iji\ne i_ji=ij​. Then xˉ\bar xxˉ is feasible for (PR), its cost is

Z=∑j∈Jcijj,Z=\sum_{j\in J}c_{i_j j},Z=j∈J∑​cij​j​,

and Z≤∑i∑jcijxijZ\le\sum_i\sum_j c_{ij}x_{ij}Z≤∑i​∑j​cij​xij​ for every xxx feasible for (PR). Consequently Z≤∑i∑jcijxijZ\le\sum_i\sum_j c_{ij}x_{ij}Z≤∑i​∑j​cij​xij​ for every xxx feasible for (P), whatever the resources rijr_{ij}rij​ and budgets bib_ibi​.

This is the starting bound of the algorithm; the knapsack penalties are added to it.

Formalization Note The selection j↦ijj\mapsto i_jj↦ij​ is any function with IsCheapest c a; ties are allowed. The last conjunct ("ZZZ is a lower bound for (P)") is the paper's "This yields the lower bound", made explicit. Agents and tasks are 0-based (Fin m, Fin n).

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

theorem cheapest_assignment_solves_PR {m n : ℕ} (c : Fin m → Fin n → ℝ) (a : Fin n → Fin m)
    (ha : IsCheapest c a) :
    FeasiblePR (xPR a) ∧ cost c (xPR a) = Z c a ∧
    (∀ x, FeasiblePR x → Z c a ≤ cost c x) ∧
    (∀ (r : Fin m → Fin n → ℝ) (b : Fin m → ℝ) (x : Fin m → Fin n → ℝ),
      FeasibleP r b x → Z c a ≤ 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, pp. 93-94, §2, last paragraph of p. 93 and the display Z on p. 94
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