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