Operations Management Quiz 3

Reviewed by Editorial Team
The ProProfs editorial team is comprised of experienced subject matter experts. They've collectively created over 10,000 quizzes and lessons, serving over 100 million users. Our team includes in-house content moderators and subject matter experts, as well as a global network of rigorously trained contributors. All adhere to our comprehensive editorial guidelines, ensuring the delivery of high-quality content.
Learn about Our Editorial Process
| By Operationsmanage
O
Operationsmanage
Community Contributor
Quizzes Created: 3 | Total Attempts: 2,900
| Attempts: 571 | Questions: 30
Please wait...
Question 1 / 30
0 %
0/100
Score 0/100
1. 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.

Explanation

The critical path is determined by identifying the longest path in the CPM network, which represents the sequence of activities that must be completed in order to minimize the project duration. In this case, the critical path consists of activities D, E, and F, with durations of 4, 3, and 8 respectively. The total duration of this critical path is 15. Therefore, the given answer "The critical path is D-E-F, duration 15" is correct.

Submit
Please wait...
About This Quiz
Operations Management Quiz 3 - Quiz

Operations Management Quiz 3 evaluates knowledge in project and operations management, focusing on Gantt charts, critical paths, and ethical standards. It tests understanding of project timelines, critical task... see moresequencing, and professional ethics in management. see less

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

Explanation

The critical path is determined by identifying the longest path in the network, which represents the minimum time required to complete the project. In this case, the critical path is A-B-C, with durations of 4, 3, and 8 respectively. Therefore, the total duration of the critical path is 15.

Submit
3. 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    

Explanation

The critical path is the longest path in a project network, which determines the minimum time required to complete the project. In this case, the critical path is A-D-E with a duration of 19. This means that if there are any delays in these activities, the overall project duration will be extended. The other paths mentioned do not have the longest duration and therefore are not the critical path.

Submit
4. A code of ethics especially for project managers

Explanation

The correct answer is "has been established by the Project Management Institute." This is because the Project Management Institute (PMI) is a professional organization that provides guidance and standards for project management professionals. As part of their efforts to promote ethical behavior in project management, PMI has developed a code of ethics that outlines the principles and standards that project managers should adhere to. Therefore, project managers can refer to this code of ethics as a guide for making ethical decisions and conducting themselves professionally.

Submit
5. In linear programming a statement such as "maximize contribution" becomes a(n)

Explanation

In linear programming, an objective function is used to represent the quantity that needs to be maximized or minimized. It defines the goal of the problem and specifies the variable(s) that need to be optimized. Therefore, the given correct answer, "objective function," accurately describes the statement "maximize contribution" in the context of linear programming.

Submit
6. The region which satisfies all of the constraints in graphical linear programming is called the

Explanation

The area of feasible solutions refers to the region in graphical linear programming where all the constraints are satisfied. It represents the set of all possible solutions that meet the given constraints. This area is often used to find the optimal solution to a problem, as it narrows down the search space to only those solutions that are feasible.

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

Explanation

In this CPM network, there are four paths. The paths are as follows: A-C-E, A-D-E, B-C-E, and B-D-E. Each path consists of a series of connected activities that lead from the start node (A or B) to the end node (E). Therefore, the correct answer is "There are four paths in this network."

Submit
8. Which of the following represents valid constraints in linear programming?

Explanation

The equation 2X+7Y≥100 represents a valid constraint in linear programming because it is a linear inequality with variables X and Y, and it sets a lower bound on the values of X and Y that satisfy the constraint. In linear programming, constraints are used to define the feasible region, which is the set of all possible solutions that satisfy the given conditions. This constraint indicates that the sum of 2 times X and 7 times Y must be greater than or equal to 100 in order to be considered a valid solution.

Submit
9.   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

Explanation

The given answer is correct because it includes all the corner points of the feasible region. The feasible region is determined by the intersection of the two constraint lines and the nonnegative constraints. The points (0, 0), (50, 0), (0, 21), and (20, 15) are the coordinates where the constraint lines intersect and satisfy the nonnegative constraints. Therefore, these points represent the corner points of the feasible region.

