1) Simulation is very flexible. Thus, its solutions and inferences are usually transferable
to other problems.
2) The F statistic is the ratio of two sample standard deviations from independent
normal distributions.
3) In a constant service time model, both the average queue length and average waiting
time are halved.
4) We may begin the maximal-flow technique by picking an arbitrary path through the
network.
5) Cable television companies would employ the shortest-route technique to lay out the
cables connecting individual houses.
6) The maximal-flow model assumes that there is a net flow from ‘source” to ‘sink.”
7) In a production scheduling problem, the inventory at the end of this month is set
equal to the inventory at the end of last month + last month’s production sales this
month.
8) For statistical tests of significance about the coefficients, the null hypothesis is that
the slope is 1.
9) Requiring an integer solution to a linear programming problem decreases the size of
the feasible region.
10) The wait time for a single-channel system is more than twice that for a two-channel
system using two servers working at the same rate as the single server.
11) A dummy variable can be assigned up to three values.
12) To solve the following set of simultaneous equations, the determinant solution for X
would be
4X + 3Y = 7
2X – 2Y = 5
A) X = /
B) X = /
C) X = /
D) X = /
E) None of the above
13) The number of calls received by call center follows a Poisson process with a rate of
1.5 per minute. What is the probability that a minute goes by without a call?
A) 0
B) 0.223
C) 0.500
D) 0.558
E) 1
14) Consider the following linear program:
(a) Convert the above constraints to equalities by adding the appropriate slack variables.
(b) Set up the initial simplex tableau and solve.
15) The analytic technique used to analyze complex queuing models that cannot be
captured in closed-form expressions is called
A) extrapoloation.
B) interpolation.
C) simulation.
D) linear programming.
E) forecasting.
16) Consider the project with the following estimates for activity times and precedence
relationships:
(a) What is the expected duration of the project?
(b) What is the project variance?
(c) If the deadline of the project is 25 days, what is the probability of finishing the
project on time?
17) Which of the following methods gives an indication of the percentage of forecast
error?
A) MAD
B) MSE
C) MAPE
D) decomposition
E) bias
18) What is the range of the Hurwicz criterion coefficient of realism ?
A) 1 to 100
B) 1 to 10
C) 0 to 10
D) 0 to 1
E) 1 to 1
19) A goal programming problem had two goals (with no priorities assigned). Goal
number 1 was to achieve a cost of $3,600 and goal number 2 was to complete the task
in 400 hours or fewer. The optimal solution to this problem resulted in a cost of $3,600
and a completion time of 420 hours. What was the value for the objective function for
this goal programming problem?
A) 400
B) -400
C) 20
D) 0
E) None of the above
20) The demand during the lead-time is normally distributed with a mean of 40 and a
standard deviation of 4. If they have calculated a reorder point of 46.60 units, what
service level are they assuming?
A) 85 percent
B) 90 percent
C) 95 percent
D) 97.5 percent
E) None of the above
21) Table 12-6
Customers arrive at coffee shop at a rate of 40 per hour. There are 2 servers available
and it takes an average of 1 minute to serve each customer.
Using Table 12-6, what is the average number of customers in the coffee shop?
A) 0.0833
B) 0.5
C) 0.75
D) 1.33
E) 2
22) Table M2-4
For the shortest route problem described in Table M2-4, which arcs comprise the
shortest route?
A) 1-2, 2-6, 6-8
B) 1-3, 3-5, 5-8
C) 1-5, 5-8
D) 1-2, 2-4, 4-7, 7-8
E) None of the above
23) Given the following key factors and their importance weights, determine a total
weighted evaluation for A3.
A) 0.69
B) 0.74
C) 0.59
D) 0.50
E) None of the above
24) Goal programming and linear programming differ in that
A) in LP, the objective function is maximized or minimized, while in goal
programming, the deviation between goals and possible achievement is minimized.
B) slack variables are used in LP, while deviational variables are used in goal
programming.
C) deviational variables have positive objective function coefficients in goal
programming, but slack variables have 0 coefficients in LP.
D) All of the above
E) None of the above
25) A certain firm has noticed that employees’ salaries from year to year can be modeled
by Markov analysis. The matrix of transition probabilities follows.
(a) Set up the matrix of transition probabilities in the form:
(b) Determine the fundamental matrix for this problem.
(c) What is the probability that an employee who has received a raise will eventually
quit?
(d) What is the probability that an employee who has received a raise will eventually be
fired?
26) Determine the weighted sum vector for the indicated factor evaluation and its
original pairwise comparison matrix.
27) Media selection problems can be approached with LP from which two perspectives?
28) Complete this mathematical statement: P(loss) = ________
29) Given the following opportunity loss function, determine the loss when 7,000 units
are sold. Opportunity loss: 6(9,000 – X) for X ¤ 9,000.
30) List several disadvantages of buying inventory in large quantities.