Question 1

Markov analysis provides a recommended decision.

Accepted Answer

A) True 
 B)False

Question 2

Markov analysis is not a descriptive technique that results in probabilistic information.

Accepted Answer

A) True 
 B)False

Question 3

The brand-switching problem analyzes the probability of customers' changing brands of a product over time.

Accepted Answer

A) True 
 B)False

Question 4

A Markov assumption is that the probabilities are constant over time.

Accepted Answer

A) True 
 B)False

Question 5

Markov analysis is a descriptive technique that results in probabilistic information.

Accepted Answer

A) True 
 B)False

Question 6

A Markov assumption is that the probabilities ________ over time.

Accepted Answer

A)  become smaller 
B)  become larger 
C)  change 
D)  are constant 
A)  become smaller 
B)  become larger 
C)  change 
D)  are constant

Question 7

Markov analysis can be used to determine the steady state probabilities associated with machine breakdowns.

Accepted Answer

A) True 
 B)False

Question 8

Limmer's is going to launch a new advertising campaign in order to attract new customers. The "before" and "after" transition matrices are shown below:
Before: $$\begin{array}{l}
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\text { Next Week }\
\begin{array} { l c c } 
\text { This Week } & \text { Don's } & \text { Limmer's } \
\hline \text { Don's } & 0.9 & 0.1 \
\text { Limmer's } & 0.2 & 0.8
\end{array}
\end{array}$$ 
After: $$\begin{array}{l}
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\text { Next Week }\
\begin{array} { l c c } 
\text { This Week } & \text { Don's } & \text { Limmer's } \
\hline \text { Don's } & 0.85 & 0.15 \
\text { Limmer's } & 0.2 & 0.8
\end{array}
\end{array}$$ 
If there are 1000 customers who shop at these two stores, how many customers, over the long run, will switch to Limmer's as a result of the new campaign?

Accepted Answer

Before: 0.333 ∗ 2000

Question 9

The probability of ending up in a state in the future is ________ of the starting state.

Accepted Answer

The answer of The probability of ending up in a...

Question 10

In certain applications, the transition matrix may first need to be divided into submatrices. The identity matrix, I, and matrix Q (the nonabsorbing matrix) are then used to determine the ________ matrix.

Accepted Answer

The answer of In certain applications, the transition matrix may...

Question 11

Participants eligible for a retraining program can be in one of four states:
A - not in the training program
B - discharged
C - in training
D - employed
You are given the following transition matrix and the fundamental matrix. $$\begin{array} { r r r r r } 
& \mathrm { A } &  { \text { B } } & \text { C } & \text { D } \
\hline \mathrm { A } & .1 & .6 & .3 & 0 \
\mathrm {~B} & 0 & 1.0 & 0 & 0 \
\mathrm { C } & .2 & .2 & .5 & .1 \
\mathrm { D } & 0 & 0 & 0 & 1.0
\end{array}$$ 
 $$\begin{array} { c c c } 
& \mathrm { A } & \mathrm { C } \
\hline \mathrm { A } & 1.28 & 0.77 \
\mathrm { C } & 0.51 & 2.31
\end{array}$$ 
Assume that there were initially 10 people not in the training program (State 
A) and 60 people who were in the training program (State
C). How many people will end up being discharged, and how many people will be employed?

Accepted Answer

F × R = @#IMG-DLM& Total in B = 10 (.92)

Question 12

The transition matrix below shows the probabilities that customer switch between two grocery stores, Don's and Limmer's, each week. $$\begin{array}{l}
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\text { Next Week }\
\begin{array} { l c c } 
\text { This Week } & \text { Don's } & \text { Limmer's } \
\hline \text { Don's } & 0.9 & 0.1 \
\text { Limmer's } & 0.2 & 0.8
\end{array}
\end{array}$$ 
If there are 2000 customers who shop at either store, how many over the long run would shop at Limmer's?

Accepted Answer

The answer of The transition matrix below shows the probabilities...

Question 13

