Operations Research MCQs

✅ The correct answer is option A.
In a matrix of transition probability, the probability values should add up to one in each row.

✅ The correct answer is option A.
An iso-profit line represents an infinite number of solutions all of which yield the same profit. The graph of the profit function is called an iso-profit line. It is called this because “iso” means “same” or “equal” and the profit anywhere on the line is the same.

✅ The correct answer is option C.
Graphic method can be applied to solve a LPP when there are only two variable. This method is used to solve a two variable linear program. If you have only two decision variables, you should use the graphical method to find the optimal solution. A graphical method involves formulating a set of linear inequalities subject to the constraints. Then the inequalities are plotted on a X-Y plane.

✅ The correct answer is option B.
If one of the constraint of an equation in an LP problem has an unbounded solution, then feasible region should have a line segment. If there is going to be an optimal solution to a linear programming problem, it will occur at one or more corner points, or on a line segment between two corner points.

✅ The correct answer is option D.
To make simulation more popular, we need to avoid Large cost over runs, Prolonged delays and User dissatisfaction with simulation results.

✅ The correct answer is option D.
An advantage of simulation as opposed to optimization is that Several options of measure of performance can be examined, Complex real-life problems can be studied and It is applicable in cases where there is an element of randomness in a system.

✅ The correct answer is option A.
If two constraints do not intersect in the positive quadrant of the graph, then the problem is infeasible.

✅ The correct answer is option D.
A constraint in an LP model restricts value of objective function, value of a decision variable and use of the available resources.

✅ The correct answer is option C.
In the long run, the state probabilities become 0 & 1 in all cases.

✅ The correct answer is option C.
While solving a LP problem, infeasibility may be removed by removing a constraint. A linear program is infeasible if there exists no solution that satisfies all of the constraints in other words, if no feasible solution can be constructed.