Latihan Soal Network

Latihan Soal Network
1.

Find the shortest path from node 1 to node 5 in Figure 4.

2.

Figures 18–20 show the networks for Problems 1–3. Find the maximum flow from source to sink in each network.

3.
4.

5.

Draw the project network and determine the critical path for the network, the total float for each activity, and
the free float for each activity. Also set up the LP that can be used to find the project’s critical path.
Consider the project network in Figure 40. For each activity, you are given the estimates of a, b, and m in Table 18.
Determine the critical path for this network, the total float for each activity, the free float for each activity, and the
probability that the project is completed within 40 days. Also set up the LP that could be used to find the critical path.

The distances (in miles) between the Indiana cities of Gary, Fort Wayne, Evansville, Terre Haute, and South Bend are

shown in Table 38. It is necessary to build a state road system that connects all these cities. Assume that for political
reasons no road can be built connecting Gary and Fort Wayne, and no road can be built connecting South Bend and
Evansville. What is the minimum length of road required?