Participants eligible for a retraining program can be in one of four states:
A - not in the training program
B - discharged
C - in training
D - employed
You are given the following transition matrix and the fundamental matrix. $$\begin{array} { r r r r r } 
& \mathrm { A } & { \text { B } } & \text { C } & \text { D } \
\hline \mathrm { A } & .1 & .6 & .3 & 0 \
\mathrm {~B} & 0 & 1.0 & 0 & 0 \
\mathrm { C } & .2 & .2 & .5 & .1 \
\mathrm { D } & 0 & 0 & 0 & 1.0
\end{array}$$
$$\begin{array} { c c c } 
& \mathrm { A } & \mathrm { C } \
\hline \mathrm { A } & 1.28 & 0.77 \
\mathrm { C } & 0.51 & 2.31
\end{array}$$
Assume that there were initially 10 people not in the training program (State A) and 60 people who were in the training program (State C). Approximately how many people will end up being discharged?

Accepted Answer

A)  10 
B)  15 
C)  40 
D)  55 
E)  60 
A)  10 
B)  15 
C)  40 
D)  55 
E)  60

Question 14

Markov analysis is not a probabilistic technique.

Accepted Answer

A) True 
 B)False

Question 15

For the following transition matrices, what is the absorbing state(s)? $$\left| \begin{array} { l l l l } 
0 & 0 & 2 / 3 & 1 / 3 \
0 & 1 & 0 & 0 \
3 / 4 & 1 / 4 & 0 & 0 \
1 & 0 & 0 & 0
\end{array} \right|$$

Accepted Answer

A)  state 1 
B)  state 2 
C)  state 3 
D)  state 4 
E)  state 2 and 4 
A)  state 1 
B)  state 2 
C)  state 3 
D)  state 4 
E)  state 2 and 4

Question 16

A Markov process has the following transition matrix:
 $$\begin{array} { c c c } 
& \mathrm { A } & \mathrm { B } \
\text { A } & 0.25 & 0.75 \
\text { B } & 0.60 & 0.40
\end{array}$$ What are the steady state probabilities?

Accepted Answer

The answer of A Markov process has the following transition...

Question 17

For the following transition matrices, determine the transient or absorbing states. $$\left| \begin{array} { l l l l } 
0 & 0 & 2 / 3 & 1 / 3 \
0 & 1 & 0 & 0 \
3 / 4 & 1 / 4 & 0 & 0 \
1 & 0 & 0 & 0
\end{array} \right|$$

Accepted Answer

State 2 is

Question 18

The ________ is the probability of moving from one state to another during one time period.

Accepted Answer

A)  transition probability 
B)  state of the system 
C)  steady-state probabilities 
D)  transition matrix 
A)  transition probability 
B)  state of the system 
C)  steady-state probabilities 
D)  transition matrix

Question 19

A transition matrix cannot cause the system to cycle between states.

Accepted Answer

A) True 
 B)False

Question 20

Although information from Markov analysis can be obtained using a ________, it is time-consuming and cumbersome.

Accepted Answer

The answer of Although information from Markov analysis can be...

Markov analysis provides a recommended decision.

Markov analysis is not a descriptive technique that results in probabilistic information.

The brand-switching problem analyzes the probability of customers' changing brands of a product over time.

A Markov assumption is that the probabilities are constant over time.

Markov analysis is a descriptive technique that results in probabilistic information.

A Markov assumption is that the probabilities ________ over time.

Markov analysis can be used to determine the steady state probabilities associated with machine breakdowns.

The probability of ending up in a state in the future is ________ of the starting state.

In certain applications, the transition matrix may first need to be divided into submatrices. The identity matrix, I, and matrix Q (the nonabsorbing matrix) are then used to determine the ________ matrix.

Markov analysis is not a probabilistic technique.

For the following transition matrices, what is the absorbing state(s)? $\left| \begin{array} { l l l l } 0 & 0 & 2 / 3 & 1 / 3 \\0 & 1 & 0 & 0 \\3 / 4 & 1 / 4 & 0 & 0 \\1 & 0 & 0 & 0\end{array} \right|$

A Markov process has the following transition matrix: A 0.25 0.75 B 0.60 0.40 What are the steady state probabilities?

