4. Every correct answer carries 2 marks.

5. There is no negative marking.

6. The time allowed for every question is 50 seconds.

7. Questions cannot be passed.

8. Any queries will be entertained only after the quiz is over.There is a bonus round in the end which may be held depending on availability of time. The rules will be disclosed at that point of time only.

9. Round 1

10. Question 1. The method in which we find the corner points of the feasible region graphically and then compute the profit at each of these points to find the optimal solution is called as _____________ ? Iso-profit line method A End-point method B Corner point method C Edge solution method D

11. Question 2. A measurable input quantity that is inherent in the problem is known as __________ ? Assumption A Model B Constraint C Parameter D

12. Question 3. A transportation problem can be solved by : Simplex method Transportation method iii. Multiple optimal method ii. only A i. & ii. only B ii. & iii. only C All of the above D

13. Question 4. A LPP has a bounded feasible region. If this problem has an equality(=) constraint then This must be a minimization problem A The feasible region must consist of a line segment B The problem must be degenerate C The problem must have more then one optimal solution D

14. Question 5. If a particular constraint doesn’t affect the feasible region, then it is called as a __________ ? Redundant constraint A Zero-value constraint B Dummy constraint C It cannot be considered as a constraint D

15. Question 6. Which of the following are the methods used for solving Operations Research models ? Analytical procedures A Iterative procedures B Monte-Carlo Techniques C All of these D

16. Question 7. In a transportation problem every loop has _______ ? Even number of cells A Odd number of cells B Either even or odd number of cells C Inadequate data D

17. Question 8. Estimating election results before actually the counting is completed represents which kind of model ? Iconic model A Dynamic model B Predictive model C Prescriptive model D

18. Round 2

19. Question 1. In which of the following situations Operations Research can be used ? Transportation loading and unloading A Cash flow planning B Both of these C None of these D

20. Question 2. In LP, variables do not have to be integer valued and may take on any fractional value. This assumption is called __________ ? Proportionality A Divisibility B Additivity C Certainty D

21. Question 3. Which of the following is a physical model in Operations Research Methodology ? Analogue model A Symbolic model B Deterministic model C Probabilistic model D

22. Question 4. Having more than 1 optimal solution __________ . Provide management with greater flexibility in using resources A Create confusion as in which solution to select B Doesn’t affect at all C Both A & B D

23. Question 5. Which model came into existence due to difficulty in representing more than three variables graphically? ? Analogue A Iconic B Symbolic C Physical D

24. Question 6. Which of this is not a phase of operation Research in Scientific Methodology? Operation phase A Research phase B Action phase C Judgment phase D

25. Question 7. Per unit contribution of a variable in the objective function is independent of the size of the variable. This property is known as _______ ? Deterministic A Automotiveness B Proportionality C Rationality D

26. Question 8. A model of a proposed building provided by an architect is an example of ____________ model ? Analogue model A Physical model B Symbolic model C None of the above D

27. Round 3

28. Question 1. Post optimality analysis is also known as ______________ ? Quantitative A Sensitivity B Deterministic C None of the above D

29. Question 2. The dummy source or destination in a Transportation problem is added to ____________ ? Satisfy rim condition A Ensure Transportation cost doesn’t exceed a limit B Prevent solution from becoming degenerate C To select the shadow price D

30. Question 3. A constraint is termed as ___________ if the LHS and RHS of it remains equal when the optimal value of the decision variables are substituted into the constraints . Redundant constraint A Non-redundant constraint B Non-binding constraint C Binding constraint D

31. Question 4. Non-negativity condition is an important component of LP model because ____________ ? Variable value must remain under the control of decision maker A Value of variables make sense & correspond to real world problem B Variables are inter related in terms of limited resources C Value of variables remain unchanged D

32. Question 5. Which variable is also termed as dependant variable and which is beyond the control of the decision maker ? Decision variable A Uncontrollable variable B Result variable C None of the above D

33. Question 6. If two constraints do not intersect in the positive quadrant of the graph, then ________________ ? The problem is feasible A The solution is unbounded B One of the constraints is redundant C None of these D

34. Question 7. A transportation problem has __________ basis ? Linear A Quadratic B Triangular C Both A & C D

35. Question 8. If in a LP solution, the no. of simultaneous linear equation is ‘m’ and the no. of non-negative variables is ‘n’ , then the maximum no. of corner points is ________ ? mPn A nPm B mCn C nCm D

36. Round 4

37. Question 1. Shadow price is ___________________________ ? Price that is paid for purchase of resources A The saving made by eliminating excess quantity of resources B Increase in obj. funcn value by providing one additional unit of resource C The difference in value between a feasible solution and optimal solution D

38. Question 2. The role of artificial variables in the simplex method is _______? To aid in finding initial soln. & start phases of simplex method A To find optimal dual prices in the final simplex table B Both of the above C None of the above D

39. Question 3. The objective function is parallel to a constraint that forms an edge or boundary on the feasible region, this property is known as ____________ ? Multiple optimality A Redundancy B Pre-emptiveness C Infeasibility D

40. Question 4. A non-optimal solution cannot be improved by ___________ ? A Selecting variable with largest Dj(net profit) for maximization and min Dj for minimization Selecting the variable with most non +ve replacement ratio as the outgoing variable B Obtaining a new simplex table C Selecting the variable in the optimality range tending to 0 D

