Reconstruct the example problem at the end of this chapter as an AOA network. Assume that the most likely times (m) are the normal activity times and that the optimistic times

(a) are the activity crash times. Further assume that the activities have the following normal and crash costs:

Activity (i, j)

Costs

(normal cost, crash cost)

1 (1, 2) ($100, $400)

2 (1, 3) ($250, $400)

3 (2, 3) ($400, $800)

4 (2, 4) ($200, $400)

5 (3, 4) ($150, $300)

6 (3, 5) ($100, $100)

7 (4, 5) ($300, $500)

a. Formulate the general linear programming model for this project network, using most likely activity times (m).

b. Formulate the linear programming crashing model that would crash this network by the maximum amount.

c. Solve this model by using the computer. LO.1