Operations Management Quiz 3

30 Questions | Total Attempts: 418

SettingsSettingsSettings
Please wait...
Operation Management Quizzes & Trivia

Questions and Answers
  • 1. 
    Which of the following statements about Bechtel is true?
    • A. 

      Even though Bechtel is over 100 years old, the Kuwaiti oil fields was its first "project."

    • B. 

      Bechtel is the world's premier manager of massive construction and engineering projects.

    • C. 

      Bechtel's competitive advantage is supply chain management.

    • D. 

      While its projects are worldwide, its network of suppliers is largely in the U.S.

    • E. 

      All of the above are true.

  • 2. 
    A code of ethics especially for project managers
    • A. 

      Has been established by the Project Management Institute

    • B. 

      Has been formulated by the Federal government

    • C. 

      Has been formulated by the World Trade Organization

    • D. 

      Is inappropriate, since everyone should use the same guidance on ethical issues

    • E. 

      Does not exist at this time

  • 3. 
    Which of the following statements regarding Gantt charts is true?
    • A. 

      Gantt charts give a timeline and precedence relationships for each activity of a project.

    • B. 

      Gantt charts use the four standard spines of Methods, Materials, Manpower, and Machinery.

    • C. 

      Gantt charts are visual devices that show the duration of activities in a project.

    • D. 

      Gantt charts are expensive.

    • E. 

      All of the above are true.

  • 4. 
    Which of the following statements regarding critical paths is true?
    • A. 

      The shortest of all paths through the network is the critical path.

    • B. 

      Some activities on the critical path may have slack.

    • C. 

      Every network has exactly one critical path.

    • D. 

      On a specific project, there can be multiple critical paths, all with exactly the same duration.

    • E. 

      The duration of the critical path is the average duration of all paths in the project network.

  • 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. 

      The critical path is A-B-C, duration 15.

    • B. 

      The critical path is A-C, duration 12.

    • C. 

      The critical path is A-B-C, duration 13.5

    • D. 

      The critical path cannot be determined without knowing PERT expected activity times.

    • E. 

      The network has no critical path.

  • 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. 

      The critical path is D-E-F, duration 15.

    • B. 

      The critical path is D-F, duration 12.

    • C. 

      Slack at D is 3 units

    • D. 

      Slack at E is 3 units

    • E. 

      Both a and c are true

  • 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. 

      There are two paths in this network.

    • B. 

      There are four paths in this network.

    • C. 

      There are five paths in this network.

    • D. 

      There are 25 paths through this network.

    • E. 

      None of these statements is true.

  • 8. 
    Which of the following statements regarding CPM networks is true?
    • A. 

      There can be multiple critical paths on the same project, all with different durations.

    • B. 

      The early finish of an activity is the latest early start of all preceding activities.

    • C. 

      The late start of an activity is its late finish plus its duration.

    • D. 

      If a specific project has multiple critical paths, all of them will have the same duration.

    • E. 

      All of the above are true.

  • 9. 
    Which of the following statements concerning CPM activities is false?
    • A. 

      The early finish of an activity is the early start of that activity plus its duration.

    • B. 

      The late finish is the earliest of the late start times of all successor activities.

    • C. 

      The late start of an activity is its late finish less its duration.

    • D. 

      The late finish of an activity is the earliest late start of all preceding activities.

    • E. 

      The early start of an activity is the latest early finish of all preceding activities.

  • 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. 

      A-B-D; 10

    • B. 

      A-B-E; 11

    • C. 

      C-E; 12

    • D. 

      A-D-E; 13

    • E. 

      A-B-C-D-E; 22

  • 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. 

      A-D-E; 5

    • B. 

      B-E; 6

    • C. 

      B-D-E; 7

    • D. 

      A-C-E; 10

    • E. 

      B-C-E; 12

  • 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. 

      A-C; 12

    • B. 

      A-D-E; 19

    • C. 

      B-E; 13

    • D. 

      A-B-C-D-E; 29

    • E. 

      None of the above

  • 13. 
    Which of the following statements regarding PERT times is true?
    • A. 

      Expected time is an estimate of the time an activity will require if everything goes as planned.

    • B. 

      The optimistic time estimate is an estimate of the maximum time an activity will require.

    • C. 

      The probable time estimate is calculated as t = (a+4m+b)/6.

    • D. 

      Pessimistic time estimate is an estimate of the minimum time an activity will require.

    • E. 

      Most likely time estimate is an estimate of the maximum time an activity will require.

  • 14. 
    The critical path of the following network is:
    • A. 

      1-3, 3-4, 4-5

    • B. 

      2-3, 3-4, 4-5

    • C. 

      2-3, 3-5

    • D. 

      1-4, 4-5

    • E. 

      Two of the Above

  • 15. 
    Which of the following represents valid constraints in linear programming?
    • A. 

      2X ≥ 7X*Y

    • B. 

      2X*7Y≥500

    • C. 

      2X+7Y≥100

    • D. 

      2X2+7Y≥50

    • E. 

      All of the above are valid linear programming constraints.

  • 16. 
    Which of the following is not a requirement of a linear programming problem?
    • A. 

      An objective function, expressed in terms of linear equations

    • B. 

      Constraint equations, expressed as linear equations

    • C. 

      An objective function, to be maximized or minimized

    • D. 

      Alternative courses of action

    • E. 

      For each decision variable, there must be one constraint or resource limit

  • 17. 
    In linear programming a statement such as "maximize contribution" becomes a(n)
    • A. 

      Constraint

    • B. 

      Slack variable

    • C. 

      Objective function

    • D. 

      Violation of linearity

    • E. 

      Decision variable

  • 18. 
    An iso-profit line
    • A. 

      Can be used to help solve a profit maximizing linear programming problem

    • B. 

      Is parallel to all other iso-profit lines in the same problem

    • C. 

      Is a line with the same profit at all points

    • D. 

      None of the above

    • E. 

      All of the above

  • 19. 
    Which of the following combinations of constraints has no feasible region?
    • A. 

      X+Y>15andX–Y

    • B. 

      X+Y>5andX>10

    • C. 

      X>10andY>20

    • D. 

      X+Y>100andX+Y

    • E. 

      All of the above have a feasible region.

  • 20. 
    The corner point solution method requires
    • A. 

      Finding the value of the objective function at the origin

    • B. 

      Moving the iso-profit line to the highest level that still touches some part of the feasible regio

    • C. 

      Moving the iso-profit line to the lowest level that still touches some part of the feasible region

    • D. 

      Finding the coordinates at each corner of the feasible solution space

    • E. 

      None of the above

  • 21. 
    Which of the following sets of constraints results in an unbounded maximizing problem?
    • A. 

      X+Y>100andX+Y

    • B. 

      X+Y>15andX–Y

    • C. 

      X+Y5

    • D. 

      X

    • E. 

      All of the above have a bounded maximum.

  • 22. 
    The region which satisfies all of the constraints in graphical linear programming is called the
    • A. 

      Area of optimal solutions

    • B. 

      Area of feasible solutions

    • C. 

      Profit maximization space

    • D. 

      Region of optimality

    • E. 

      Region of non-negativity

  • 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. 

      X = 2, y = 1

    • B. 

      X = 1, y = 5

    • C. 

      X = -1, y = 1

    • D. 

      X = 4, y = 4

    • E. 

      X = 2, y = 8

  • 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. 

      X = -1, y = 1

    • B. 

      X = 0, y = 4

    • C. 

      X = 2, y = 1

    • D. 

      X = 5, y = 1

    • E. 

      X = 2, y = 0

  • 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. 

      X = 2, y = 0

    • B. 

      X = 0, y = 3

    • C. 

      X = 0, y = 0

    • D. 

      X = 1, y = 5

    • E. 

      None of the above

Back to Top Back to top