Preprint
Article

This version is not peer-reviewed.

Uncertain Critical Paths, HyperWeighted Critical Paths, and Critical HyperPaths

Submitted:

11 November 2026

Posted:

12 November 2026

You are already at the latest version

Abstract
Classical Critical Path analysis uses fixed activity durations in a directed acyclic project network. We develop three distinct mathematical extensions: Uncertain Critical Paths, which aggregate model-dependent uncertainty values and rank the resulting path scores; HyperWeighted Critical Paths, which aggregate nonempty sets of admissible durations by Minkowski addition; and Critical HyperPaths, which optimize over alternating paths in directed hypergraphs. We establish existence of maximizing paths under explicit finiteness, admissibility, aggregation, and ranking assumptions. We further show that singleton hyperweights recover the classical Critical Path formulation, and demonstrate the dependence of set-valued critical-path selection on the ranking functional. The scope and limitations of these constructions, including the interpretation of uncertainty degrees, scenario dependence, and hyperpath precedence semantics, are clarified.
Keywords: 
;  ;  ;  ;  ;  
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.