(4.5) with (4.9), p. 10 — induction step g_{i+1} ≤ f_{i+1}
ProvedFulkersonPERT.Bounds.meanCPL_le_fNum_stepcritical-pathinductionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pert
Let be a project network with events and let bundle distributions be given, each a probability distribution on its finite support. Let be the critical path lengths (3.13) for the mean arc lengths and the numbers (4.2). Let be an event and suppose
Then .
This is the step (4.5), proved through (4.9) from (4.8) and the induction assumption; together with it yields the left inequality of (4.4).
Formalization Note Fulkerson's node is the event , and "the induction assumption for " is the hypothesis for every event . The case is included and is trivial.
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 meanCPL_le_fNum_step {n : ℕ} (N : ProjectNetwork n) (D : BundleDist n) (hD : D.IsProb)
(j : Fin (n + 1)) (ih : ∀ k : Fin (n + 1), k < j → meanCPL N D k ≤ fNum N D k) :
meanCPL N D j ≤ fNum N D j := by sorry
end FulkersonPERT.Bounds
Source
Fulkerson, Expected Critical Path Lengths in PERT Networks, RAND Memorandum RM-3075-PR (1962), p. 10, (4.5), (4.9)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.