Top 150+ Solved Operations Research MCQ Questions Answer
Q. To make an unbalanced assignment problem balanced, what are added with all entriesas zeroes?
a. Dummy rows
b. Dummy columns
c. Both A and B
d. Dummy entries
Q. In which phase is optimization done and how does that phase also checks foroptimality conditions?
a. Phase II
b. Phase I
c. Phase II
d. None of the above
Q. State which of the two statements is correct(i) the cells in the transportation table can be classified in to occupied cells and unoccupied cells (ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost
a. both (i) and (ii) are correct
b. Two only
c. One only
d. Both (i) and (ii) are incorrect
Q. When the total of allocations of a transportation problem match with supply and demand values, the solution is called solution.
a. infeasible solution
b. feasible solution
c. optimum solution
d. degenerate solution
Q. When the allocations of a transportation problem satisfy the rim condition (m + n – 1) the solution is called
a. infeasible solution
b. feasible solution
c. non degenerate solution
d. degenerate solution
Q. If the number of rows and columns in an assignment problem are not equal than it is called problem.
a. balanced
b. unbalanced
c. infeasible
d. unbounded
Q. The method used for solving an assignment problem is called method.
a. vam
b. nwcr
c. modi
d. hungarian
Q. When a maximization assignment problem is converted in minimization problem, the resulting matrix is called matrix.
a. cost
b. regret
c. profit
d. dummy
Q. The longest path in the network diagram is called path
a. critical
b. sub-critical
c. best
d. worst
Q. Backward pass calculations are done to find occurrence times of events.
a. tentative
b. definite
c. latest
d. earliest
Q. The order in which machines are required for completing the jobs is called
a. machines order
b. job order
c. processing order
d. working order
Q. The time during which a machine remains waiting or vacant in sequencing problem is called time.
a. processing
b. waiting
c. free
d. idle
Q. In linear programming represents mathematical equation of the limitations imposed by the problem.
a. objective function
b. decision variables
c. constraints
d. opportunity cost
Q. The type of constraint which specifies maximum capacity of a resource is ‘or equal to’ constraint.
a. less than
b. greater than
c. not greater than
d. not less than