Which of the following statements regarding gantt charts is true

A Sample to Guide your Preparation for Exam #1

I strongly suggest that you don’t memorize the answers because it has no relevance in an open-book and open note test. Solve each problem and/or find out reasons for the answers provided. The number of questions provided for each segment in this sample is approximately, not exactly, what you would see on the test. This Sample test has 40 questions. The Exam #1 will have about 25 questions from Chapters 1, 2, 3, and 4 combined, and about 15 questions from Chapter 8. If you don’t get answer to a question, be sure to provide me with your steps (scan your answer) so that I can guide you better. Just the mention of “I could not get it” will not elicit a response from me. See they keys to questions toward the end. I have kept the questions and answers separated.

1. A model is a functional relationship that includes: (A) variables. (B) parameters. (C) Equations. (D) All of

the above. (E ) None of these are correct.

2. The set of decision alternatives (A) should be identified before the decision criteria are established. (B) are

limited to quantitative solutions. (C) are evaluated as a part of the problem definition stage. (D) are best

generated by brainstorming. (E) None of these are correct.

3. In order to undertake problem solving, the first step must be (A) the determination of the correct

analytical solution procedure. (B) the definition of decision variables. (C) the identification of a difference

between the actual and desired state of affairs. (D) None of these are correct. (E) All of these are correct.

(E) All of the choices are correct. (E) None of the choice is correct.

4. A valid reason for using a quantitative approach to the decision-making process is when (A) the problem

is repetitive, necessitating routine decision making. (B) the problem is unique and the manager has no

prior experience solving this sort of problem. (C) the problem is particularly complex. (D) All of these are

correct. (E) None of the choice is correct.

5. A snack food manufacturer buys corn for tortilla chips from two cooperatives, one in Iowa and one in

Illinois. The price per unit of the Iowa corn is $6.00 and the price per unit of the Illinois corn is $5.50.

Assuming x1 = the number of units bought from Iowa, and x2 = the number of units bought from Illinois,

state which one out of the following equations will not be a part of the model given that the decision will

involve minimizing the total cost. You are further provided that the Iowa cooperative can supply up to

8,000 units and Illinois cooperative can supply at least 6,000 units. (A) x1 ≥ 8000 (B) x2 ≥ 6000 (C) x1 + x 2

≥ 12,000 (D) Min 6x1 + 5.5 x2 (E) All the equations will be valid.

6. Which of the following special cases does NOT require reformulation of the problem in order to obtain a

solution? (A) infeasibility (B) alternative optimality (C) unboundedness (D) Each case requires a

reformulation. (E) None of these cases would need reformulation.

7. A redundant constraint results in (A) no change in the optimal solution(s). (B) an unbounded solution. (C)

an infeasible solution. (D) alternative optimal solutions. (E) None of the choices presented.

8. A Linear programming problem has been formulated as

Minimize 3X + 3Y

Subject to X + 2Y ≤ 16

1X + 1Y ≤ 10

5X + 3Y ≤ 45

X, Y ≥ 0

The graphical solution to the above program has been shown overleaf with the dotted line representing

the objective function. How do you characterize the program? This LP model (A) is infeasible. (B) is

unbounded. (C) has alternate optimality. (D) is unbounded. (E) has a redundant constraint.

9. Which of the following represents a valid constraint in a 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. 10. 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 11. Which of the following combinations of constraints has no feasible region? A) X + Y > 15 and X — Y < 10 B) X + Y > 5 and X > 10 C) X > 10 and Y > 20 D) X + Y > 100 and X + Y < 50 E) All of the above have a feasible region. 12. The feasible region in the diagram below is consistent with which one of the following constraints?