For the following transition matrices, determine the transient or absorbing states. $\left| \begin{array} { l l l l } 0 & 0 & 2 / 3 & 1 / 3 \\0 & 1 & 0 & 0 \\3 / 4 & 1 / 4 & 0 & 0 \\1 & 0 & 0 & 0\end{array} \right|$

The ________ is the probability of moving from one state to another during one time period.

A transition matrix cannot cause the system to cycle between states.

Although information from Markov analysis can be obtained using a ________, it is time-consuming and cumbersome.

Management Science

Linear Programming: Model Formulation and Graphical Solution

Linear Programming: Computer Solution and Sensitivity Analysis

Linear Programming: Modeling Examples

Integer Programming

Transportation, Transshipment, and Assignment Problems

Network Flow Models

Project Management

Multicriteria Decision Making

Nonlinear Programming

Probability and Statistics

Decision Analysis

Queuing Analysis

Simulation

Forecasting

Inventory Management

the Simplex Solution Method

Transportation and Assignment Solution Methods

Integer Programming: the Branch and Bound Method

Nonlinear Programming: Solution Techniques

Game Theory

Filters

Exam 22: Markov Analysis

Markov analysis provides a recommended decision.

Markov analysis is not a descriptive technique that results in probabilistic information.

The brand-switching problem analyzes the probability of customers' changing brands of a product over time.

A Markov assumption is that the probabilities are constant over time.

Markov analysis is a descriptive technique that results in probabilistic information.

A Markov assumption is that the probabilities ________ over time.

Markov analysis can be used to determine the steady state probabilities associated with machine breakdowns.

The probability of ending up in a state in the future is ________ of the starting state.

In certain applications, the transition matrix may first need to be divided into submatrices. The identity matrix, I, and matrix Q (the nonabsorbing matrix) are then used to determine the ________ matrix.

Markov analysis is not a probabilistic technique.

For the following transition matrices, what is the absorbing state(s)? ∣002/31/301003/41/4001000∣\left| \begin{array} { l l l l } 0 & 0 & 2 / 3 & 1 / 3 \\0 & 1 & 0 & 0 \\3 / 4 & 1 / 4 & 0 & 0 \\1 & 0 & 0 & 0\end{array} \right|​003/41​011/40​2/3000​1/3000​​

A Markov process has the following transition matrix: A 0.25 0.75 B 0.60 0.40 What are the steady state probabilities?

For the following transition matrices, determine the transient or absorbing states. ∣002/31/301003/41/4001000∣\left| \begin{array} { l l l l } 0 & 0 & 2 / 3 & 1 / 3 \\0 & 1 & 0 & 0 \\3 / 4 & 1 / 4 & 0 & 0 \\1 & 0 & 0 & 0\end{array} \right|​003/41​011/40​2/3000​1/3000​​

The ________ is the probability of moving from one state to another during one time period.

A transition matrix cannot cause the system to cycle between states.

Although information from Markov analysis can be obtained using a ________, it is time-consuming and cumbersome.

Management Science

Linear Programming: Model Formulation and Graphical Solution

Linear Programming: Computer Solution and Sensitivity Analysis

Linear Programming: Modeling Examples

Integer Programming

Transportation, Transshipment, and Assignment Problems

Network Flow Models

Project Management

Multicriteria Decision Making

Nonlinear Programming

Probability and Statistics

Decision Analysis

Queuing Analysis

Simulation

Forecasting

Inventory Management

the Simplex Solution Method

Transportation and Assignment Solution Methods

Integer Programming: the Branch and Bound Method

Nonlinear Programming: Solution Techniques

Game Theory

Filters

For the following transition matrices, what is the absorbing state(s)? $\left| \begin{array} { l l l l } 0 & 0 & 2 / 3 & 1 / 3 \\0 & 1 & 0 & 0 \\3 / 4 & 1 / 4 & 0 & 0 \\1 & 0 & 0 & 0\end{array} \right|$

For the following transition matrices, determine the transient or absorbing states. $\left| \begin{array} { l l l l } 0 & 0 & 2 / 3 & 1 / 3 \\0 & 1 & 0 & 0 \\3 / 4 & 1 / 4 & 0 & 0 \\1 & 0 & 0 & 0\end{array} \right|$