Operations Research – Question Bank

Part A: Multiple Choice Questions (MCQs)

a) Financial accounting b) Personal counseling c) Decision making and problem-solving

d) Product promotion

Answer: c

2. The origin of Operations Research can be traced back to:

a) World War I b) World War II c) The Industrial Revolution d) The Cold War era

Answer: b

3. The main limitation of OR is:

a) It always provides the best solution b) It is applicable only in engineering

c) It requires simplified assumptions d) It uses non-mathematical models

Answer: c

4. Which of the following is NOT a type of programming in OR?

a) Linear programming b) Integer programming c) Quantum programming d) Goal programming

Answer: c

5. Linear Programming problems assume:

a) Constant returns to scale b) Non-linear relationships c) Random decision-making

d) Probabilistic constraints

Answer: a

6. The graphical method of solving LPP is applicable to:

a) Only one variable b) Two variables c) Three variables d) Any number of variables

Answer: b

7. In graphical LPP, an unbounded solution implies:

a) No solution exists b) Infinite number of optimal solutions

c) Objective function can increase indefinitely d) The feasible region is empty

Answer: c
8. The Simplex method is used to

a) Formulate LPP b) Solve LPP with two variables only

c) Solve LPP with more than two variables d) Identify non-feasible solutions

Answer: c

9. In Simplex Method, degeneracy occurs when:6

a) There is no optimal solution b) Two or more basic variables are zero

c) A basic variable becomes negative d) The feasible region is circular

Answer: b

10. Goal Programming is mainly used when:

a) There is a single objective b) No objective exists

c) Multiple conflicting objectives exist d) Only linear constraints are allowed

Answer: c

11. The assumptions of LPP include:

a) Nonlinearity b) Dynamic constraints c) Additivity and Proportionality d) Fixed outputs

Answer: c

12. In LPP, a constraint represents:

a) The objective b) A restriction c) A variable d) A result

Answer: b

13. Integer Programming differs from Linear Programming in that:

a) It does not use variables b) It uses only decimal values

c) The solution must be whole numbers d) It ignores constraints

Answer: c

14. A feasible solution in LPP must satisfy:

a) Only the objective function b) All constraints c) The graphical area only d) Integer
requirements

Answer: b

15. The Simplex method works by:

a) Drawing graphs b) Solving algebraically only c) Iteratively improving the solution

d) Estimating optimality

Answer: c
16. A non-feasible solution is one that:

a) Gives maximum profit b) Satisfies all constraints c) Violates at least one constraint

d) Uses a linear model

Answer: c

17. Which of the following problems can OR solve?

a) Personal life planning b) Scientific research c) Managerial decision-making d) Emotional decisions

Answer: c

18. The objective function in LPP is:

a) Always nonlinear b) Used to restrict decisions c) Maximized or minimized d) Ignored in the solution

Answer: c

19. Dynamic Programming solves problems by:

a) Using constant steps b) Forward and backward recursion c) Random iterations

d) Isolated decisions

Answer: b

20. Optimality in Simplex method is achieved when:

a) All artificial variables are zero b) All C - Z values are zero or negative

c) No constraints remain d) The solution has negative values

Answer: b

21. An infeasible solution means:

a) It optimizes the result b) It satisfies all constraints

c) It violates one or more constraints d) It is the best outcome

Answer: c

22. Slack variables are used to convert:

a) Inequalities to equalities b) Objectives to constraints c) Variables to constants

d) Constants to variables

Answer: a

23. The feasible region in LPP is always:

a) A point b) An empty set c) A convex set d) A circle

Answer: c
24. The term “multi-objective programming” is associated with:

a) One goal only b) No goals c) Conflicting goals d) Random priorities

Answer: c

25. Degeneracy can lead to:

a) Multiple feasible solutions b) Looping in the Simplex method

c) An optimal result d) No objective value

Answer: b

Part B: Fill in the Blanks

Answer: scientific

27. The term "Operations Research" was first coined in ___________.

Answer: World War II

28. The ___________ method is used to solve LPPs involving more than two variables.

Answer: Simplex

29. In the Simplex method, the first solution is obtained using a ___________ solution.

Answer: basic feasible

30. A solution is said to be ___________ if it satisfies all the constraints of the LPP.

Answer: feasible

31. The ___________ condition ensures that no better solution exists in the feasible region.

Answer: optimality

32. Integer Programming problems restrict decision variables to take only ___________ values.

Answer: integer

33. Dynamic Programming solves problems by breaking them into ___________ sub-problems.

Answer: smaller

34. Goal Programming is used to handle problems with ___________ objectives.

Answer: multiple

35. OR techniques provide tools to improve ___________ effectiveness in management.

Answer: decision-making

36. In LPP, the area that satisfies all constraints is called the ___________ region.

Answer: feasible

37. A ___________ problem has no solution that satisfies all constraints.

Answer: infeasible
38. The ___________ function defines what needs to be maximized or minimized in LPP.

Answer: objective

39. In the graphical method, the ___________ of the feasible region usually gives the optimal solution.

Answer: corner point

40. Non-linear programming deals with problems having ___________ relationships.

Answer: non-linear

41. The Simplex method continues iterations until all ___________ values are non-positive.

Answer: C - Z

42. Degeneracy occurs when the value of a basic variable is ___________.

Answer: zero

43. In OR, models are ___________ representations of real problems.

Answer: mathematical

44. The ___________ variable enters the basis during a Simplex iteration.

Answer: entering

45. Allocation models help in ___________ resource distribution.

Answer: optimal

46. Slack variables are added to convert ___________ constraints into equalities.

Answer: less than or equal to

47. A surplus variable is subtracted to convert ___________ constraints.

Answer: greater than or equal to

48. In Simplex method, the variable leaving the basis is called the ___________ variable.

Answer: departing

49. Multi-objective problems are solved using ___________ programming techniques.

Answer: goal

50. The ___________ method is not suitable for solving non-linear programming problems.

Answer: Simplex