A) 8X1 + 4X2 ≥ 160 B) 4X1 + 8X2 ≤ 160 C) 8X1 - 4X2 ≤ 160 D) 8X1 + 4X2 ≤ 160 E) 4X1 - 8X2 ≤ 160 13. 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 14. For the constraints given below, which point is in the feasible region of this maximization problem? (1) 14x + 6y < 42 (2) x - y < 3 (3) x, y ≥ 0 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 15. What combination of a and b will yield the optimum for this problem? Maximize $6a + $15b, subject to (1) 4a + 2b < 12 and (2) 5a + 2b < 20 and (3) a, b ≥ 0. A) a = 0, b = 0 B) a = 3, b = 3 C) a = 0, b = 6 D) a = 6, b = 0 E) cannot solve without values for a and b 16. A linear programming problem contains a restriction that reads "the quantity of S must be no less than one- fourth as large as T and U combined." Formulate this as a constraint ready for use in problem solving software. A) S / (T + U) ≥ 4 B) S - .25T -.25U ≥ 0 C) 4S ≤ T + U D) S ≥ 4T / 4U E) none of the above 17. Suppose that a maximization LP problem has corner points of (0,0), (10,0), (5,5), and (0,7). If profit is given to be X+ 2Y what is the maximum profit the company can earn? A) $0 B) $10 C) $15 D) $14 E) None of the above or unable to determine

18) Sensitivity analysis assists the decision maker to see A) the value added if scarce resources are increased B) if better solutions are available C) how increases or decreases in parameters impact the objective function D) A and C E) A, B, and C 19) In which of the following LP can be applied successfully assuming each resource constraint and objective function can be represented by straight lines? A) minimizing distance traveled by school buses carrying children B) minimizing 911 response time for police patrols C) minimizing labor costs for bank tellers while maintaining service levels D) determining the distribution system for multiple warehouses to multiple destinations E) all of the above 20) 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 21. Consider the following linear program:

Max 5x1 + 7x2

s.t. x1 ≤ 6

2x1 + 3x2 ≤ 19

x1 + x2 ≤ 8

x1, x2 ≥ 0

The graphical solution to the problem is shown below. From the graph, we see that the optimal solution occurs

at x1 = 5, x2 = 3, and z = 46.

What is the range for the objective function coefficient corresponding to x1 (A) -14/3 ≤ - c1 ≤ 7 (B) 14/3 ≤ c1 ≤

- 7 (C) 14/3 ≤ c1 ≤ 7 (D) 3/14 ≤ c1 ≤ 7 (E) None of the above.

(22) What is the range for the objective function coefficient corresponding to x2

(A) -5 ≤ c2 ≤ 15/2 (B) 5 ≤ c2 ≤ 15/2 (C) 1/5 ≤ c2 ≤ 15/2 (D) -5 ≤ c2 ≤ 2/15 (E) None of the

above.

Billy's Blues sells 3 types of T-shirts: Astro, Bling, and Curious. Manufacturing Astros requires 2 minutes

of machine time and 20 minutes of labor, and costs $10. Brand Bling requires 2.5 minutes of machine time

and 30 minutes of labor, and costs $14 to produce. Brand Curious requires 3 minutes of machine time and

45 minutes of labor, and costs $18 to produce. There are 300 machining hours available per week, 3750

labor hours, and he has a budget of $3000. Brand Astro sells for $15, Brand Bling for $18, and Brand

Curious for $25.

The LP formulation that maximizes week profit shown below.

MAX 15A +18B + 25 C

s.t.

2A + 2.5B + 3C ≤ 300

20A + 30B + 45C ≤ 3750

10A + 14B + 18C ≤ 3000

The solution from QM for Windows is show below.

(23) If Billy could acquire more of any resource, which would it be?

(A) machining time

(B) labor time

(C) money

(D) buyers

(24) Billy's accountant made an error, and the budget has been reduced from $3000 to $2500. Billy's

profit will go down by:

(A) $1650.

(B) $1350.

(C) $625.

(D) $0.

If one of Billy's machines breaks down, it usually results in about 6 hours of downtime. When this

happens, Billy's profits are reduced by:

A) $15.

B) $18.

C) $25.

D) $35.

(26) A negative dual price for a constraint in a minimization problem means (A) as the right-hand side increases, the objective function value will increase.

(B) as the right-hand side decreases, the objective function value will increase.

(C) as the right-hand side increases, the objective function value will decrease.

(D) as the right-hand side decreases, the objective function value will decrease.

(E) None of the above.

27) Which of the following is not one of the three phases of project management?

(A) planning

(B) scheduling

(C) controlling

(D) All of the above are project management phases.

