1. | Which of the following statements about Bechtel is true? |
A. |
B. |
C. |
D. |
E. |
2. | A code of ethics especially for project managers |
A. |
B. |
C. |
D. |
E. |
3. | Which of the following statements regarding Gantt charts is true? |
A. |
B. |
C. |
D. |
E. |
4. | Which of the following statements regarding critical paths is true? |
A. |
B. |
C. |
D. |
E. |
5. | A simple CPM network has three activities, A, B, and C. A is an immediate predecessor of B and of C. B is an immediate predecessor of C. The activity durations are A=4, B=3, C=8. |
A. |
B. |
C. |
D. |
E. |
6. | A simple CPM network has three activities, D, E, and F. D is an immediate predecessor of E and of F. E is an immediate predecessor of F. The activity durations are D=4, E=3, F=8. |
A. |
B. |
C. |
D. |
E. |
7. | A simple CPM network has five activities, A, B, C, D, and E. A is an immediate predecessor of C and of D. B is also an immediate predecessor of C and of D. C and D are both immediate predecessors of E. |
A. |
B. |
C. |
D. |
E. |
8. | Which of the following statements regarding CPM networks is true? |
A. |
B. |
C. |
D. |
E. |
9. | Which of the following statements concerning CPM activities is false? |
A. |
B. |
C. |
D. |
E. |
10. | The critical path for the network activities shown below is _____ with duration ______. Activity Duration Immediate Predecessors A 4 --- B 2 A C 7 -- D 4 A E 5 B,C,D |
A. |
B. |
C. |
D. |
E. |
11. | The critical path for the network activities shown below is _____ with duration ______. Activity Duration Immediate Predesssors A 2 ------------------ B 4 -------------- C 6 A.B D 1 A,B E 2 B,C,D |
A. |
B. |
C. |
D. |
E. |
12. | The critical path for the network activities shown below is _____ with duration ______. Activity Duration Immediate Predesssors A 10 ------------------ B 8 -------------- C 2 A D 4 A E 5 B,C,D |
A. |
B. |
C. |
D. |
E. |
13. | Which of the following statements regarding PERT times is true? |
A. |
B. |
C. |
D. |
E. |
14. | The critical path of the following network is: |
A. |
B. |
C. |
D. |
E. |
15. | Which of the following represents valid constraints in linear programming? |
A. |
B. |
C. |
D. |
E. |
16. | Which of the following is not a requirement of a linear programming problem? |
A. |
B. |
C. |
D. |
E. |
17. | In linear programming a statement such as "maximize contribution" becomes a(n) |
A. |
B. |
C. |
D. |
E. |
18. | An iso-profit line |
A. |
B. |
C. |
D. |
E. |
19. | Which of the following combinations of constraints has no feasible region? |
A. |
B. |
C. |
D. |
E. |
20. | The corner point solution method requires |
A. |
B. |
C. |
D. |
E. |
21. | Which of the following sets of constraints results in an unbounded maximizing problem? |
A. |
B. |
C. |
D. |
E. |
22. | The region which satisfies all of the constraints in graphical linear programming is called the |
A. |
B. |
C. |
D. |
E. |
23. | For the two constraints given below, which point is in the feasible region of this maximization problem? (1)14x+6y<42 (2)x-y<3 |
A. |
B. |
C. |
D. |
E. |
24. | For the two constraints given below, which point is in the feasible region of this minimization problem? (1)14x+6y>42 (2)x-y>3 |
A. |
B. |
C. |
D. |
E. |
25. | What combination of x and y will yield the optimum for this problem? Maximize $3x + $15y, subject to (1) 2x + 4y < 12 and (2) 5x + 2y < 10. |
A. |
B. |
C. |
D. |
E. |
26. | A maximizing linear programming problem has two constraints: 2X + 4Y < 100 and 3X + 10Y < 210, in addition to constraints stating that both X and Y must be nonnegative. The corner points of the feasible region of this problem are |
A. |
B. |
C. |
D. |
E. |
27. | A linear programming problem has two constraints 2X + 4Y ≤ 100 and 1X + 8Y ≤ 100. Which of the following statements about its feasible region is true? |
A. |
B. |
C. |
D. |
E. |
28. | A linear programming problem contains a restriction that reads "the quantity of X must be at least three times as large as the quantity of Y." Which of the following inequalities is the proper formulation of this constraint? |
A. |
B. |
C. |
D. |
E. |
29. | A firm makes two products, Y and Z. Each unit of Y costs $10 and sells for $40. Each unit of Z costs $5 and sells for $25. If the firm's goal were to maximize sales revenue, the appropriate objective function would be |
A. |
B. |
C. |
D. |
E. |
30. | A linear programming maximization problem has been solved. In the optimal solution, two resources are scarce. If an added amount could be found for only one of these resources, how would the optimal solution be changed? |
A. |
B. |
C. |
D. |
E. |