ExamVeda
Login
Home

Operations Research or Qualitative Approach MCQ Questions and Solutions with Explanations | Management

Operations Research or Qualitative Approach MCQ Questions and answers with easy and logical explanations. Management provides you all type of quantitative and competitive aptitude mcq questions with easy and logical explanations. Operations Research or Qualitative Approach MCQ is important for exams like MAT, CAT, CA, CS, CMA, CPA, CFA, UPSC, Banking and other Management department exam. Page-6 section-2

Each section contains 100 MCQs on Operations Research .
51
In a matrix of transition probability, the element aij where i=j is a.
Discuss
Answer & Solution
Answer: Option C
Solution:
In a matrix of transition probability, the element aij where i=j is a retention.
52
In Markov analysis, state probabilities must.
Discuss
Answer & Solution
Answer: Option A
Solution:
In Markov analysis, state probabilities must sum to one. Markov assumptions: (1) the probabilities of moving from a state to all others sum to one, (2) the probabilities apply to all system participants, and (3) the probabilities are constant over time.
53
State transition probabilities in the Markov chain should.
Discuss
Answer & Solution
Answer: Option A
No explanation is given for this question. Let's Discuss on Board
54
If a matrix of transition probability is of the order n*n, then the number of equilibrium equations would be.
Discuss
Answer & Solution
Answer: Option A
Solution:
If a matrix of transition probability is of the order n*n, then the number of equilibrium equations would be n.
55
In the long run, the state probabilities become 0 & 1.
Discuss
Answer & Solution
Answer: Option C
Solution:
In the long run, the state probabilities become 0 & 1 in all cases.
56
While calculating equilibrium probabilities for a Markov process, it is assumed that?
Discuss
Answer & Solution
Answer: Option B
Solution:
While calculating equilibrium probabilities for a Markov process, it is assumed that transition probabilities do not change. Markov Analysis is a method used to forecast the value of a variable whose future value is influenced only by its current position or state, not by any prior activity that led the variable to its current position or state.
57
The first-order Markov chain is generally used when.
Discuss
Answer & Solution
Answer: Option A
Solution:
The first-order Markov chain is generally used when transition probabilities are fairly stable. The first order Markov chain transition probability is the conditional probability that the second amino acid occurs in a two-amino-acid sequence, given the occurrence of the first amino acid, ie P(second amino acid|first amino acid).
58
A problem is classified as Markov chain provided.
Discuss
Answer & Solution
Answer: Option D
Solution:
A problem is classified as Markov chain provided are there are finite number of possible states, States are collectively exhaustive & mutually exclusive and Long-run probabilities of being in a particular state will be constant over time.
59
The transition matrix elements remain positive from one point to the next. This property is known as:
Discuss
Answer & Solution
Answer: Option C
Solution:
The transition matrix elements remain positive from one point to the next. This property is known as Regular property. A transition matrix (stochastic matrix) is said to be regular if some power of T has all positive entries.
60
Markov analysis is useful for:
Discuss
Answer & Solution
Answer: Option C
Solution:
Markov analysis is useful for Predicting the state of the system at some future time and Calculating transition probabilities at some future time.