Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, p. 17 — for 0/1 slot assignments the relaxed objective (19) equals the objective with (17)

Proved
SkutellaCQP.RelDates.zqp_slotInd

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-programmingschedulingtime-slots

Let τ\tauτ be any assignment of jobs to time slots and aaa its 0/1 vector (aikj=1a_{i_kj} = 1aik​j​=1 iff τ(j)=ik\tau(j) = i_kτ(j)=ik​). Then the objective of the quadratic programming relaxation at aaa, with completion times (19) and slot starts (15)–(16), equals the objective of the integer program, with completion times (17):

∑jwj∑i,kaikj(sik+1+aikj2pij+∑j′≺ijaikj′pij′)=∑jwj(sτ(j)+pij+∑j′≺ij, τ(j′)=τ(j)pij′).\sum_j w_j \sum_{i,k} a_{i_kj}\Big(s_{i_k} + \frac{1 + a_{i_kj}}{2}p_{ij} + \sum_{j' \prec_i j} a_{i_kj'}p_{ij'}\Big) = \sum_j w_j\Big(s_{\tau(j)} + p_{ij} + \sum_{j' \prec_i j,\ \tau(j') = \tau(j)} p_{ij'}\Big).j∑​wj​i,k∑​aik​j​(sik​​+21+aik​j​​pij​+j′≺i​j∑​aik​j′​pij′​)=j∑​wj​(sτ(j)​+pij​+j′≺i​j, τ(j′)=τ(j)∑​pij′​).

This is why the quadratic program is a relaxation: for integral aaa the factor (1+aikj)/2(1 + a_{i_kj})/2(1+aik​j​)/2 equals 111, and the right-hand side of (17) "is the sum of these expressions over all time slots iki_kik​ weighted by aikja_{i_kj}aik​j​; it is thus equal to the completion time of jjj".

Formalization Note. Stated for every slot assignment, feasible or not; standing assumptions are hypotheses.

Preamble
import Mathlib
import Definitions.Def_SkutellaCQP_RelDates_Setting
Formal statement
namespace SkutellaCQP.RelDates

open Finset

/-- p. 17: for a 0/1 slot assignment, the objective of the quadratic programming relaxation
(with (19)) equals the objective with the completion times (17). -/
theorem zqp_slotInd {m n : ℕ} (p : Fin m → Fin n → ℝ) (w : Fin n → ℝ) (r : Fin m → Fin n → ℝ)
    (hp : ∀ i j, 0 < p i j) (hw : ∀ j, 0 ≤ w j) (hr : ∀ i j, 0 ≤ r i j)
    (τ : Fin n → Fin m × Fin n) :
    ZQPrel p w r (slotInd τ) = ∑ j, w j * Cslot p w r τ j := by sorry

end SkutellaCQP.RelDates
Source
Skutella, Convex quadratic and semidefinite programming relaxations in scheduling, J. ACM 48 (2001), p. 17, §3.2, paragraph after (14)–(18), and (19)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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