Operations Research MCQs [set-1]

1. ________are entities whose value is determined from the solution of LPP

A. objective function
B. decision variable
C. constraints
D. opportunity cost
Answer: A

2. The region of feasible solution in LPP graphical method is called ____

A. infeasible region
B. unbounded region
C. infinite region
D. feasible region
Answer: D

3. The outgoing variable row in the simplex table is called ____

A. outgoing row
B. key row
C. basic row
D. interchanging row
Answer: C

4. When the solution is degenerate in transportation problem, we add a _

A. dummy
B. epsilon
C. penalty
D. regret
Answer: B

5. ______method is used in Assignment Problem

A. ncwr
B. lcm
C. vam
 D. hungarian
Answer: D

6. The longest path in the network diagram is called ____

A. head path
B. sub path
C. critical path
D. sub critical path
Answer: C

7. IF the Minimax are ( 10,18,16) and Maximin are (8,10,7). The saddle point is ___
A. 7
B. 10
C. 18
D. 8
Answer: B

8. Pick the wrong relationship:

A. interfering float = total float – free float
B. total float =free float + independent float
C. total float ? free float ? independent float
D. free float = total float – head event slack
Answer: B

9. The shortest time in the PERT is called ______time

A. expected
B. pessimitic
C. optimistic
D. most likely
Answer: C

10. The total time required to complete all the jobs in a job sequence problem is
known as ______
A. processing order
B. idle time
C. processing time
D. elapsed time
Answer: D
11. Operations Research Models in which values of all variables and all possible
outcomes are known with certainty are called models.
A. physical
B. symbolic
C. deterministic
D. probabilistic
Answer: C

12. Operations Research Models in which some or all variables are random in
nature are called models.
A. physical
B. symbolic
C. deterministic
D. probabilistic
Answer: D

13. and are techniques applied in project management.

A. cpm and pert
B. assignment & transportation
C. game theory
D. decision theory & inventory models
Answer: A

14. are the entities whose values are to be determined from the solution of
the LPP.
A. objective function
B. decision variables
C. constraints
D. opportunity cost
Answer: B

15. specifies the objective or goal of solving the LPP.

A. objective function
B. decision variables
C. constraints
D. opportunity cost
Answer: A
16. _are the restrictions or limitations imposed on the LPP.
A. objective function
B. variables
C. constraints
D. profit
Answer: C

17. When it is not possible to find solution in LPP, it is called as

solution
A. infeasible
B. unbounded
C. improper
D. unknown
Answer: A

18. In case of a ‘ ’ constraint, the feasible region is a straight line.

A. less than or equal to
B. greater than or equal to
C. mixed
D. equal to
Answer: D

19. In linear programming, unbounded solution means solution.

A. infeasible
B. infinite
C. unique
D. degenerate
Answer: B

20. The incoming variable column in the simplex algorithm is called .

A. key column
B. incoming column
C. important column
D. variable column
Answer: A

21. The intersection value of key column and key row is called
 A. vital element
B. important element
C. basic element
D. key element
Answer: D

22. The variable added to the LHS of a less than or equal to constraint to convert it
into equality is called variable.
A. surplus
B. artificial
C. slack
D. additional
Answer: C

23. A resource which is completely utilized is called in simplex

A. null resource
B. scarce resource
C. abundant resource
D. zero resource
Answer: B

24. In simplex, a minimization 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
Answer: A

25. To find initial feasible solution of a transportation problem the method which
starts allocation from the lowest cost is called method
A. vogel’s approximat ion method
B. nwcr
C. lcm
D. modi
Answer: C