Transcript
FR200 1.Use of _______ has become anintegral part of the operations researchapproach to decision making(a)Digital computer (b)Calculator (c)Machinery(d)Both (a) and (b) 2. Operation Research emphasizes on theover all approach of the(a)Management(b)System(c)Organization(d)Departments 3. OR involves scientific and systematicstudy of complex problems to arrive atthe optimum(a)Level(b)Solution(c)Result(d)Conclusion 4. There are _______phases of operationresearch(a)3(b)4(c)2(d)65.Determination of the operation belongsto the phase(a)Judgement(b)Research(c)Action(d)Verification 6. Formulation of relevant hypothesis andmodels belongs to the phase of (a)Judgment(b)Research(c)Action(d)verification 7. Recommendation for decision processbelongs to the phase of (a)Judgement(b)Research(c)Action(d)Verification 8. It literally means choosing fromavailable alternative(a)Option(b)Decision(c)Result(d)Selection 9. OR actually is a synonym for ________ (a)Scientific(b)Mathematical(c)Management Science(d)Both (a) & (b)10.This model deals with the problem of determination of how much to order ata point in time and when to place anorder (a)Queuing model(b)Inventory model(c)Allocation model(d)Game model 11. The model that is used to characterizethe behavior of two or more opponentscalled players is the(a)Waiting time(b)Inventory model(c)Allocation model(d)Game model 12. The model that is applied to themanagement of large scale projects(a)Game theory(b)Network models(c)Inventory models(d)Allocation models13.It may be considered mathematicalprogramming and involves theoptimization of multistage decisionprocesses(a)Replacement model(b)Simulation models(c)Dynamic programming model(d)Sequencing model 14. OR approach to problem solvingconsists of the(a)5 Steps(b)6 Steps(c)7 Steps(d)8 steps 15. The concept of liner programming was firstintroduced by Russian mathematician(a)L. V. Kantrowich(b)L. M. Kantrowich(c)L. V. Dantrowich(d)V. L. Kantrowich16. LP techniques improves the quality of (a)Products(b)Decisions(c)Management(d)Organization XIX (1) FR200 17.L.P deals with __________objective(a)Single(b)Double(c)Multiple(d)None of the above 18. All relationship in LP model must be(a)Linear (b)Cervical(c)Exponential(d)None of the above 19. Economic or physical quantities whosenumerical values indicate the solutionof L.P problem(a)Feasible selection(b)Decision variable(c)Constraint(d)None of the above 20. A basic feasible solution is calleddegenerate of value of at least onebasic variable is(a)0(b)1(c)2(d)3 21. Ax=b, x-0 is a convex polyhedron(a) ≥ (b) ≤ (c)>(d)= 22. An_______ is a collection of pointswhich designate solution with samevalue of objective function(a)L.P(b)ISO profit(c)Q.P(d)None of the above 23. The condition when the objective of aL.P problem can be made infinitelylarge without isolating any of theconstraints(a)Redundancy(b)Infeasible(c)Unboundedness(d)Multiple selection24.Unboundness describes a L.P problemthat do not have(a)Infinite solution(b)Finite solution(c)Feasible solution(d)Non feasible solution25.A line representing all combinations of x1 & x2 for a particular cost level(a)I.P line(b)L.P(c)ISO cost line(d)None of the above 26. The form linearity implies _______among the relevant variable(a)Curve line(b)Straight line(c)Dotted line(d)None of the above27.The simplex method was developed in(a)1947(b)1945(c)1950(d)194228.In one dimension a simplex is a linesegment connecting ____points(a)3(b)2(c)4(d)1 29. The variable that represents theamount by which solution valuesexceed a resource(a)Stack variable(b)Surplus variable(c)Artificial variable(d)None of the above30.The identity matrix is also called a(a)Basic matrix(b)Simple matrix(c)Variable matrix(d)none of above 31. The concept of simplex method issimilar to the ________ method(a)Systematic(b)Graphical(c)Linear (d)Optimal 32. A surplus of variable is subtracted andartificial is added in constraint of (a)( ≥ ) type(b)( ≤ ) type(c)(=) type(d)(<) type 33. Since the selection of L.P problem Iscompleted in two phase this is called a(a)Three phase method(b)Two phase method XIX (2) FR200 (c)M- method(d)None of the above34.The big M-method is another methodof removing ________variables fromthe basis(a)Stack(b)Surplus(c)Artificial(d)None of the above 35. The alternative optimal solution can beobtained by considering the _______row of simplex table(a)Cj-Zj(b)Cj+Zj(c)Cj>Zj(d)Cj<Zj 36. The srcinal L.P problem is a(a)Dual problem(b)Primal problem(c)Single problem(d)None of the above37.If primal constraints < type then dualconstraints is(a) ( ≤ ) type(b)(=) type(c)(<) type(d)None of the above38. The transportation model is animportant example of a networkoptimization(a)Selection(b)Problem(c)Result(d)Decision 39. LP plays an important role in aneconomy and managerial _________making(a)Result(b)Merit(c)Demerit(d)Decision 40. Each source has one row and each ____has one column(a)Destination(b)Caution(c)Station(d)None of above 41. The capacities and demands areknown as(a)Num conditions(b)Rim conditions(c)Win conditions(d)Both (a) & (b) 42. The simplest of the procedures used togenerate an initial feasible selection is(a)L.P model(b)NWCM(c)VAM(d)Lowest cost entry method 43. Each allocation is made an made onthe basis of opportunity cost called(a)NWCM(b)VAM(c)L.P method(d)Lowest cost method 44. An ordered four cells in atransportation table is said to form a(a)Transportation cost(b) Transportation route(c)Loop provided(d)None of the above 45. Which of the following is not themethod to obtain an initial solution(a)East - West corner rule(b)North -West corner rule(c)Lowest cost entry method(d)VAM 46. An even number of at least four cellsmust participate in(a)Open loop(b)Side loop(c)Parallel loop(d)Closed loop 47. An assignment problem can be solvedby_____ methods(a)4(b)5(c)3(d)648. In this method a list of all possibleassignment among the given resourceand activities is prepaid(a)Simplex method(b)Enumeration method(c)Transportation method(d)Hungarian method49. It works on the principle of reducingthe given cost matrix to a matrix of opportunity cost(a)Simplex method(b)Transportation method(c)Hungarian method XIX (3) FR200 (d)Enumeration50.When the given cost matrix is not asquare matrix the assignment isproblem is called(a)Balance problem(b)Unbalanced problem(c)Feasible problem(d)Non-feasible problem51.The cost element in dummy cells arealways(a)Zero(b)Infinity(c)Two(d)Three 52. The costs that are associated with asacrificed opportunity in order to makea particular decision(a)Social cost(b)Explicit cost(c)Implicit cost(d)Opportunity cost 53. Game theory came into existence in the(a)21 st Century(b)20 th Century(c)19 th Century(d)18 th Century54.It is the expected pay off play when allthe players of the game follow their optimum strategies(a)Pay-off matrix(b)Strategy(c)Game plan(d)Value of game55.The pay off in terms of gains or losses,when players select their particular strategies(a)Pay off (b)Pay off matrix(c)Strategies(d)Value of game56.The game is called fair if the value of game(a)1(b)2(c)00(d)057.The minimum element in each row of pay off matrix is called(a)Minimum(b)Row maxima(c)Row minima(d)Maximum58.The maximum element in each columnof pay off matrix is called(a)Row minimum(b)Column minimum(c)Row maxima(d)Column maxima59.The pay off amount in the saddle pointposition is also called(a)Value of game(b)Game plan(c)Game work(d)Name of the above60.To reduce the size of pay off matrixrefers the rule of (a)Saddle port(b)Game value(c)Dominance(d)Pay off 61.Swapping the difference is applied in(a)Arithmetic method(b)Algebraic method(c)Matrix method(d)Graphical method62.If the matrix is in the form of squarematrix the optimal Strategies mix maybe obtained by(a)Pay-off matrix(b)Matrix method(c)Arithmetic method(d)Graphical method63.This method is useful for the game whenthe pay off matrix is the size 2xn or mx2(a)Matrix method(b)Graphical method(c)L.P method(d)Algebraic method64.The -two person zero sum games canalso be solved by(a)Algebraic method(b)Linear programming(c)Graphical method(d)Arithmetic method65.For a minimization problem in big __ Mmethod penalty is designated as(a)+M(b)-M(c)M(d)None of the above 66. The Erie quality sign is reversed in allthe constraints except ______ condition XIX (4)
