Math for Decission Making

10/17/13

Blackboard Learn

Question 1

The linear programming model for crashing presented in the textbook assumes that any portion of the activity crash time can be achieved for a corresponding portion of the activity crashing cost.

Selected Answer: True

1 out of 1 points

Question 2

Activities K, M and S immediately follow activity H, and their latest start times are 14, 18, and 11. The latest finish time for activity H

Selected Answer:

1 out of 1 points

is 11.

Question 3

In deciding which activities to crash, one must

Selected Answer:

1 out of 1 points

crash activities on the critical path(s) only.

Question 4

Slack equals

Selected Answer:

0 out of 1 points

EF ‑ LS.

Question 5

The earliest start time for an activity is equal to the smallest of the earliest finish times for all its immediate predecessors.

Selected Answer: True

0 out of 1 points

Question 6

Which of the following is a general rule for crashing activities?

Selected Answer:

0 out of 1 points

Crash the path with the fewest activities.

Question 7

Selected Answer: False

Critical activities are those that can be delayed without delaying the entire project.

1 out of 1 points

Question 8

Selected Answer: True

PERT and CPM are applicable only when there is no dependence among activities.

0 out of 1 points

https://hpu.blackboard.com/webapps/portal/frameset.jsp?tab_tab_group_id=_2_1&url=%2Fwebapps%2Fblackboard%2Fexecute%2Flauncher%3Ftype%3DCourse…

1/3

10/17/13

Blackboard Learn

Question 9

The earliest start time rule

Selected Answer:

0 out of 1 points

determines when the project can begin.

Question 10

Which is not a significant challenge of project scheduling?

Selected Answer:

0 out of 1 points

many employees could be required.

Question 11

Activities require time to complete while events do not.

Selected Answer: True

1 out of 1 points

Question 12

Selected Answer: True

Precedence...