§3, p. 6 — ℓ_i(t) does not depend on the arcs of the bundles B_{i+1}, …, B_n
ProvedFulkersonPERT.Bounds.earliest_eq_of_eqOn_bundlescritical-pathp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pert
Let be a project network with events , let be an event, and let and be two assignments of real lengths to the arcs. Suppose for every arc with , that is, on the bundles . Then the critical path lengths to agree:
This is Fulkerson's observation on p. 6 that "does not depend on the values assigned to arcs of the bundles ", which lets the expected length be written as the sum (3.9) over the arcs of only.
Formalization Note Fulkerson's node is event ; is the earliest-event-time recursion of the referenced network definitions.
Preamble
import Mathlib import Definitions.Def_CriticalPath_Events_ProjectNetwork import Definitions.Def_CriticalPath_Events_EventTimes import Definitions.Def_FulkersonPERT_Bounds_Model
Formal statement
namespace FulkersonPERT.Bounds
open CriticalPath.Events
theorem earliest_eq_of_eqOn_bundles {n : ℕ} (N : ProjectNetwork n)
(y y' : Fin (n + 1) → Fin (n + 1) → ℝ) (i : Fin (n + 1))
(h : ∀ a b, (a, b) ∈ N.P → b ≤ i → y a b = y' a b) :
earliest N y i = earliest N y' i := by sorry
end FulkersonPERT.Bounds
Source
Fulkerson, Expected Critical Path Lengths in PERT Networks, RAND Memorandum RM-3075-PR (1962), p. 6, §3, observation before (3.8)–(3.11)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.