FR200

1. Use of _______ has become an 9. OR actually is a synonym for ________

integral part of the operations research (a) Scientific
approach to decision making (b) Mathematical
(a) Digital computer (c) Management Science
(b) Calculator (d) Both (a) & (b)
(c) Machinery 10. This model deals with the problem of
(d) Both (a) and (b) determination of how much to order at
2. Operation Research emphasizes on the a point in time and when to place an
over all approach of the order
(a) Management (a) Queuing model
(b) System (b) Inventory model
(c) Organization (c) Allocation model
(d) Departments (d) Game model
3. OR involves scientific and systematic 11. The model that is used to characterize
study of complex problems to arrive at the behavior of two or more opponents
the optimum called players is the
(a) Level (a) Waiting time
(b) Solution (b) Inventory model
(c) Result (c) Allocation model
(d) Conclusion (d) Game model
4. There are _______phases of operation 12. The model that is applied to the
research management of large scale projects
(a) 3 (a) Game theory
(b) 4 (b) Network models
(c) 2 (c) Inventory models
(d) 6 (d) Allocation models
5. Determination of the operation belongs 13. It may be considered mathematical
to the phase programming and involves the
(a) Judgement optimization of multistage decision
(b) Research processes
(c) Action (a) Replacement model
(d) Verification (b) Simulation models
6. Formulation of relevant hypothesis and (c) Dynamic programming model
models belongs to the phase of (d) Sequencing model
(a) Judgment 14. OR approach to problem solving
(b) Research consists of the
(c) Action (a) 5 Steps
(d) verification (b) 6 Steps
7. Recommendation for decision process (c) 7 Steps
belongs to the phase of (d) 8 steps
(a) Judgement 15. The concept of liner programming was first
(b) Research introduced by Russian mathematician
(c) Action (a) L. V. Kantrowich
(d) Verification (b) L. M. Kantrowich
8. It literally means choosing from (c) L. V. Dantrowich
available alternative (d) V. L. Kantrowich
(a) Option 16. LP techniques improves the quality of
(b) Decision (a) Products
(c) Result (b) Decisions
(d) Selection (c) Management
(d) Organization

XIX (1)
FR200
17. L.P deals with __________objective 25. A line representing all combinations of
(a) Single x1 & x2 for a particular cost level
(b) Double (a) I.P line
(c) Multiple (b) L.P
(d) None of the above (c) ISO cost line
18. All relationship in LP model must be (d) None of the above
(a) Linear 26. The form linearity implies
(b) Cervical _______among the relevant variable
(a) Curve line
(c) Exponential
(b) Straight line
(d) None of the above (c) Dotted line
19. Economic or physical quantities whose (d) None of the above
numerical values indicate the solution 27. The simplex method was developed in
of L.P problem (a) 1947
(a) Feasible selection (b) 1945
(b) Decision variable (c) 1950
(c) Constraint (d) 1942
(d) None of the above 28. In one dimension a simplex is a line
20. A basic feasible solution is called segment connecting ____points
degenerate of value of at least one (a) 3
basic variable is (b) 2
(a) 0 (c) 4
(b) 1 (d) 1
(c) 2 29. The variable that represents the
(d) 3 amount by which solution values
21. Ax=b, x-0 is a convex polyhedron exceed a resource
(a) Stack variable
(a)
(b) Surplus variable
(b) (c) Artificial variable
(c) > (d) None of the above
(d) = 30. The identity matrix is also called a
22. An_______ is a collection of points (a) Basic matrix
which designate solution with same (b) Simple matrix
value of objective function (c) Variable matrix
(a) L.P (d) none of above
(b) ISO profit 31. The concept of simplex method is
(c) Q.P similar to the ________ method
(d) None of the above (a) Systematic
23. The condition when the objective of a (b) Graphical
L.P problem can be made infinitely (c) Linear
large without isolating any of the (d) Optimal
constraints 32. A surplus of variable is subtracted and
(a) Redundancy artificial is added in constraint of
(b) Infeasible (a) () type
(c) Unboundedness (b) () type
(d) Multiple selection (c) (=) type
24. Unboundness describes a L.P problem (d) (<) type
33. Since the selection of L.P problem Is
that do not have
completed in two phase this is called a
(a) Infinite solution (a) Three phase method
(b) Finite solution (b) Two phase method
(c) Feasible solution (c) M- method
(d) Non feasible solution (d) None of the above

XIX (2)
 FR200
