1. In a problem formulated as a standard transportation model, where there are m sources and n destinations, the number of arcs (routes) in an optimal solution need be: (Points : 1) m * n.
m + n.
no less than (m * n) – 1.
no greater than (m + n) – 1.
| Question 2. 2. A city needs to design and build a completely new storm drainage system. The excess rainwater runoff in each neighborhood is to be channeled to a suburban reservoir. The appropriate network model would most likely be: (Points : 1) |
transportation/transshipment.
shortest path.
minimal spanning tree.
maximal flow. |
| Question 3. 3. In PERT, the acceptance of a Beta distribution for activity completion times and the presence of a sufficient number of activities, lead to the assumption of a normal distribution of possible completion times for the overall project. (Points : 1) |
True
False |
| Question 4. 4. A disadvantage of Gantt chart methodology is that an earliest possible completion date for the project cannot be determined. (Points : 1) |
True
False |
| Question 5. 5. Overall project completion time will not be affected if an activity possessing slack time is started at any time between its earliest and latest start time. (Points : 1) |
True
False |
| Question 6. 6. Which of the following is true about an intermediate node in a transshipment problem? (Points : 1) |
The net flow out must be zero.
The node must connect to at least one supply node and at least one demand node.
The number of arcs connected to supply nodes must be less than or equal to the number of arcs connected to demand nodes.
The total capacity of outbound arcs must equal the total capacity of inbound arcs. |
| Question 7. 7. Two nodes are said to be connected if what exists? (Points : 1) |
An arc between them.
A path between them.
A network containing both nodes.
A cycle between them. |
| Question 8. 8. Using the Critical Path Method, the normal time to complete activity D is 10 weeks, and its normal cost is $500. Under maximum crashing, activity D can be completed is 4 weeks for $2,300. Therefore, if $1,100 is spent on activity D, its completion time will be 6 weeks. (Points : 1) |
True
False |
| Question 9. 9. In which of the following network models is it not possible to “ship” both in and out of a given node? (Points : 1) |
Transshipment
Traveling salesman
Maximal flow
Assignment |
| Question 10. 10. In network flow models, all arcs are generally assumed to be directed. In connectivity models, all arcs are generally assumed to be undirected. (Points : 1) |
True
False |