Submit
10. 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?

Explanation

The feasible region of a linear programming problem is the set of all points that satisfy all the constraints. In this case, the constraints are 2X + 4Y ≤ 100 and 1X + 8Y ≤ 100. To find the corner points of the feasible region, we can plot the lines representing these constraints and find their intersection points. By solving the equations, we find that the corner points are (50, 0), (0, 12.5), (0, 0), and another point not mentioned in the options. Therefore, the statement "There are four corner points including (50, 0) and (0, 12.5)" is true.

Submit
11. 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

Explanation

The point (x = 2, y = 1) satisfies both constraints: 14(2) + 6(1) = 28 + 6 = 34

Submit
12. Which of the following statements regarding PERT times is true?

Explanation

The probable time estimate in PERT (Program Evaluation and Review Technique) is calculated using the formula t = (a+4m+b)/6. This formula takes into account the optimistic time estimate (a), the most likely time estimate (m), and the pessimistic time estimate (b) to calculate the expected time for an activity. It provides a weighted average that considers both the best-case and worst-case scenarios, giving a more realistic estimate of the time required for the activity.

Submit
13. Which of the following statements about Bechtel is true?

Explanation

Bechtel is known as the world's premier manager of massive construction and engineering projects. This means that they are highly regarded and recognized for their expertise in handling large-scale construction and engineering projects. This statement implies that Bechtel has a successful track record in managing such projects and is considered a leader in the industry.

Submit
14. The critical path of the following network is:

Explanation

The critical path of a network refers to the longest path in the network that determines the minimum time required to complete the project. In this case, the critical path is 1-3, 3-4, 4-5. This means that these activities are the most time-consuming and any delay in them will directly impact the overall project completion time.

Submit
15. 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

Explanation

The appropriate objective function to maximize sales revenue would be to maximize the total revenue generated by selling both products Y and Z. This can be represented by the expression $30Y + $20Z, where $30Y represents the revenue generated from selling product Y and $20Z represents the revenue generated from selling product Z. By maximizing this expression, the firm would be maximizing its overall sales revenue.

Submit
16. Which of the following statements regarding critical paths is true?

Explanation

The statement that is true regarding critical paths is that on a specific project, there can be multiple critical paths, all with exactly the same duration. This means that there can be more than one sequence of activities that are critical to the project's completion and have the same total duration. It is important to identify all critical paths in order to effectively manage the project and ensure timely completion.

Submit
17. Which of the following statements regarding Gantt charts is true?

Explanation

Gantt charts are visual devices that show the duration of activities in a project. They provide a graphical representation of the project schedule, allowing stakeholders to see the timeline and duration of each activity. Gantt charts do not use the four standard spines of Methods, Materials, Manpower, and Machinery, and their cost can vary depending on the tools used to create them. Therefore, the correct statement is that Gantt charts are visual devices that show the duration of activities in a project.

Submit
18. The corner point solution method requires

Explanation

The corner point solution method involves finding the coordinates at each corner of the feasible solution space. This is done by graphing the constraints and identifying the points where the lines intersect. These corner points represent the different combinations of variables that satisfy all the constraints. By evaluating the objective function at each corner point, the optimal solution can be determined.

Submit
19. Which of the following sets of constraints results in an unbounded maximizing problem?

Explanation

The given set of constraints, X+Y>15 and X-Y

Submit
20. 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.

Explanation

The given problem is a linear programming problem with the objective of maximizing the expression $3x + 15y$. The problem also has two constraints: (1) $2x + 4y

Submit
21. Which of the following combinations of constraints has no feasible region?

Explanation

The given combination of constraints, X+Y>100 and X+Y, has no feasible region because it contradicts itself. The first constraint states that the sum of X and Y must be greater than 100, while the second constraint states that the sum of X and Y must be equal to 0. These two constraints cannot be simultaneously satisfied, resulting in no feasible region.

Submit
22. 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

Explanation

