# SAN Duration

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
 Problem Overview Given a stochastic activity network, minimize the duration of the longest path from node a to node minimize the duration of the longest path from node a to node i $f(\theta)= \sum_{i=1}^{13} \theta_i$ $\theta_i$ being the mean duration on each arc