200 Questions (Linear Graphical, Transportation, Waiting Lines)

TA: Moh. Fajar Sidik

Major: Management 2019

Email: moh19002@mail.unpad.ac.id

LINEAR PROGRAMMING GRAPHICAL

Level: Easy

1. A linear programming problem has…

A. Objective function, Variables and non-negativity restrictions
B. Objective function, Variables and negativity restrictions
C. Objective function, Constraints and non-negativity restrictions
D. Objective function, Constraints and negativity restrictions

Answer: C.

2. Extreme Point Theorem is…

A. If an optimal feasible value of the objective function exists, it will always be found at
one of the extreme points of the boundary.
B. If an optimal infeasible value of the objective function exists, it will always be found
at one of the extreme points of the boundary.
C. If an optimal infeasible value of the objective function exists, it will always be found
at two of the extreme points of the boundary.
D. If an optimal feasible value of the objective function exists, it will always be found at
two of the extreme points of the boundary.

Answer: A.

3. Graphical method is used to solve LPP involving…

A. One Variables
B. Two Variables
C. Zero Variables
 D. limited Variables

Answer: B

4. A feasible region contains…

A. All the points that satisfy all the given constraints and the non-negativity variables
B. Few the points that satisfy all the given constraints and the non-negativity variables
C. Few the points that satisfy all the given constraints and the non-negativity constraints
D. All the points that satisfy all the given constraints and the non-negativity constraints

Answer: D.

5. A special case when the objection function can be made infinitely large without violating
any of the constraints
A. Boundedness
B. Unboundedness
C. Bounded
D. Equal

Answer: B.

6. It is the application of quantitative scientific methods, techniques and tools to arrive at

optimum solutions to complex organizational activities.
A. Operating Research
B. Operation Management
C. Operating Modul
D. Operation System

Answer: A.

7. In the graph, this is the intercept when the value of x = 0, is…

A. x – nonintercept
B. x - intercept
C. y - intercept
D. y - nonintercept

Answer: C.
8. A special case when an LP problem has no solution even though all constraints are being
satisfied.
A. Feasibility
B. Infeasibility
C. Linier
D. Nonlinier

Answer: B.

9. Is function represented by the table linear or

nonlinear?
A. Linier
B. Nonlinier
C. Surplus
D. Slack

Answer: A.

10. Is function represented by the table linear or

nonlinear?
A. Nonlinier
B. Linier
C. Equal
D. Surplus

Answer: A.

11. Sarah makes small purses (x) and big purses (y). She can make no more than 101 purses a
week. Which inequality represents the situation?
A. x + y ≤ 101
B. x + y ≤ 202
 C. 3x + 3y ≤ 101
D. 2x + 3y ≤ 101

Answer: A.

12. It takes Sarah 2 hours to make small purses and 3 hours to make big purses. She has a
maximum of 18 hours a week. Which inequality represents this situation?
A. 3x + 3y ≤ 18
B. 2x + 3y ≤ 18
C. 2x + 3y ≤ 18
D. 3x + 2y ≤ 18

Answer: B.

13. Sarah makes $30 for each small purse (x) and $50 for each big purse (y). What is the
objective quantity?
A. P = 50x + 30y
B. P = 50x + 50y
C. P = 30x + 30y
D. P = 30x + 50y

Answer: D.

14. Objective quantity:

P = 30x + 50y
Corner that maximizes profit: (0, 6)
What is the profit?
A. 301
B. 302
C. 300
D. 303

Answer: C.

15. Usage of raw materials is ------- or equal to the availability of raw materials.
A. More than
 B. Less than
C. Equal
D. Same

Answer: B.

16. Constraints involving equal to sign do not require use of ------- or -------variables.
A. Surplus and Break
B. Slack and Slack
C. Surplus and Surplus
D. Slack and Surplus

Answer: D.

17. A transportation problem is special case of linear programming problem.

A. True
B. False

Answer: A.

18. Row wide and column wide difference between two minimum costs is calculated under
------method
A. VAM
B. VCM
C. NICA
D. NTO

Answer: A.

19. An assignment problem is said to be unbalanced if

A. No of rows not equal to no of column
B. No of column an equal to no of rows
C. No of column not equal to no of rows
D. No of rows an equal to no of column

Answer: A
20. The Problem of maximizing z = X1 – X2 subject to constraints X1 + X2 <= 10,
X1, X2 => 0
X2 <= 5 has…
A. Zero solution
B. One solution
C. Two solution
D. Three solution

Answer: B

21. In 1948 he suggested to George Dantzig to shorten it to "linear programming" is…

A. Nikola Sword
B. Tjalling Michele
C. Tjalling Koopsman
D. Daniel Koopsman

Answer: C

22. A combination of decision variable amounts that yields the best possible value of the
objective function and satisfies all the constraints, is…
A. Optimal Solution
B. Unoptimal Solution
C. Break Solution
D. Zero solutiom

Answer: A.

23. Set of combinations of values for the decision variables that satisfy the non-negativity
conditions and all the constraints simultaneously that is allowable decisions, is…
A. The Feasible Region
B. Unfeasible Region
C. The feasible constraints
D. Unfeasible Constraints

Answer: A.
24. Fundamental Theorem of Linear Programming Problem is: …
A. If a Linear Programming problem has optimal solution, there is always at least one
single point solution of the feasible region. A Linear Programming problem with
bounded, nonempty feasible region always contain optimal solutions.
B. If a Linear Programming problem has optimal solution, there is always at least one
extreme point (corner point) solution of the feasible region. A Linear Programming
problem with bounded, nonempty feasible region always contain optimal solutions.
C. If a Linear Programming problem has optimal solution, there is always at least one
single point solution of the feasible region. A Linear Programming problem with
bounded, empty feasible region always contain optimal solutions.
D. If a Linear Programming problem has optimal solution, there is always at least one
extreme point (corner point) solution of the feasible region. A Linear Programming
problem with bounded, empty feasible region always contain optimal solutions.

Answer: B

25. In a feasible basic solution all the variables (with the possible exception of the objective)
are…
A. Nonnegative
B. Negative
C. Zero
D. Limited

Answer: A

26. Which of the following inequalities matches the given graph?

A. X < -1
B. X < -2
 C. X < -3
D. X < -4

Answer: A.

27. Which are vertices of the feasible region?

A. (0, 5) (7, 0) (3, 4)
B. (0, 5) (6, 0) (3, 3)
C. (0, 5) (7, 0) (3, 3)
D. (0, 5) (6, 0) (3, 4)

Answer: B.

28. What do you call the area where all the shading
overlaps?
A. The Feasible Region
B. Unfeasible Region
C. The feasible constraints
D. Unfeasible Constraints
Answer: A.
 29. Given the objective function: P = 30x + 50y. Which vertex
maximizes the profit?
A. ( 0,8)
B. ( 0,5)
C. ( 0,6)
D. ( 0,7)

Answer: C

30. Sarah makes small purses (x) and big purses (y). She can make no more than 8 purses a
week. Which inequality represents the situation?
Answer:
A. X + Y ≤ 0
B. X + Y ≤ 16
C. X + Y ≤ 24
D. X + Y ≤ 8

Answer: D

31. F

Level: Medium

32. The steps in formulating a linear program follow…