The critical path for the network activities shown is A-D-E with a duration of 13. This means that this path has the longest total duration among all possible paths in the network. The activities A, D, and E are all connected in sequence, with A being the immediate predecessor for both D and B, and D being the immediate predecessor for E. The duration of activity A is 4, activity D is 4, and activity E is 5, so the total duration of the critical path is 4 + 4 + 5 = 13.

Submit
23. 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

Explanation

not-available-via-ai

Submit
24. Which of the following statements regarding CPM networks is true?

Explanation

not-available-via-ai

Submit
25. Which of the following statements concerning CPM activities is false?

Explanation

The late finish of an activity is not necessarily the earliest late start of all preceding activities. It is the latest time that an activity can finish without delaying the project. The late finish is determined by considering the late start times of all successor activities.

Submit
26. 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?

Explanation

If an added amount could be found for only one of the scarce resources, the optimal solution would be changed by rearranging the optimal mix to utilize the added resource. This would result in an increase in the value of the objective function.

Submit
27. 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  

Explanation

The critical path is the longest path in a project network diagram that determines the minimum time needed to complete a project. In this case, the critical path is B-C-E with a duration of 12. This means that if any activity on this path is delayed, it will delay the entire project. The activities on this path are B, C, and E, and their durations are 4, 6, and 2 respectively. Adding up these durations gives a total of 12, which is the duration of the critical path.

Submit
28. Which of the following is not a requirement of a linear programming problem?

Explanation

A requirement of a linear programming problem is that for each decision variable, there must be one constraint or resource limit. This means that each decision variable should have a corresponding constraint that limits its value. The other options listed are all requirements of a linear programming problem.

Submit
29. 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?

Explanation

The given constraint states that the quantity of X must be at least three times as large as the quantity of Y. This means that X should be greater than or equal to 3Y. Rearranging the equation, we get X - 3Y ≥ 0. This inequality properly formulates the given constraint.

Submit
30. An iso-profit line

Explanation

An iso-profit line can be used to help solve a profit maximizing linear programming problem because it represents the combinations of inputs that yield the same profit. It is parallel to all other iso-profit lines in the same problem because they all represent the same profit level. Additionally, an iso-profit line is a line with the same profit at all points, as it represents the combinations of inputs that yield the same profit. Therefore, the correct answer is "all of the above."

Submit
View My Results

Quiz Review Timeline (Updated): Mar 21, 2023 +

Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.

  • Current Version
  • Mar 21, 2023
    Quiz Edited by
    ProProfs Editorial Team
  • May 03, 2012
    Quiz Created by
    Operationsmanage
Cancel
  • All
    All (30)
  • Unanswered
    Unanswered ()
  • Answered
    Answered ()
A simple CPM network has three activities, D, E, and F. D is an...
A simple CPM network has three activities, A, B, and C. A is an...
The critical path for the network activities shown below is _____ with...
A code of ethics especially for project managers
In linear programming a statement such as "maximize...
The region which satisfies all of the constraints in graphical linear...
A simple CPM network has five activities, A, B, C, D, and E. A is an...
Which of the following represents valid constraints in linear...
  ...
A linear programming problem has two constraints 2X + 4Y ≤ 100 and...
For the two constraints given below, which point is in the...
Which of the following statements regarding PERT times is true?
Which of the following statements about Bechtel is true?
The critical path of the following network is:
A firm makes two products, Y and Z. Each unit of Y costs $10 and sells...
Which of the following statements regarding critical paths is true?
Which of the following statements regarding Gantt charts is true?
The corner point solution method requires
Which of the following sets of constraints results in an unbounded...
What combination of x and y will yield the optimum for this problem?...
Which of the following combinations of constraints has no feasible...
The critical path for the network activities shown below is _____ with...
For the two constraints given below, which point is in the...
Which of the following statements regarding CPM networks is true?
Which of the following statements concerning CPM activities is false?
A linear programming maximization problem has been solved. In the...
The critical path for the network activities shown below is _____ with...
Which of the following is not a requirement of a linear programming...
A linear programming problem contains a restriction that reads...
An iso-profit line
Alert!

Advertisement