Operations Research MCQs

✅ The correct answer is option B.
In LPP, degeneracy occurs in two stages. Degeneracy in a linear programming problem is said to occur when a basic feasible solution contains a smaller number of non-zero variables than the number of independent constraints when values of some basic variables are zero and the Replacement ratio is same.

✅ The correct answer is option D.
Operations Research techniques helps the directing authority in optimum allocation of various limited resources, such as Men and Machine, Money and Material and Time.

✅ The correct answer is option A.
A BFS of a LPP is said to be degenerate if at least one of the basic variable is zero. A basic feasible solution is called degenerate if value of at least one basic variable is zero.

✅ The correct answer is option D.
The purpose of using simulation technique is to Imitate a real-world situation, Understand properties & operating characteristics of complex real-life problems and Reduce the cost of experiment on a model of real situation.

✅ The correct answer is option A.
Service mechanism in a queuing system is characterized by Server’s behavior. Queuing theory is the mathematical study of the delays of waiting in line, covering all aspects, from arrival time to the number of servers.

✅ The correct answer is option D.
Simulation is defined as a technique that uses computers, An approach for reproducing the processes by which events by chance & changes are created in a computer and A procedure for testing & experimenting on models to answer what if ___, then so & so ___ types of questions.

✅ The correct answer is option B.
All the parameters in the linear programming model are assumed to be Constraints. For a problem to be a linear programming problem, the decision variables, objective function and constraints all have to be linear functions. If the all the three conditions are satisfied, it is called a Linear Programming Problem.

✅ The correct answer is option D.
The problem must be of minimization type is not a characteristic of the LP. The objective of linear programming is to: “maximize or to minimize some numerical value.

✅ The correct answer is option A.
In maximization cases, +m are assigned to the artificial variables as their coefficients in the objective function. There may be situation when the assignment problem calls for maximization of profit.
Such problem can be solved by converting the given maximization problem into minimization problem by substracting all the elements of the given matrix from the highest element.

✅ The correct answer is option A.
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.