(E) Both A and C are not project management phases.

(28) Ethical issues that may arise in projects large and small include

(A) gifts from contractors

(B) exaggerated expense reports

(C) compromised safety or health standards to save time or reduce costs

(D) pressure to mask delays with false status reports

(E) all of the above

(29) 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 pictures that show the duration of activities in a project.

(D) Gantt charts are expensive.

(E) All of the above are true.

(30) A project manager is interested in crashing a project with variable activity times. Which

of the following tools should he/she employ?

(A) PERT

(B) CPM

(C) Gantt Chart

(D) either PERT or CPM

(E) PERT, CPM, or a Gantt chart are fine

(31) PERT/CPM would be most appropriate for which of the following?

(A) Retail selling.

(B) managing a major overhaul of a special submarine.

(C) managing assembly line work.

(D) managing maintenance of a photocopying machine.

(E) None of the choices presented.

(32) The critical path for the network activities shown below is __________ with duration

__________.

Activity Duration

Immediate

Predecessors

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

(33) The expected activity time in PERT analysis is calculated as

(A) the simple average of the optimistic, pessimistic, and most likely times

(B) the weighted average of a, m, and b, with m weighted 4 times as heavily as a and b

(C) the sum of the optimistic, pessimistic, and most likely times

(D) the sum of the optimistic, pessimistic, and most likely times, divided by six

(E) the sum of the activity variances, divided by six

(34) The Beta distribution is used in project management to

(A) calculate slack on activities not on the critical path

(B) calculate the probability that a project will be completed within its budget

(C) calculate pessimistic and optimistic activity times

(D) determine which activity should be crashed

(E) none of the above

(35) A project being analyzed by PERT has 60 activities, 13 of which are on the critical path.

If the estimated time along the critical path is 214 days with a project variance of 100, the

probability that the project will take 224 days or more to complete is

(A) near zero

(B) 0.0126

(C) 0.1587

(D) 0.8413

(E) 2.14

(36) An activity on a PERT network has these time estimates: optimistic = 1, most likely = 2,

and pessimistic = 5. Its expected time is

(A) 2.00

(B) 2.33

(C) 2.67

(D) 8.00

(E) none of these

(37) Which of these statements regarding time-cost tradeoffs in CPM networks is true?

(A) Crashing is not possible unless there are multiple critical paths.

(B) Crashing a project often reduces the length of long-duration, but noncritical, activities.

(C) Activities not on the critical path can never be on the critical path, even after crashing.

(D) Crashing shortens the project duration by assigning more resources to one or more of the

critical tasks.

(E) None of the above is true.

(38) A network has been crashed to the point where all activities are critical. Additional

crashing

(A) is unnecessary

(B) is impossible

(C) is prohibitively expensive

(D) may require crashing multiple tasks simultaneously

(E) can be done, but all critical tasks must be reduced in duration

(39) Two critical path activities are candidates for crashing on a CPM network. Activity

details are in the table below. To cut one day from the project’s duration, activity _________

should be crashed first, adding _________ to project cost.

Activity Normal Time Normal Cost Crash Time Crash Cost

B 4 days $6,000 3 days $8,000

C 6 days $4,000 4 days $6,000

(A) B; $2,000

(B) B; $8,000

(C) C; $1,000

(D) C; $2,000

(E) C; $6,000

(40) Activity D on a CPM network has predecessors B and C, and has successor F. D has

duration 6. B's earliest finish is 18, while C's is 20. F's late start is 26. Which of the following

is definitely true?

(A) B is a critical activity.

(B) C is completed before B.

(C) D has no slack but is not critical.

(D) D is critical and has zero slack.

(E) F is critical and has zero slack.

Answer Key:

1-D; 2-A; 3-C; 4-D; 5-A; 6-B; 7-A; 8-C; 9-C; 10-E; 11-D; 12-D; 13-B; 14-A;15-C; 16-B; 17- C;

18-D; 19-E; 20-E; 21-C; 22-B; 23- A; 24-D; 25-D; 26-A; 27-D; 28-E; 29-C; 30-A; 31-B; 32-E;

33-B; 34-E; 35-C; 36-B; 37-D; 38-D; 39-C; 40-D.