Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 797 — the expected completion times of any nonanticipatory policy are LP-feasible, so the LP optimum is a lower bound

Proved
StochSchedPrec.CMNS.lp_relaxation

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

lower-boundlp-relaxationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-scheduling

Under the assumptions of Theorem 3.1 (independent nonnegative processing times with CV[Pj]≤Δ\mathrm{CV}[P_j]\le\sqrt\DeltaCV[Pj​]≤Δ​, Δ≥0\Delta\ge0Δ≥0; release dates rj≥0r_j\ge0rj​≥0; weights wj≥0w_j\ge0wj​≥0), let Π\PiΠ be any feasible nonanticipatory policy with integrable completion times. Then the vector (E[CjΠ(P)])j∈V\big(\mathrm E[C^\Pi_j(P)]\big)_{j\in V}(E[CjΠ​(P)])j∈V​ satisfies all constraints of the LP relaxation

∑j∈WE[Pj] Cj≥f(W) (W⊆V),Cj≥Ci+E[Pj] ((i,j)∈A),Cj≥E[Pj] (j∈V),\sum_{j\in W}\mathrm E[P_j]\,C_j\ge f(W)\ (W\subseteq V),\qquad C_j\ge C_i+\mathrm E[P_j]\ ((i,j)\in A),\qquad C_j\ge\mathrm E[P_j]\ (j\in V),j∈W∑​E[Pj​]Cj​≥f(W) (W⊆V),Cj​≥Ci​+E[Pj​] ((i,j)∈A),Cj​≥E[Pj​] (j∈V),

and consequently every optimal solution CLPC^{\mathrm{LP}}CLP of the LP satisfies

∑j∈VwjCjLP≤E[∑j∈VwjCjΠ(P)].\sum_{j\in V}w_jC^{\mathrm{LP}}_j\le\mathrm E\Big[\sum_{j\in V}w_jC^\Pi_j(P)\Big].j∈V∑​wj​CjLP​≤E[j∈V∑​wj​CjΠ​(P)].

The LP is therefore a relaxation of P ∣ rj,prec ∣ E[∑wjCj]\mathrm P\,|\,r_j,\mathit{prec}\,|\,\mathrm E[\sum w_jC_j]P∣rj​,prec∣E[∑wj​Cj​], and its optimal value is a lower bound on the expected cost of every nonanticipatory policy.

Formalization Note As in Theorem 3.1, comparator policies have integrable completion times and are measurable for the law of PPP (§5, p. 800, requires universal measurability of every policy).

Preamble
import Mathlib
import Definitions.Def_StochSchedPrec_CMNS_Model
import Definitions.Def_StochSchedPrec_CMNS_Algorithm

open MeasureTheory ProbabilityTheory
Formal statement
namespace StochSchedPrec.CMNS

theorem lp_relaxation {V : Type*} [Fintype V] [DecidableEq V]
    {Ω : Type*} [MeasurableSpace Ω] {Pr : Measure Ω} [IsProbabilityMeasure Pr]
    (m : ℕ) (hm : 0 < m) (A : V → V → Prop) (hacyc : ∀ j, ¬ Relation.TransGen A j j)
    (r w : V → ℝ) (hr : ∀ j, 0 ≤ r j) (hw : ∀ j, 0 ≤ w j)
    (P : V → Ω → ℝ) (hP : IsStochModel Pr P) (Δ : ℝ) (hΔ : 0 ≤ Δ) (hCV : HasCVBound Pr P Δ)
    (pol : (V → ℝ) → V → ℝ) (hpol : IsAdmissiblePolicy m A r Pr P pol)
    (hpolm : AEMeasurable pol (Pr.map (fun ω k => P k ω))) :
    IsLPFeasible m A Δ (fun j => ∫ ω, P j ω ∂Pr)
        (fun j => ∫ ω, (pol (fun k => P k ω) j + P j ω) ∂Pr) ∧
      ∀ C : V → ℝ, IsLPOptimal m A Δ (fun j => ∫ ω, P j ω ∂Pr) w C →
        ∑ j, w j * C j ≤ ∫ ω, ∑ j, w j * (pol (fun k => P k ω) j + P j ω) ∂Pr := by sorry

end StochSchedPrec.CMNS
Source
Skutella and Uetz, Stochastic machine scheduling with precedence constraints, SIAM J. Comput. 34(4) (2005) 788–802, p. 797, §3, paragraph "Observe that under any scheduling policy Π" and the LP relaxation
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