Top 150+ Solved Operations Research MCQ Questions Answer
Q. The region of feasible solution in LPP graphical method is called region
a. infeasible
b. infinite
c. unbounded
d. feasible
Q. When the constraints are a mix of ‘less than’ and ‘greater than’ it is a problem having .
a. multiple constraints
b. infinite constraints
c. infeasible constraints
d. mixed constraints
Q. The outgoing variable row in the simplex algorithm is called .
a. outgoing row
b. key row
c. interchanging row
d. basic row
Q. A resource which is partially utilized is called in simplex.
a. null resource
b. scarce resource
c. abundant resource
d. zero resource
Q. The value of one extra unit of resource is called in simplex.
a. unit price
b. extra price
c. retail price
d. shadow price
Q. In simplex, a maximization problem is optimal when all Delta J, i.e. Cj – Zj values are .
a. either zero or positive
b. either zero or negative
c. only positive
d. only negative
Q. In a transportation problem, the method of penalties is called method.
a. vogel’s approximat ion method
b. nwcr
c. lcm
d. modi
Q. When there is a degeneracy in the transportation problem, we add an imaginary allocation called in the solution.
a. dummy
b. penalty
c. regret
d. epsilon
Q. If M + N – 1 = Number of allocations in transportation, it means . (Where ‘M’ is number of rows and ‘N’ is number of columns)
a. there is no degeneracy
b. degeneracy exists
c. solution is optimum
d. problem is balanced
Q. An activity whose start or end cannot be delayed without affecting total project completion time is called activity.
a. dummy
b. non-critical
c. important
d. critical
Q. Floats for critical activities will be always be .
a. one
b. zero
c. highest
d. equal to duration
Q. The shortest possible completion time of an activity in PERT is called time.
a. optimistic
b. pessimistic
c. expected
d. most likely
Q. The total time required to complete all the jobs in a job sequencing problem is known as .
a. processing time
b. waiting time
c. elapsed time
d. idle time
Q. The outcome of the interaction of selected strategies of opponents in a game is called .
a. income
b. profit
c. payoff
d. gains