A. Completely understand the managerial problem being faced. Identify the objective
and the constraints. Define the decision variables. Use the decision variables to write
mathematical expressions for the objective function and the constraints.
B. Completely understand the managerial problem being faced. Analyze the objective
and the variable. Define the decision variables. Don’t use the decision variables to
write mathematical expressions for the objective function and the variables.
 C. Completely understand the managerial problem being faced. Analyze the objective
and the constraints. Define the decision variables. Don’t use the decision variables to
write mathematical expressions for the objective function and the constraints.
D. Completely understand the managerial problem being faced. Identify the objective
and the constraints. Define the decision variables. Use the decision variables to write
mathematical expressions for the objective function and the variables.

Answer: A.

33. The following is a standard maximum problem:

Maximize p = x − y − 3z
Subject to 4x − 3y − z ≤ −3
x + y + z ≤ 10
2x + y − z ≤ 10
x ≥ 0, y ≥ 0, z ≥ 0
A. True
B. False

Answer: A.

34. The point (3, 2) satisfies the constraint 2X1 + 6X2 ≤ 30, are…
A. When X1 = 3 and X2 = 4, the left-hand-side value of the constraint is 2(3) + 6(4) = 30
and this value is strictly less than the right-hand-side value of the constraint.
B. When X1 = 3 and X2 = 5, the left-hand-side value of the constraint is 2(3) + 6(5) = 36
and this value is strictly less than the right-hand-side value of the constraint.
C. When X1 = 3 and X2 = 2, the left-hand-side value of the constraint is 2(3) + 6(2) = 18
and this value is strictly less than the right-hand-side value of the constraint.
D. When X1 = 3 and X2 = 3, the left-hand-side value of the constraint is 2(3) + 6(3) = 24
and this value is strictly less than the right-hand-side value of the constraint.

Answer: C

35. all the points of the feasible region for maximum or minimum of objective function the
points
A. Inside the feasible region
 B. At the boundary line of the feasible region
C. Vertex point of the boundary of the feasible region
D. None of these

Answer: C

36. Objective function of a linear programming problem is

A. a constraint
B. function to be obtimized
C. A relation between the variables
D. None of these

Answer: B

37. A set of values of decision variables which satisfies the linear constraints and nn-
negativity conditions of a L.P.P. is called its
A. Unbounded solution
B. Optimum solution
C. Feasible solution
D. None of these

Answer: C

38. The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y
≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0 is
A. 300
B. 400
C. 600
D. 800

Answer: C

39. The maximum value of Z = 4x + 2y subject to the constraints 2x + 3y ≤ 18, x + y ≥ 10, x,

y ≤ 0 is
A. 30
B. 36
 C. 40
D. None of these

Answer: D

40. In equation 3x – y ≥ 3 and 4x – 4y > 4

A. Have solution for positive x and y
B. Have no solution for positive x and y
C. Have solution for all x
D. Have solution for all y

Answer: A.

41. The maximum value of Z = 3x + 4y subjected to contraints x + y ≤ 40, x + 2y ≤ 60, x ≥ 0

and y ≥ 0 is
A. 100
B. 120
C. 140
D. 160

Answer: C

42. Maximize Z = 11 x + 8y subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0.

A. 44 at (4, 2)
B. 60 at (4, 2)
C. 62 at (4, 0)
D. 48 at (4, 2)

Answer: B

43. Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0

A. 20 at (1, 0)
B. 30 at (0, 6)
C. 37 at (4, 5)
D. 33 at (6, 3)

Answer: C.
44. Maximize Z = 10 x1 + 25 x2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5
A. 80 at (3, 2)
B. 75 at (0, 3)
C. 30 at (3, 0)
D. 95 at (2, 3)

Answer: D

45. If the I constraint of a primal (maximization) is equality, then the dual (minimization)
variables is:
A. > 0
B. < 0
C. Unrestricted in sign
D. None of the above

Answer: C

46. Find the maximum value of f(x,y)=9x+90y

A. 102
B. 108
C. 48
D. 42

Answer: D
47. Find the minimum value of z=5x+7y
A. 15
B. 19
C. 22
D. 27

Answer: A

48. Which point is a solution?

A. (0,6)
B. (-3,4)
C. (1,0)
D. (-4,3)

Answer: C

49. X – Y – 1 <= 0
 A.

B.

C.
D. None of these

Answer: A

50. F

51.
Solve the system of inequalities. The feasible region is shown by the darkest blue
shading.
 A.

B.

C.

D.

Answer: B.

Level: Hard

52. A farmer can plant up to 6 acres of land with soybeans and corn. Her use of a necessary
pesticide is limited by federal regulations to 15 gallons for her entire 6 acres. Soybeans
require 2 gallons of pesticide for every acre planted and corn requires 3 gallons per acre.
The profit the farmer makes by earning $4,000 for every acre of soybeans she plants and
$3,000 for every acre she plants with barley can be modeled by P=4000x+3000y . If x
 represents acres of soybeans and y represents acres of corns, which inequalities represent
the possible solutions to her situation?
Answer:
A. X ≥ 0; Y ≥ 0
X + Y ≤ 6; 2X +3Y ≤ 15
B. X ≥ 0; Y ≥ 0
X + Y ≤ 7; 2X +3Y ≤ 15
C. X ≥ 0; Y ≥ 0
X + Y ≤ 7; 2X +3Y ≤ 16
D. X ≥ 0; Y ≥ 0
X + Y ≤ 6; 2X +3Y ≤ 16
Answer: A.
53. A farmer can plant up to 6 acres of land with soybeans and corn. Her use of a necessary
pesticide is limited by federal regulations to 15 gallons for her entire 6 acres. Soybeans
require 2 gallons of pesticide for every acre planted and corn requires 3 gallons per acre.
The profit the farmer makes by earning $4,000 for every acre of soybeans she plants and
$3,000 for every acre she plants with barley can be modeled by P=4000x+3000y . What
is the maximum profit that she can earn?
A. $20,000
B. $21,000
C. $22,000
D. $23,000
Answer: B
54. Explanation

Maximizing Z = X1 – X2
 Constraint X1 + X2 <= 10
X2 <= 5
X1, X2 => 0
Corner points are…
Answer:
A. 8
B. 9
C. 10
D. 11

Answer: C.

