Ch. 8 The CPM/PERT Network
Formulating as a Linear Programming Model
The objective is to minimize the project duration (critical path time).
General linear programming model with AOA convention
minimize Z   xi
i
subject to
x j  xi  tij , for all activities i  j
xi , x j  0
where
xi  earliest event time of node i
x j  earliest event time of node j
tij  time of activity i  j
Now convert from months to weeks (the book shows this example in weeks instead of months):
Minimize Z =
subject to: