1.

Question Decision makers in queuing situations attempt to balance

A operating characteristics against the arrival rate
B service levels against service cost
C the number of units in the system against the time in the system
D the service rate against the arrival rate
Answer B
2.Question The manner in which units receive their service, such as FCFS, is the
A queue discipline
B channel
C steady state
D operating characteristic
Answer A
3.Question What queue discipline is assumed by the waiting line models presented in the textbook?
A first-come first-served
B last-in first-out
C shortest processing time first
D No discipline is assumed
Answer A
4.Question In Markov analysis, we are concerned with the probability that the
A state is part of a system
B system is in a particular state at a given time
C time has reached a steady state
D transition will occur
Answer B
5.Question For a situation with weekly dining at either an Italian or Mexican restaurant,
A the weekly visit is the trial and the restaurant is the state
B the weekly visit is the state and the restaurant is the trial
C the weekly visit is the trend and the restaurant is the transition
D the weekly visit is the transition and the restaurant is the trend
Answer A

6.Question A transition probability describes

A the probability of a success in repeated, independent trials
B the probability a system in a particular state now will be in a specific state next period
C the probability of reaching an absorbing state
D None of the alternatives is correct
Answer B
7.Question Performance measures dealing with the number of units in line and the time spent
waiting are called
A queuing facts
B performance queues
C system measures
D operating characteristic
Answer D
8.Question The probability of going from state 1 in period 2 to state 4 in period 3 is
A p12
B p23
C p14
D p43
Answer C
9.Question The probability that a system is in a particular state after a large number of periods is
A independent of the beginning state of the system
B dependent on the beginning state of the system
C equal to one half
D the same for every ending system
Answer A
10.Questio Analysis of a Markov process
n
A describes future behavior of the system
B optimizes the system
C leads to higher order decision making
D All of the alternatives are true
Answer A
11.Questio If the probability of making a transition from a state is 0, then that state is called
n
A steady state
B final state
C origin state
D absorbing state
Answer D
12.Questio Absorbing state probabilities are the same as
n
A steady state probabilities
B transition probabilities
C fundamental probabilities
D None of the alternatives is true
Answer D
13.Questio Absorbing state probabilities are the same as
n
A steady state probabilities
B transition probabilities
C fundamental probabilities
D None of the alternatives is true
Answer D
14.Questio The following is not an assumption of Markov analysis
n
A There is an infinite number of possible states
B The probability of changing states remains the same over time
C (a) and (d)
D We can predict any future state from the previous state and the matrix of transition
probabilities
Answer C
15.Questio The total cost for a waiting line does NOT specifically depend on
n
A the cost of waiting
B the cost of service
C the number of units in the system
D the cost of a lost customer
Answer D

16.Questio Markov analysis assumes that conditions are both

n
A complementary and collectively exhaustive
B collectively dependent and complementary
C collectively dependent and mutually exclusive
D collectively exhaustive and mutually exclusive
Answer D
17.Questio Occasionally, a state is entered which will not allow going to another state in the future.
n This is called
A an equilibrium state
B stable mobility
C market saturation
D none of the above
Answer D
18.Questio In Markov analysis, the likelihood that any system will change from one period to the
n next is revealed by the
A identity matrix
B transition-elasticities
C matrix of state probabilities
D matrix of transition probabilities
Answer D
19.Questio The condition that a system can be in only one state at any point in time is known as
n
A Transient state
B Absorbent condition
C Mutually exclusive condition
D Collectively exhaustive condition
Answer C
20.Questio At any period n, the state probabilities for the next period n+1 is given by the following
n formula:
A n(n+1)=n(n)Pn
B n(n+1)=n(0)P
C n(n+1)=(n+1)P
D n(n+1)=n(n)P
Answer D
21.Questio If we decide to use Markov analysis to study the transfer of technology,
n
A our study will be methodologically flawed
B our study will have only limited value because the Markov analysis tells us "what" will
happen, but not "why”
C we can only study the transitions among three different technologies
D only constant changes in the matrix of transition probabilities can be handled in the
simple model
Answer B
22.Questio Markov analysis assumes that the states are both __________ and __________
n
A finite, recurrent
B infinite, absorbing
C generally inclusive, always independent
D collectively exhaustive, mutually exclusive
Answer D
23.Questio The ________ determine(s) the equilibrium of a Markov process
n
A original state probabilities
B state vector
C transition matrix
D fundamental matrix F
Answer C
24.Questio Values for the probabilistic inputs to a simulation
n
A are selected by the decision maker
B are controlled by the decision maker
C are randomly generated based on historical information
D are calculated by fixed mathematical formulas
Answer C
25.Questio In order to verify a simulation model
n
A compare results from several simulation languages
B be sure that the procedures for calculations are logically correct
C confirm that the model accurately represents the real system
D run the model long enough to overcome initial start-up results
Answer B