41. Question 5. For a maximization type of LPP, ____ property occurs where there is no constraint on the solution so that one or more of the decision variable can be increased indefinitely without violating any of the restrictions(constraints). Un-boundedness A Infeasibility B Multiple optimality C Extensiveness D

42. Question 6. Which of the following is not a limitation of Operation Research ? Magnitude of computation A Non-quantifiable factors B Money and time costs C Decision making D

43. Question 7. If a negative value appears in the solution values(Xb) column of the simplex table then , The solution is optimal A The solution is infeasible B The solution is unbalanced C All of these D

44. Question 8. A constraint in an LP model becomes redundant because ______ Two iso-profit lines may be parallel to each other A The solution is unbounded B The constraint is not satisfied by the solution value C All of these D

45. Round 5

46. Question 1. The cutting plane method is designed for ____________ ? Developing another simplex algorithm that combines the primal & dual simplex methods A Solving zero-one programming problems B Eliminating integer optimal solutions from the feasible space of linear programming problems C Eliminating non-integer optimal solutions from the feasible space of linear programming problems D

47. Question 2. If a problem has multiple objectives we should use which of the following methodologies ? Dynamic programming A Orthogonal programming B Multiplex programming C Goal programming D

48. Question 3. If a problem is best solved in stages or time frames, we should use which of the following methodologies ? Temporal programming A Genetic programming B Dynamic programming C Integer programming D

49. Question 4. When an artificial variable is positive, it reverses the direction of the inequality in certain constraints. This solution of LPP is called Semi-feasible solution A Pseudo-optimal solution B Pseudo-feasible solution C Optimized solution D

50. Question 5. If we insist on obtaining only integer values of the decision variables, the problem is called ___________ ? Linear programming problem A Integer programming problem B Non-linear programming problem C Restricted programming problem D

51. Question 6. A solution is said to be degenerate _____________ ? If some basic variable(s) has a solution value equal to zero A If some non-basic variable(s) has a solution value equal to zero B If all basic variable (s) has a solution value equal to zero C If all non-basic variable(s) has a solution value equal to zero D

52. Question 7. The method for dealing with linear programming problems involving artificial variables is _________ ? Two-phase method A Single-phase method B Big-L method C Auxiliary method D

53. Question 8. If two points are selected in the region and the line segment formed by joining these two points lies completely in this region, then it represents __________ . Non-convex set A Non-continuous set B Continuous set C Convex set D

54. Round 6

55. Question 1. An assignment problem is which form of transportation problem ? Degenerated A Non-degenerated B Un-bounded C Basic form D

56. Question 2. ____________ may involve decisions under certainty or uncertainty , under static or dynamic conditions and against nature or some rational opponents? Operations research A Quantitative analysis B Decision making C None of the above D

57. Question 3. While plotting constants on a graph paper, terminal points on both the axes are connected by a straight line because _____ ? The resources are limited in supply A The objective function is a linear function B The constants are linear equations or inequalities C All of the above D

58. Question 4. For a set of ‘m’ equation in ‘n’ variables(n>m), a solution obtained by setting (n-m) variables equal to zero and solving for remaining m equations in n variables is called as ________ ? Non-feasible solution A Basic feasible solution B Feasible solution C Basic solution D

59. Question 5. Risk and payback period is considered to be______________ in a particular problem? Variables A Objective B Constraints C None of the above D

60. Question 6. ________ is a war against ad-hocism ? Deterministic model A Qualitative techniques B Operational Research C All of the above D

61. Question 7. A model in Operations research is ___________ ? An essence of reality A An approximation B An idealization C All of the above D

62. Question 8. Which of the following is not a feature of Operations research ? Inter-disciplinary team approach A Holistic approach to the system B Use of scientific research C Perfectness of solution D

63. Bonus Round

65. If you answer the question correctly within 60 seconds, you get 3 marks

66. You can take additional 30 seconds(total 90 seconds) to answer the question but a correct answer will fetch only 2 marks.

67. A wrong answer will attract a penalty of -1 in any case.

68. Unanswered questions are passable to the next group.

70. Question 2. What is a drawback of analogue model used in operation research? Unreliable & ungenuine A Less specific & concrete B All of the above C None of the above D

71. Question 3. Which of the following is not a correct closed loop ? B. A. D. C.

72. Question 4. Which of the following is an important characteristics for assignment problem but not for transportation problem ? The pay off matrix for the problem should be a square A The optimal solution contains only one assignment in a given row or column of the pay off matrix B All of the above C None of the above D

73. Question 5. A feasible solution to a transportation problem is basic _____ ? If the corresponding cells in a transportation table contain a loop A If & only if corresponding cells in transportation table don’t contain loop B Data inadequate C If the cells do not contain a loop D

74. Question 6. The feasible region represented by the constraints : x1+ x2 <= 1 , 3x1+ x2 >= 3 , x1,x2 >= 0 for the obj. function Z=x1+2x2is: A singleton set A Unbounded set B Empty set C A polygon D

75. Question 7. Special purpose algorithm developed for the transportation application are important because __________ Computation time is comparatively very less Requires less computer memory iii. Produce integer solution i only A i. & iii. only B i. & ii. only C i. & ii. & iii. D

76. Question 8. In LP, parameter (input data) of the model can change within certain limits without causing the optimum solution to change. This is referred to as ______? Certainty A Variation B Sensitivity analysis C Feasibility range D