55. The corner point of the feasible region determined by the system of linear constraints are
(0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is Z = 4x + 3y.
Compare the quantity in Column A and Column B

A. The quantity in column A is greater

B. The quantity in column B is greater
C. The two quantities are equal
D. The relationship cannot be determined On the basis of the information supplied

Answer: B

56. The feasible region for a LPP is shown shaded in the figure. Let Z = 3x – 4y be the
objective function. Minimum of Z occurs at
 A. (0, 0)
B. (0, 8)
C. (5, 0)
D. (4, 10)

Answer: B

57.
 To get the optimal solution X1 and X2 are...
A. (20, 0)
B. (0, 16)
C. (8, 16)
D. None of these

Answer: B

58.
Maximize Z = 60X1 + 50X2
Where X1 and X2 >= 0
A. The LPP has a unique optimal solution
B. The LPP is infeasible
C. The LPP unbound
D. The LPP has multiple optimal solutions

Answer: A
59.
What is the optimal solutions…
A. (2,2)
B. (0,2)
C. (2,0)
D. (0,0)

Answer: B

60.
A. The LPP has a unique optimal solution
 B. The LPP is infeasible
C. The LPP is unbounded
D. The LPP has multiple optimal solutions

Answer: D.

TRANSPORTASTION

Level: Easy

1. What is the goal of transportation problems?

A. Maximize Cost
B. Minimize Cost
C. Balance Cost
D. Minimax Regret Cost

Answer: B.

2. What is a destination in transportation problems?

A. Destination refers to the consumer's desire to purchase goods and services and
willingness to pay a price for a specific good or service.
B. Destination is defined as the inventory or stock of a resource that had been produced
from which a person or place can be provided with the necessary amount of the said
resource
C. Destination is the location to which commodities are distributed or transported to.
D. Destination is defined as the group of supply centers that are concerned with the
production of commodities.

Answer: C.

3. There can be more than one source in a transportation problem.

A. True
B. False
C. Probably
D. All above correct

Answer: A.
4. There can be more than one destination in a transportation problem.
A. True
B. False
C. Probably
D. All above correct

Answer: A.

5. This refers to the inventory or stock of a resource that had been produced from which a
person or place can be provided with the necessary amount of the said resource.
A. Requirement
B. Unit Transportation Cost
C. Capacity
D. Source

Answer: C.

6. This refers to the consumer's desire to purchase goods and services and willingness to pay a
price for a specific good or service.
A. Capacity
B. Destination
C. Source
D. Requirement

Answer: D.

7. This method is used in moving from the initial feasible solution to the optimal feasible
solution.
A. North-West Corner Rule
B. Hungarian Method
C. Vogel's Approximation Method
D. Stepping Stone Method

Answer: D.
8. Through this method, the feasible solution that would be obtained is either optimal or very
close to the optimal solution.
A. North-West Corner Rule
B. Hungarian Method
C. Vogel's Approximation Method
D. Stepping Stone Method
Answer: C.
9. The initial solution of a transportation problem can be obtained by any known method,
however the only condition is that
A. The solution should be optimal
B. The rim condition are satisfied
C. The solution need to be degenate
D. All of these

Answer: B.

10. Transportation problem is a member of category of LPP called

A. Ruoting Problem
B. Sequencing Problems
C. Network Flow Problems
D. None of these

Answer: C.

11. The dummy source or destination in a transportation problemis added to

A. Satisfy rimconditions
B. Ensure that the total costdoes not exceed a limit
C. Prevent solution from becoming degenerate
D. Noneof the above

Answer: A.

12. In a transportation problem, we must make the number of __________ and __________
equal.
A. Destinations; sources
 B. columns; rows
C. warehouses; suppliers
D. units supplied; units demanded

Answer: D

13. When using a general LP model for transportation problems, if there are 4 sources and 3
destinations, which of the following statements is true?
A. There are typically 4 decision variables and 3 constraints.
B. There are typically 12 decision variables and 7 constraints.
C. There are typically 7 decision variables and 7 constraints.
D. There are typically 12 decision variables and 12 constraints.

Answer: B

14. Transportation models can be used for which of the following decisions?
A. facility location
B. production mix
C. media selection
D. portfolio selection

Answer: A.

15. For finding an optimum solution in transportation problem ____________ method is

used.
A. Simplex
B. Big M
C. Modi
D. Hungarian

Answer: C.

16. In northwest corner method first allocation is made at

A. Lower right corner of the table.
B. Upper right corner of the table.
C. Highest right corner of the table.
 D. Upper left hand corner of the table.

Answer: D.

17. When the total demand is equal to supply then the transportation problem is said to be …
A. Balanced
B. Unbalanced
C. Maximization
D. Minimization

Answer: A.

18. The solution to a transportation problem with ‘m’ rows (Supplies) & ‘n’ columns
(destination) is basic feasible if number of positive allocation are
A. M + n
B. M * n
C. M + n -1
D. M + n+1

Answer: C.

19. In applying Vogel’s Approximation method row and column penalties are determined by:
A. Finding the largest unit cost in each row or column.
B. Finding the smallest unit cost in each row or column.
C. Finding the sum unit cost in each row or column.
D. Finding the different between the two lowest unit cost in each row or column.

Answer: D.

20. The maximization type of transportation problem can be converted into minimization
type…
A. By subtracting smallest cost element from all other cost elements
B. By adding smallest cost element to all other cost elements
C. By subtracting the all the unit cost from the highest unit cost of the table
D. By adding smallest cost element to all other cost elements.

Answer: C.
21. In degenerate solution value of objective function…
A. Increases infinitely
B. Basic variables are nonzero
C. Decreases infinitely
D. One or more basic variables are zero

Answer: D

22. Feasible solution satisfies…

A. Only constraints
B. Only non-negative restriction
C. A and B both
D. A, B and Optimum solution

Answer: C.

23. Which of the following methods is used to verify the optimality of the current solution of
the transportation problem
A. least cost method
B. Vogel’s approximation method
C. Modified distribution method
D. All of the above

Answer: A.

24. The occurrence of degeneration while solving a transportation problem means that
A. Total supply equals total demand
B. The solution so obtained is not feasible
C. The few allocations become negative
D. None of the above

Answer: B.

25. One disadvantage of using North-West Corner rule to find initial solution to the
transportation problem is that
A. It is complicated to use
 B. It does not take into account cost of transportation
C. It leads to a degenerate initial solution
D. All of the above

Answer: B.

26. If an opportunity cost value is used for an unused cell to test optimality, it should be
A. Equal to zero
B. Most negative number
C. Most positive number
D. Any value

Answer: B.

27. The large negative opportunity cost value in an unused cell in a transportation table is
chosen to improve the current solution because
A. It represents per unit cost reduction
B. It represents per unit cost improvement
C. It ensures no rim requirement violation
D. None of the above

Answer: A.

28. The smallest quantity is chosen at the corners of the closed path with negative sign to
beassigned at unused cell because
A. It improves the total cost
B. It does not disturb rim conditions
C. It ensures a feasible solution
D. All of the above

Answer: C.

29. An alternative optimal solution to a minimization transportation problem exists whenever

opportunity cost corresponding to unused route of transportation is:
A. Positive & greater than zero
B. Positive with at least one equal to zero
 C. Negative with at least one equal to zero
D. None of the above

Answer: B.

30. The purpose of the stepping-stone method is to:

A. Develop the initial solution to a transportation problem.
B. Identify the relevant costs in a transportation problem.
C. Determine whether a given solution is feasible.
D. Assist one in moving from an initial feasible solution to the optimal solution.

Answer: D.

31. The purpose of a dummy source or a dummy destination in transportation problem is to:
A. Provide a means of representing a dummy problem.
B. Obtain a balance between total supply and total demand.
C. Prevent the solution from becoming degenerate.
D. Make certain that the total cost does not exceed some specified figure.

Answer: B

32. If a solution to a transportation problem is degenerate, then:

A. It will be impossible to evaluate all empty cells without removing the degeneracy.
B. A dummy row or column must be added.
C. There will be more than one optimal solution.
D. The problem has no feasible solution.

Answer: A

Level: Medium
33.

In the original table, how many units of Honda Civic A would be transported to showroom
Y?
A. 900
B. 50
C. 750
D. 800

Answer: B.

34. A transportation problem with four sources and five destinations will have … decision
variables.
A. 19
B. 20
C. 21
D. 22

Answer: B.

35. Suppose we have a transportation problem with 3 sources and 5 destinations. Each
destination can be reached from each source, each source has a given capacity, and each
 destination has a given demand. Ignoring non negativity, how many variables are needed
in this problem?
A. 14
B. 15
C. 18
D. 24

Answer: B.

36. With the transportation technique, the initial solution can be generated in any fashion one
chooses. The only restriction(s) is that:
A. The solution be optimal.
B. One use the northwest-corner method.
C. The edge constraints for supply and demand be satisfied.
D. The solution not be degenerate.

Answer: C.

37. The table represents a solution that is:

A. Degenerate
B. Initial Solution
C. Final Solution
D. Optimal

Answer: A.

38. What is wrong the following table?

 A. The solution is unbounded.
B. The solution is bounded.
C. The solution is infeasible.
D. The solution is feasible.

Answer: C.

39. The solution presented in the following table is

A. Initial Solution
B. Final Solution
C. Optimal
D. Degenerate.

Answer: C.
40. The solution shown

Was obtained by Vogel’s approximation. The difference between the objective function
for this solution and that for the optimal is
A. 70
B. 80
C. 90
D. 100

Answer: B.

41. Determine basic feasible solution to the following transportation problem using North
West Corner rule.

A. Total Cost = 88
B. Total Cost = 98
C. Total Cost = 94
D. Total Cost = 84

Answer: C.
42. Obtain an initial basic feasible solution to the following transportation problem by North
West corner method.

A. Total Cost = 12,100

B. Total Cost = 12,200
C. Total Cost = 12,300
D. Total Cost = 12,400

Answer: B.

43. Find the initial basic feasible solution of the following transportation problem, using
Vogel’s approximation.

A. AI = 7, BI = 2, BIII = 10, CI = 1, CII = 10.

B. AI = 8, BI = 2, BIII = 9, CI = 1, CII = 10.
C. AI = 7, BI = 2, BIII = 9, CI = 1, CII = 10.
D. AI = 8, BI = 2, BIII = 10, CI = 1, CII = 10.

Answer: A.

44. Consider the following transportation problem

 Determine initial basic feasible solution by VAM.
A. O1I = 10, O1III = 20, O2I = 20, O2II = 30, 02IV = 10, O3II = 20. Total Cost =
360.
B. O1I = 10, O1III = 20, O2I = 20, O2II = 20, 02IV = 10, O3II = 20. Total Cost =
370.
C. O1I = 10, O1III = 20, O2I = 20, O2II = 20, 02IV = 10, O3II = 20. Total Cost =
360.
D. O1I = 10, O1III = 20, O2I = 20, O2II = 30, 02IV = 10, O3II = 20. Total Cost =
370.

Answer: B.

45. Obtain an initial basic feasible solution to the following transportation problem by using
the least-cost method.

A. O1I = 15, O1III = 10, O2III = 35, O3II = 15, 03II = 25. Total Cost = 580.
B. O1I = 15, O1II = 10, O2III = 35, O3I = 15, 03II = 25. Total Cost = 580.
C. O1I = 15, O1II = 10, O2III = 35, O3II = 15, 03II = 25. Total Cost = 580.
D. O1I = 15, O1III = 10, O2III = 35, O3I = 15, 03II = 25. Total Cost = 580.

Answer: D.
46. Determine an initial basic feasible solution of the following transportation problem by
north west corner method

A. Chennai > Bangalore = 30, Madurai > Bangalore = 5, Madurai > Nasik = 18,
Madurai > Bhopal = 7, Trichy > Nasik = 25, Trichy > Delhi = 25. Total Cost =
1076.
B. Chennai > Bangalore = 30, Madurai > Bangalore = 5, Madurai > Nasik = 28,
Madurai > Bhopal = 7, Trichy > Nasik = 25, Trichy > Delhi = 25. Total Cost =
1076.
C. Chennai > Bangalore = 30, Madurai > Bangalore = 5, Madurai > Nasik = 28,
Madurai > Bhopal = 7, Trichy > Bhopal = 25, Trichy > Delhi = 25. Total Cost =
1076.
D. Chennai > Bangalore = 30, Madurai > Bangalore = 5, Madurai > Nasik = 18,
Madurai > Bhopal = 7, Trichy > Bhopal = 25, Trichy > Delhi = 25. Total Cost =
1076.

Answer: C.

47. Find an initial basic feasible solution of the following problem using North West corner
rule.
 A. O1I = 16, O1II = 3, O2II = 15, O2III = 9, 03III = 9, O3IV = 20. Total Cost = 360.
B. O1I = 16, O1II = 3, O2II = 16, O2III = 9, 03II = 9, O3IV = 20. Total Cost = 360.
C. O1I = 16, O1II = 3, O2II = 15, O2III = 9, 03II = 9, O3IV = 20. Total Cost = 360.
D. O1I = 16, O1II = 3, O2II = 16, O2III = 9, 03III = 9, O3IV = 20. Total Cost = 360.

Answer: A.

48. Find the optimal solution of the following transportation problem:

The cell entries are unit transportation costs.

A. Optimal Cost = 2,220.
B. Optimal Cost = 2,221.
C. Optimal Cost = 2,222.
D. Optimal Cost = 2,223.

Answer: B.

49. Solve the following transportation problem:

A. Total Cost = 100.

B. Total Cost = 101.
C. Total Cost = 102.
D. Total Cost = 103.

Answer: C.

50. Solve the following transportation problem:

 A. Optimal Cost = 60.
B. Optimal Cost = 70.
C. Optimal Cost = 80.
D. Optimal Cost = 90.

Answer: B.

Level: Hard

51.

Based on the original table, how much would the total transportation cost be?
A. 25, 300
B. 24, 850
C. 24, 950
D. 23, 500

Answer: A.
52.

A total of how many times would the stepping stone method be carried out?
A. 8
B. 4
C. 6
D. 10

Answer: A.
53.

At the last revised transportation table, how many units of Honda Civic B would be
transported to showroom Y?
A. 50
B. 100
C. 700
D. 900

Answer: D.
54.

What is the optimal total transportation cost?

A. 29, 450
B. 24, 950
C. 25, 300
D. 23, 500

Answer: B.

55. The Hardrock Concrete Company has plants in three locations and is currently working
on three major construction projects, each located at a different site. The shipping cost
per truckload of concrete, daily plant capacities, and daily project requirements are
provided in the table on this page. Formulate this as a linear program to determine the
least-cost way to meet the requirements. Solve using any computer software.
 A. Des Moines to Albuquerque 200, Des Moines to Boston 50, Des Moines to Cleveland
50, Evansville to Boston 150, Ft. Lauderdale to Cleveland 250; cost = $3,200
B. Des Moines to Albuquerque 150, Des Moines to Boston 50, Des Moines to Cleveland
50, Evansville to Boston 200, Ft. Lauderdale to Cleveland 250; cost = $3,200
C. Des Moines to Albuquerque 50, Des Moines to Boston 50, Des Moines to Cleveland
150, Evansville to Boston 150, Ft. Lauderdale to Cleveland 250; cost = $2,300
D. Des Moines to Albuquerque 50, Des Moines to Boston 50, Des Moines to Cleveland
150, Evansville to Boston 150, Ft. Lauderdale to Cleveland 250; cost = $3,200

Answer: A.

56. The Saussy Lumber Company ships pine flooring to three building-supply houses from
its mills in Pineville, Oak Ridge, and Mapletown. Determine the best transportation
schedule for the data given in the table on this page.

A. 5 units from Pineville to 3, 10 units from Oak Ridge to 2, 30 units from Oakville to 3,
30 units from Mapletown to 1; cost = $320; multiple optimal solutions
B. 5 units from Pineville to 3, 30 units from Oak Ridge to 2, 10 units from Oakville to 3,
30 units from Mapletown to 1; cost = $320; multiple optimal solutions
C. 5 units from Pineville to 3, 30 units from Oak Ridge to 2, 10 units from Oakville to 3,
30 units from Mapletown to 1; cost = $230; multiple optimal solutions
D. 5 units from Pineville to 3, 30 units from Oak Ridge to 2, 30 units from Oakville to 3,
10 units from Mapletown to 1; cost = $230; multiple optimal solutions

Answer: C.

57. An air-conditioning manufacturer produces room air conditioners at plants in Houston,

Phoenix, and Memphis. These are sent to regional distributors in Dallas, Atlanta, and
Denver. The shipping costs vary, and the company would like to find the least-cost way
 to meet the demands at each of the distribution centers. Dallas needs to receive 800 air
conditioners per month, Atlanta needs 600, and Denver needs 200. Houston has 850 air
conditioners available each month, Phoenix has 650, and Memphis has 300. The shipping
cost per unit from Houston to Dallas is $8, to Atlanta is $12, and to Denver is $10. The
shipping cost per unit from Phoenix to Dallas is $10, to Atlanta is $14, and to Denver is
$9. The shipping cost per unit from Memphis to Dallas is $11, to Atlanta is $8, and to
Denver is $12. What is the total cost for this?
A. Total cost = $14,600
B. Total cost = $14,700
C. Total cost = $14,800
D. Total cost = $14,900

Answer: B.

58. Finnish Furniture manufactures tables in facilities located in three cities—Reno, Denver,
and Pittsburgh. The tables are then shipped to three retail stores located in Phoenix,
Cleveland, and Chicago. Management wishes to develop a distribution schedule that will
meet the stores’ demands at the lowest possible cost. The shipping cost per unit from
each of the sources to each of the destinations is shown in the following table:

The available supplies are 120 units from Reno, 200 from Denver, and 160 from
Pittsburgh. Phoenix has a demand of 140 units, Cleveland has a demand of 160 units, and
Chicago has a demand of 180 units. What is the total cost?
A. $10,280
B. $10,380
C. $10,480
D. $10,580

Answer: A.
 59. The three blood banks in Franklin County are coordinated through a central office that
facilitates blood delivery to four hospitals in the region. The cost to ship a standard
container of blood from each bank to each hospital is shown in the table on this page.
Also given are the biweekly number of containers of blood available at each bank and the
biweekly number of containers needed at each hospital. How many shipments should be
made biweekly from each blood bank to each hospital so that total shipment costs are
minimized?

A. $2,050
B. $2,040
C. $2,030
D. $2,020

Answer: D.

60. Find an initial solution to the following transportation problem.

Use the northwest-corner method. What is its total cost?

A. $3,020
B. $3,120
C. $3,220
D. $3,320

Answer: B.

WAITING LINES
Level: Easy

1. The body of knowledge dealing with waiting lines is known as queueing theory.
A. True
B. False
C. Probably
D. All above correct

Answer: True

2. Performance measures dealing with the number of units in line and the time spent waiting
are called
A. Queuing Facts
B. System Measures
C. Performance Queues
D. Operating Characteristics.

Answer: D.

3. Decision makers in queuing situations attempt to balance

A. Operating characteristics against the arrival rate.
B. The number of units in the system against the time in the system.
C. Service levels against service cost.
D. The service rate against the arrival rate.

Answer: C.

4. The manner in which units receive their service, such as FCFS, is the
A. Queue discipline.
B. Steady state
C. Server
D. Operating Characteristic.

Answer: A.

5. In a waiting line situation, arrivals occur, on average, every 10 minutes, and 10 units can be
received every hour. Which of the following represents λ and μ in this situation?
 A. λ = 10, μ = 10
B. λ = 6, μ = 10
C. λ = 6, μ = 6
D. λ = 10, μ = 6

Answer: B.

6. The mean number of units that can be served per time period is called
A. The service rate and is denoted by λ.
B. The service rate and is denoted by μ.
C. The steady state.
D. None all above.

Answer: B.

7. For many waiting line situations, the arrivals occur randomly and independently of other
arrivals and it has been found that a good description of the arrival pattern is provided by
a(n)
A. Normal probability distribution.
B. Uniform probability distribution.
C. Exponential probability distribution.
D. Poisson probability distribution.

Answer: D.

8. Single-booth ticket sales at a theater are an example of which of the following queuing
models?
A. Single-server, Poisson service rate distribution, unlimited queue length
B. Single-server, constant service rate distribution, unlimited queue length
C. Single-server, Poisson service rate distribution, limited queue length
D. Single-server, normal service rate distribution, unlimited queue length

Answer: A.

9. The equations provided in the textbook for computing operating characteristics apply to a
waiting line operating
 A. At start-up.
B. At peak demand times.
C. At steady state.
D. In transition.

Answer: C.

10. Adding more servers always improves the operating characteristics of the waiting line and
reduces the waiting cost.
A. True
B. False
C. Probably
D. All above correct

Answer: A.

11. In developing the total cost for a waiting line, waiting cost takes into consideration both the
time spent waiting in line and the time spent being served.
A. True
B. False
C. Probably
D. All above correct

Answer: A.

12. Waiting line models consist of mathematical formulas and relationships that can be used to
determine the operating characteristics (also known as performance measures) for a waiting
line.
A. True
B. False
C. Probably
D. All above correct

Answer: A.

13. The arrival rate in queuing formulas is expressed as the …

 A. Mean time between arrivals.
B. Mean number of arrivals per server.
C. Minimum number of arrivals per time period.
D. Mean number of arrivals per time period.

Answer: D.

14. An infinite calling population occurs when the likelihood of a new arrival depends upon
the number of past arrivals.
A. True
B. False
C. Probably
D. All above correct

Answer: B.

15. The utilization factor is defined as

A. The percent of time the system is idle.
B. Average percent of time the customers wait in line.
C. Average time the service system is open.
D. None of the above.

Answer: D.

16. A queuing system described as M>D>2 would have

A. Exponential service times.
B. Two queues.
C. Constant service times.
D. Constant arrival rates.

Answer: C.

17. Lines at banks where customers wait for a teller window are usually representative of a
A. Single-channel, multiphase system.
B. Single-channel, single-phase system.
C. Multichannel, multiphase system.
 D. Multichannel, single-phase system.

Answer: D.

18. The basic Kendall notation is based on arrival time distribution, service time distribution,
and cost characteristics.
A. True
B. False
C. Probably
D. All above correct

Answer: B.

19. Which of the following is not true about arrivals?

A. Random arrivals are independent of each other.
B. Random arrivals cannot be predicted exactly.
C. Service times often follow the negative exponential distribution.
D. The exponential distribution is often used to represent the arrival pattern.

Answer: D.

20. A suburban specialty restaurant has developed a single drive-through window. Customers
order, pay, and pick up their food at the same window. Arrivals follow a Poisson
distribution, while service times follow an exponential distribution. What type of queuing
model is exhibited in this problem?
A. M/M/1
B. M/M/2
C. M/D/1
D. M/D/2

Answer: C.

21. When managers find standard queuing formulas inadequate or the mathematics
unsolvable, they often resort to…to obtain their solutions.
A. Simulation.
B. Balance.
 C. Unbalanced.
D. System.

Answer: A.

22. The service time in the M/M/1 queuing model is assumed to be…
A. Non negative exponentially distributed.
B. Negative exponentially distributed.
C. Positive distributed.
D. None of the above.

Answer: B.

23. In the standard queuing model, we assume that the queue discipline is…
A. First come, last served
B. Last come, last served
C. First come, first served
D. Last come, first served.

Answer: C.

24. In performing a cost analysis of a queuing system, the waiting time cost is sometimes
based on the time in the queue and sometimes based on the time in the system. The
waiting cost should be based on time in the system for which of the following situations?
A. Waiting in line to ride an amusement park ride
B. Waiting to discuss a medical problem with a doctor
C. Waiting for a picture and an autograph from a rock star
D. Waiting for a computer to be fixed so it can be placed back in service

Answer: D.

25. If everything else remains the same, including the mean arrival rate and service rate,
except that the service time becomes constant instead of exponential
A. The average queue length will be halved.
B. The average waiting time will be doubled.
C. The average queue length will increase.
 D. We cannot tell from the information provided.

Answer: A.

26. Little’s law can be applied to a single-server as well as multiple-server waiting line model.
A. True
B. False
C. Probably
D. All above correct

Answer: A.

27. Two characteristics of arrivals are the line length and queue discipline
A. True
B. False
C. Probably
D. All above correct

Answer: A.

28. What can you say about the relationship between W and Wq in a stable queuing system
with λ>0?
A. W is always greater than Wq
B. W is always less than Wq
C. W is always equal to Wq
D. It depends on the type of queuing system

Answer: A.

29. A hospital emergency room will usually employ a FIFO queue discipline.
A. True
B. False
C. Probably
D. All above correct

Answer: B.
 30. A cafeteria, in which cold dishes are separated from hot dishes, is probably best viewed
as single channel, single phase system.
A. True
B. False

Answer: B.

Level: Medium

31. Customers enter the waiting line at a cafeteria on a first-come, first-served basis. The
arrival rate follows a Poisson distribution, while service times follow an exponential
distribution. If the average number of arrivals is four per minute and the average service
rate of a single server is seven per minute, what is the average number of customers in the
system?
A. 0.43
B. 1.67
C. 0.57
D. 1.33

Answer: D.

32. Customers enter the waiting line at a cafeteria’s only cash register on a first-come, first-
served basis. The arrival rate follows a Poisson distribution, while service times follow an
exponential distribution. If the average number of arrivals is 6 per minute and the average
service rate of a single server is 10 per minute, what is the average number of customers
in the system?
A. 0.6
B. 0.9
C. 1.5
D. 1.0

Answer: C.
33. A company has one computer technician who is responsible for repairs on the company’s
20 computers. As a computer breaks, the technician is called to make the repair. If the
repairperson is busy, the machine must wait to be repaired. This is an example of:
A. A multiple-server system.
B. A finite population system.
C. A constant service rate system.
D. A multiphase system.

Answer: B.

34. If emails arrive to my mailbox according to a Poisson process at a rate of 10 per hour and
the time it takes me to “deal with” an email is on average 2 minutes. What are the values
of λ and μ?
A. λ=10 per hour and μ=2 per hour
B. λ=2 per hour and μ=10 per hour
C. λ=10 per hour and μ=30 per hour
D. λ=30 per hour and μ=10 per hour

Answer: D.

35. On average, a service facility experiences 10 customers arriving per hour and a single
server can serve 15 customers per hour. Arrival rates and service rates both follow a
Poisson distribution.
A. Waiting lines form at this facility because there is not enough average service
capacity.
B. No waiting lines form at this facility because the average arrival rate is less than the
average service rate.
C. No waiting lines form at this facility because the utilization is less than 1.
D. Waiting lines form at this facility because of variability in interarrival times and
service times.

Answer: A.

36. Marty Schatz owns and manages a chili dog and soft drink store near the campus.
Although Marty can service 30 customers per hour on the average 1m2, he gets only 20
 customers per hour 1l2. Because Marty could wait on 50% more customers than actually
visit his store, it doesn’t make sense to him that he should have any waiting lines. Marty
hires you to examine the situation and to determine some characteristics of his queue.
After looking into the problem, you find this to be an M>M>1 system. … customer in the
system average.
A. 2
B. 3
C. 4
D. 5

Answer: A

37. Marty Schatz owns and manages a chili dog and soft drink store near the campus.
Although Marty can service 30 customers per hour on the average 1m2, he gets only 20
customers per hour 1l2. Because Marty could wait on 50% more customers than actually
visit his store, it doesn’t make sense to him that he should have any waiting lines. Marty
hires you to examine the situation and to determine some characteristics of his queue.
After looking into the problem, you find this to be an M>M>1 system. …Percentage of
the time that Marty is busy waiting on customers.
A. 0.64
B. 0.65
C. 0.67
D. 0.68

Answer: C

38. Marty Schatz owns and manages a chili dog and soft drink store near the campus.
Although Marty can service 30 customers per hour on the average 1m2, he gets only 20
customers per hour 1l2. Because Marty could wait on 50% more customers than actually
visit his store, it doesn’t make sense to him that he should have any waiting lines. Marty
hires you to examine the situation and to determine some characteristics of his queue.
After looking into the problem, you find this to be an M>M>1 system. …customer
waiting for service in line on the average.
A. 1.32
 B. 1.33
C. 1.42
D. 1.43

Answer: B

39. The Maitland Furniture store gets an average of 50 customers per shift. The manager of
Maitland wants to calculate whether she should hire 1, 2, 3, or 4 salespeople. She has
determined that average waiting times will be 7 minutes with 1 salesperson, 4 minutes
with 2 salespeople, 3 minutes with 3 salespeople, and 2 minutes with 4 salespeople. She
has estimated the cost per minute that customers wait at $1. The cost per salesperson per
shift (including benefits) is $70. Average number of customer?
A. 49
B. 50
C. 51
D. 52

Answer: B

40. The Maitland Furniture store gets an average of 50 customers per shift. The manager of
Maitland wants to calculate whether she should hire 1, 2, 3, or 4 salespeople. She has
determined that average waiting times will be 7 minutes with 1 salesperson, 4 minutes
with 2 salespeople, 3 minutes with 3 salespeople, and 2 minutes with 4 salespeople. She
has estimated the cost per minute that customers wait at $1. The cost per salesperson per
shift (including benefits) is $70. Average waiting time per customer (minutes)?
A. 7; 4; 3; 3.
B. 7; 5; 3; 2.
C. 7; 5; 3; 3.
D. 7; 4; 3; 2.

Answer: D

41. The Maitland Furniture store gets an average of 50 customers per shift. The manager of
Maitland wants to calculate whether she should hire 1, 2, 3, or 4 salespeople. She has
determined that average waiting times will be 7 minutes with 1 salesperson, 4 minutes
 with 2 salespeople, 3 minutes with 3 salespeople, and 2 minutes with 4 salespeople. She
has estimated the cost per minute that customers wait at $1. The cost per salesperson per
shift (including benefits) is $70. Cost per minute of waiting time (estimated)?
A. $1
B. $2
C. $3
D. $4

Answer: A

42. Marty agreed that these figures seemed to represent his approximate business situation.
You are quite surprised at the length of the lines and elicit from him an estimated value of
the customer’s waiting time (in the queue, not being waited on) at 10 cents per minute.
During the 12 hours that he is open he gets 112 * 202= 240 customers. The average
customer is in a queue 4 minutes, so the total customer waiting time is 1240 * 4
minutes2= 960 minutes. The value of 960 minutes is 1$0.1021960 minutes2= $96. You
tell Marty that not only is 10 cents per minute quite conservative but also he could
probably save most of that $96 of customer ill will if he hired another salesclerk. After
much haggling, Marty agrees to provide you with all the chili dogs you can eat during a
weeklong period in exchange for your analysis of the results of having two clerks wait on
the customers. Probability of no customers in the system?
A. 0.4
B. 0.5
C. 0.6
D. 0.7

Answer: B

43. Marty agreed that these figures seemed to represent his approximate business situation.
You are quite surprised at the length of the lines and elicit from him an estimated value of
the customer’s waiting time (in the queue, not being waited on) at 10 cents per minute.
During the 12 hours that he is open he gets 112 * 202= 240 customers. The average
customer is in a queue 4 minutes, so the total customer waiting time is 1240 * 4
 minutes2= 960 minutes. The value of 960 minutes is 1$0.1021960 minutes2= $96. You
tell Marty that not only is 10 cents per minute quite conservative but also he could
probably save most of that $96 of customer ill will if he hired another salesclerk. After
much haggling, Marty agrees to provide you with all the chili dogs you can eat during a
weeklong period in exchange for your analysis of the results of having two clerks wait on
the customers. Average time the customer spends in the total system?
A. 2,22 minutes.
B. 2,23 minutes.
C. 2,24 minutes.
D. 2,25 minutes.

Answer: D.

44. Marty agreed that these figures seemed to represent his approximate business situation.
You are quite surprised at the length of the lines and elicit from him an estimated value of
the customer’s waiting time (in the queue, not being waited on) at 10 cents per minute.
During the 12 hours that he is open he gets 112 * 202= 240 customers. The average
customer is in a queue 4 minutes, so the total customer waiting time is 1240 * 4
minutes2= 960 minutes. The value of 960 minutes is 1$0.1021960 minutes2= $96. You
tell Marty that not only is 10 cents per minute quite conservative but also he could
probably save most of that $96 of customer ill will if he hired another salesclerk. After
much haggling, Marty agrees to provide you with all the chili dogs you can eat during a
weeklong period in exchange for your analysis of the results of having two clerks wait on
the customers. Utilization rate?
A. 0.30
B. 0.33
C. 0.40
D. 0.43

Answer: B.

Level: Hard
45. A technician monitors a group of five computers that run an automated manufacturing
facility. It takes an average of 15 minutes (exponentially distributed) to adjust a computer
that develops a problem. The computers run for an average of 85 minutes (Poisson
distributed) without requiring adjustments. (a) average time in the queue? (b) average
time in the system?
A. 0.227 hours; 0.467 hours.
B. 0.217 hours; 0.467 hours.
C. 0.227 hours; 0.477 hours.
D. 0.217 hours; 0.477 hours.

Answer: B.

46. The Clear Brook High School band is holding a car wash as a fund-raiser to buy new
equipment. The average time to wash a car is 4 minutes, and the time is exponentially
distributed. Cars arrive at a rate of one every 5 minutes (or 12 per hour), and the number
of arrivals per time period is described by the Poisson distribution. (a) What is the
average time for cars waiting in the line? (b) What is the average number of cars in the
line?
a. 0.17 hours; 3.2.
b. 0.17 hours; 3.3.
c. 0.27 hours; 3.2.
d. 0.27 hours; 3.3.

Answer: C.

47. Trucks arrive at the receiving area of a distribution center according to a Poisson process
with an average rate of 4 trucks per hour. The time required to unload a truck is
exponentially distributed with a mean of 12 minutes. A single dock is used for unloading
the trucks. At most 4 trucks can be in the yard waiting to be unloaded (any other trucks
are directed to wait at a nearby diner). What type of queuing system can be used to model
this problem?
A. M/M/1 with K=1
B. M/M/3 with K=3
C. M/M/1 with K=2
 D. M/M/1 with K=4

Answer: D.

48. From historical data, Harry’s Car Wash estimates that dirty cars arrive at the rate of 10
per hour all day Saturday. With a crew working the wash line, Harry figures that cars can
be cleaned at the rate of one every 5 minutes. One car at a time is cleaned in this example
of a single-channel waiting line. Assuming Poisson arrivals and exponential service
times, find the (a) average number of cars in line. (b) average time a car waits before it is
washed. (c) average time a car spends in the service system.
a. 4.167 cars, 0.4167 hours, 0.5 hours.
b. 4.167 cars, 0.4267 hours, 0.5 hours.
c. 4.167 cars, 0.4267 hours, 0.6 hours.
d. 4.167 cars, 0.4167 hours, 0.6 hours.

Answer: A

49. A university cafeteria line in the student center is a self-serve facility in which students
select the food items they want and then form a single line to pay the cashier. Students
arrive at the cashier at a rate of about four per minute according to a Poisson distribution.
The single cashier ringing up sales takes about 12 seconds per customer, following an
exponential distribution. (a) What is the probability that there are more than two students
in the system? More than three students? More than four? (b) What is the probability that
the system is empty?
a. 0.513, 0.410, 0.329; 0.2.
b. 0.512, 0.410, 0.328; 0.2.
c. 0.513, 0.410, 0.328; 0.3.
d. 0.512, 0.410, 0.329; 0.3.

Answer: B.

50. A university cafeteria line in the student center is a self-serve facility in which students
select the food items they want and then form a single line to pay the cashier. Students
arrive at the cashier at a rate of about four per minute according to a Poisson distribution.
The single cashier ringing up sales takes about 12 seconds per customer, following an
 exponential distribution. (a) How long will the average student have to wait before
reaching the cashier? (b) What is the expected number of students in the queue? (c) What
is the average number in the system?
a. 0.9 minutes; 3.1; 5.
b. 0.9 minutes; 3.2; 5.
c. 0.8 minutes; 3.2; 5.
d. 0.8 minutes; 3.2; 4.

Answer: D.

51. Ashley’s Department Store in Kansas City maintains a successful catalog sales
department in which a clerk takes orders by telephone. If the clerk is occupied on one
line, incoming phone calls to the catalog department are answered automatically by a
recording machine and asked to wait. As soon as the clerk is free, the party that has
waited the longest is transferred and answered first. Calls come in at a rate of about 12
per hour. The clerk is capable of taking an order in an average of 4 minutes. Calls tend to
follow a Poisson distribution, and service times tend to be exponential. The clerk is paid
$10 per hour, but because of lost goodwill and sales, Ashley’s loses about $50 per hour of
customer time spent waiting for the clerk to take an order. (a) What is the average time
that catalog customers must wait before their calls are transferred to the order clerk? (b)
What is the average number of callers waiting to place an order? (c) Ashley’s is
considering adding a second clerk to take calls. The store would pay that person the same
$10 per hour. Should it hire another clerk?
a. 0.2687 hours; 3.2; Yes, savings = $142.50 per hour.
b. 0.2687 hours; 3.2; No, savings = $142.50 per hour.
c. 0.2697 hours; 3.2; No, savings = $142.50 per hour.
d. 0.2697 hours; 3.2; Yes, savings = $142.50 per hour.

Answer: A

52. Automobiles arrive at the drive-through window at a post office at the rate of four every
10 minutes. The average service time is 2 minutes. The Poisson distribution is
appropriate for the arrival rate and service times are exponentially distributed. a second
drivethrough window is being considered. A single line would be formed, and as a car
 reached the front of the line it would go to the next available clerk. The clerk at the new
window works at the same rate as the current one. (a) What is the average time a car is in
the system? (b) What is the average number of cars in the system? (c) What is the
average time cars spend waiting to receive service?
a. 0.0397 hours; 0.9524; 0.006 hours.
b. 0.0399 hours; 0.9524; 0.008 hours.
c. 0.0399 hours; 0.9524; 0.006 hours.
d. 0.0397 hours; 0.9524; 0.008 hours.

Answer: A

53. Automobiles arrive at the drive-through window at a post office at the rate of four every
10 minutes. The average service time is 2 minutes. The Poisson distribution is
appropriate for the arrival rate and service times are exponentially distributed. a second
drivethrough window is being considered. A single line would be formed, and as a car
reached the front of the line it would go to the next available clerk. The clerk at the new
window works at the same rate as the current one. (a) What is the average number of cars
in line behind the customer receiving service? (b) What is the probability that there are no
cars in the system?
a. 0.1534; 0.428.
b. 0.1534; 0.418.
c. 0.1524; 0.428.
d. 0.1524; 0.418.

Answer: C.

54. Billy’s Bank is the only bank in a small town in Arkansas. On a typical Friday, an
average of 10 customers per hour arrives at the bank to transact business. There is one
single teller at the bank, and the average time required to transact business is 4 minutes. It
is assumed that service times can be described by the exponential distribution. Although
this is the only bank in town, some people in the town have begun using the bank in a
neighboring town about 20 miles away. If a single teller at Billy’s is used, find (a) the
average time in the line. (b) the average number in the line. (c) the average time in the
system.
 a. 0.1333 hours; 1.333; 0.3 hour.
b. 0.1343 hours; 1.333; 0.3 hour.
c. 0.1343 hours; 1.333; 0.2 hour.
d. 0.1333 hours; 1.333; 0.2 hour.

Answer: D.

55. A technician monitors a group of five computers that run an automated manufacturing
facility. It takes an average of 15 minutes (exponentially distributed) to adjust a computer
that develops a problem. The computers run for an average of 85 minutes (Poisson
distributed) without requiring adjustments. What is the (a) average number of computers
waiting for adjustment? (b) average number of computers not in working order? (c)
probability the system is empty?
a. 0.586; 1.24; 0.344.
b. 0.586; 1.24; 0.354.
c. 0.576; 1.24; 0.344.
d. 0.576; 1.24; 0.354.

Answer: C.

56. The Clear Brook High School band is holding a car wash as a fund-raiser to buy new
equipment. The average time to wash a car is 4 minutes, and the time is exponentially
distributed. Cars arrive at a rate of one every 5 minutes (or 12 per hour), and the number
of arrivals per time period is described by the Poisson distribution. (a) What is the
average number of cars in the system? (b) What is the average time in the system? (c)
What is the probability there are more than three cars in the system?
a. 4; 0.43 hours; 0.4096.
b. 4; 0.43 hours; 0.4196.
c. 4; 0.33 hours; 0.4196.
d. 4; 0.33 hours; 0.4096.

Answer: D.

57. The Schmedley Discount Department Store has approximately 300 customers shopping
in its store between 9 a.m. and 5 p.m. on Saturdays. In deciding how many cash registers
 to keep open each Saturday, Schmedley’s manager considers two factors: customer
waiting time (and the associated waiting cost) and the service costs of employing
additional checkout clerks. Checkout clerks are paid an average of $8 per hour. When
only one is on duty, the waiting time per customer is about 10 minutes (or 16 hour); when
two clerks are on duty, the average checkout time is 6 minutes per person; 4 minutes
when three clerks are working; and 3 minutes when four clerks are on duty. Schmedley’s
management has conducted customer satisfaction surveys and has been able to estimate
that the store suffers approximately $10 in lost sales and goodwill for every hour of
customer time spent waiting in checkout lines. Using the information provided, determine
the optimal number of clerks to have on duty each Saturday to minimize the store’s total
expected cost.
a. Total costs for 1, 2, 3, and 4 clerks are $574, $428, $392, and $416, respectively.
b. Total costs for 1, 2, 3, and 4 clerks are $564, $428, $392, and $406, respectively.
c. Total costs for 1, 2, 3, and 4 clerks are $574, $428, $392, and $406, respectively.
d. Total costs for 1, 2, 3, and 4 clerks are $564, $428, $392, and $416, respectively.

Answer: B.

58. The department of commerce has five printers that each need repair after about 20 hours
of work, Breakdown follow a poisson distribution, the technician can service a printer in
average of about 2 hours following an exponentian distribution. What is the total hourly
cost?
a. $101.80
b. $111.80
c. $121.80
d. $131.80

Answer: A

59. Upon arrival at the Sunkist Gate at Naval Base Ventura County in Port Hueneme,
California, there are two security guards, each assigned to one of the two vehicular lanes
that lead up to the gate, to check the identification (i.e., the military Common Access
Cards) of people in the vehicles going onto the base. In the morning, when the gate is the
busiest, cars arrive every 20 minutes and randomly get into one of the two clearly marked
 “No-Lane-Change” lanes. Once a car is at the head of its particular line, it takes the guard
about 2 minutes, on the average, to check the IDs of everyone in every car. Usually, that
means just one person. However, some people carpool, and there may be as many 5 in
any particular vehicle. Given that the vehicular arrivals follow a Poisson distribution and
the time to check IDs follows a negative exponential distribution, determine the average
number of cars and the average waiting time in each of the queues.
A. 0.64 and 0.91 minutes
B. 0.74 and 0.91 minutes
C. 0.84 and 0.91 minutes
D. 0.94 and 0.91 minutes

Answer: A

60. The department of commerce has five printers that each need repair after about 20 hours
of work, Breakdown follow a poisson distribution, the technician can service a printer in
average of about 2 hours following an exponentian distribution. What is the probability?
And average length of the queue?
A. 0.564 and 0.2 Printer
B. 0.565 and 0.2 Printer
C. 0.566 and 0.2 Printer
D. 0.567 and 0.2 Printer

Answer: B