34. The big M-method is another method 42. The simplest of the procedures used to
of removing ________variables from generate an initial feasible selection is
the basis (a) L.P model
(a) Stack (b) NWCM
(b) Surplus (c) VAM
(c) Artificial (d) Lowest cost entry method
(d) None of the above 43. Each allocation is made an made on
35. The alternative optimal solution can be the basis of opportunity cost called
obtained by considering the (a) NWCM
_______row of simplex table (b) VAM
(a) Cj-Zj (c) L.P method
(b) Cj+Zj (d) Lowest cost method
(c) Cj>Zj 44. An ordered four cells in a
(d) Cj<Zj transportation table is said to form a
36. The original L.P problem is a (a) Transportation cost
(a) Dual problem (b) Transportation route
(b) Primal problem (c) Loop provided
(c) Single problem (d) None of the above
(d) None of the above 45. Which of the following is not the
37. If primal constraints < type then dual method to obtain an initial solution
constraints is (a) East - West corner rule
(a) () type (b) North -West corner rule
(b) (=) type (c) Lowest cost entry method
(c) (<) type (d) VAM
(d) None of the above 46. An even number of at least four cells
38. The transportation model is an must participate in
important example of a network (a) Open loop
optimization (b) Side loop
(a) Selection (c) Parallel loop
(b) Problem (d) Closed loop
(c) Result 47. An assignment problem can be solved
(d) Decision by_____ methods
39. LP plays an important role in an (a) 4
economy and managerial (b) 5
_________making (c) 3
(a) Result (d) 6
(b) Merit 48. In this method a list of all possible
(c) Demerit assignment among the given resource
(d) Decision and activities is prepaid
40. Each source has one row and each (a) Simplex method
____has one column (b) Enumeration method
(a) Destination (c) Transportation method
(b) Caution (d) Hungarian method
(c) Station 49. It works on the principle of reducing
(d) None of above the given cost matrix to a matrix of
41. The capacities and demands are opportunity cost
known as (a) Simplex method
(a) Num conditions (b) Transportation method
(b) Rim conditions (c) Hungarian method
(c) Win conditions (d) Enumeration
(d) Both (a) & (b)

XIX (3)
FR200
50. When the given cost matrix is not a 58. The maximum element in each column
square matrix the assignment is of pay off matrix is called
problem is called (a) Row minimum
(a) Balance problem (b) Column minimum
(b) Unbalanced problem (c) Row maxima
(c) Feasible problem (d) Column maxima
59. The pay off amount in the saddle point
(d) Non-feasible problem
position is also called
51. The cost element in dummy cells are (a) Value of game
always (b) Game plan
(a) Zero (c) Game work
(b) Infinity (d) Name of the above
(c) Two 60. To reduce the size of pay off matrix
(d) Three refers the rule of
52. The costs that are associated with a (a) Saddle port
sacrificed opportunity in order to make (b) Game value
a particular decision (c) Dominance
(a) Social cost (d) Pay off
(b) Explicit cost 61. Swapping the difference is applied in
(c) Implicit cost (a) Arithmetic method
(d) Opportunity cost (b) Algebraic method
53. Game theory came into existence in the (c) Matrix method
(d) Graphical method
(a) 21st Century
62. If the matrix is in the form of square
(b) 20th Century matrix the optimal Strategies mix may
(c) 19th Century be obtained by
(d) 18th Century (a) Pay-off matrix
54. It is the expected pay off play when all (b) Matrix method
the players of the game follow their (c) Arithmetic method
optimum strategies (d) Graphical method
(a) Pay-off matrix 63. This method is useful for the game when
(b) Strategy the pay off matrix is the size 2xn or mx2
(c) Game plan (a) Matrix method
(d) Value of game (b) Graphical method
55. The pay off in terms of gains or losses, (c) L.P method
when players select their particular (d) Algebraic method
strategies 64. The -two person zero sum games can
(a) Pay off also be solved by
(a) Algebraic method
(b) Pay off matrix
(b) Linear programming
(c) Strategies (c) Graphical method
(d) Value of game (d) Arithmetic method
56. The game is called fair if the value of 65. For a minimization problem in big __ M
game method penalty is designated as
(a) 1 (a) +M
(b) 2 (b) -M
(c) 00 (c) M
(d) 0 (d) None of the above
57. The minimum element in each row of 66. The Erie quality sign is reversed in all
pay off matrix is called the constraints except ______ condition
(a) Minimum (a) Positivity
(b) Row maxima (b) Negativity
(c) Row minima (c) Non positivity
(d) Maximum (d) Non negativity

XIX (4)
 FR200
67. It represent the controlled varieties of 69. T.P develops a schedule at ____
system system
(a) Barometer (a) Minimum
(b) Thermometer (b) Maximum
(c) Parameter (c) Equal
(d) None of the above (d) Optimum
68. Is________ represent a real life system 70. A competitive situation is known as
(a) Square (a) Pay off
(b) Parabola (b) Game
(c) Linear (c) Strategy
(d) Hyperbola (d) Matrix

XIX (5)