OPERATIONS RESEARCH MBA Online Examination 1)The following covers the scope for operations research a)Industry &

agriculture b)Defence c)Planning d)All (d)

2)The following covers the scope of OR in management a)Allocation and distribution b)production and procurement c)functional areas d)R&D e)all

(e)

3)_______ techniques have been used in planning, scheduling and controlling construction of dams(a) a)PERT & CPM b)transportation c)assignment d)none

4)Phases of OR a)Formulating the problem b)constructing a model and deriving a model c)deriving and testing

(e)

d)control and implementation e)all

5)_______ model variables are completely defined and the outcomes are certain a) probabilistic b)deterministic c)both d)none

(b)

6)________ is used to solve problems in which either the objective function and /or one or more of the constraints are non-linear in nature. (a) a)non linear programming b)linear programming c)assignment d)Hungarian model

7)_______ models are used to make a series of interrelated decisions for multistage problems (a) a)dynamic programming b)linear programming c)transportation d)non linear programming

8)_______ is applied for situations which have multiple goals and objectives a) linear programming b)goal programming c)non linear programming

(b)

d)none

9)The computational procedure of _______ method is based on the fundamental property that the optimal solution to an LP problem , if it exists, occurs only at one of the corner points of the feasible region. (a) a)simplex b)BIG M model c)Hungarian d)goal programming

10)If the objective function in an LP problem is max case, then the constraints are of a)</ type b)>/ type c)=type d)all

(a)

11)If the objective function of an LP problem is min case, then the inequality constraints should be converted in to equalities by by _____ s1 and _______ A1 (b) a)Adding, subtracting b) subtracting ,Adding c)subtracting, subtracting d) adding, adding

12)If the objective function of an LP problem is min case, the constraints are of (a) a)>/ type b)</ type c)= type d)none

13)When the objective function in an LP is max, then </ type of constraint should be converted to equality by adding (a) a)S1 b)A1 c)M d)all

14)In BIG M method ,________ variables should be added a)semi variables b)artificial c)fixed

(b)

d)decision

15)Allocation should be made from north west corner region in ______ model of transportation problems. (a) a)NWC b)VAM c)LCM d)all

16)In _______ method, row penalties and column penalties are taken by subtracting smallest and next smallest valued cells (b) a)NW C b)VAM method c)LCM method d) all

17)The cell with least cost is taken for allocation initially in _______ method a)least cost method

(a)

18)For performing optimality test _______ can be used a)stepping stone method b)MODI method c)only a d)both a and b

(d)

19)For minimization of cost as objective function, under net contribution most ________ value should be taken (b) a)positive b)negative c)both d)none

20)For max case, under net contribution,_______ value should be taken. a)+ve b)-ve c)none d)both

(a)

21)________ method can be used for solving assignment problems a)goal programming b)bellmans recursion c)objective programming d)Hungarian method

(d)

22)Dynamic programming was originated in the year 1952 by a)Richard Bellman b)dantzing c)George d)legrange

(a)

23)________ principle of optimality forms the basis of dynamic programming techniques (a) a)Bellmans b)G.B.Dantzing c)both a &b d)none

24)The situations that vary with time and are considered dynamic in nature and the technique dealing with these types of problems is called (b)

a) linear programming b)Dynamic programming c)goal programming d)integer programming

25)Dynamic programming was initially referred to as the a)stochastic linear programming b)linear programming c)integer programming d)goal programming

(a)

26)The essence of ______ is to produce a model which imitates a real system, so that the model may be used as a basic for testing the policies (c) a)queuing theory b)goal programming c)simulation d)BIG M

27)The type of allocation model which involves the association of a number of jobs to the same number of resources(men) (d) a)Goal programming b)simulation c)game theory d)Assignment model

28)The assignment problem becomes more complex if some of the jobs require more than one resource or if the resource can be used for more than one job. Such a problem is called (a) a)transportation problem b)Goal programming c)simulation d)game theory

29)The study of the effect of discrete changes in the values of the parameters on the optimal solution is called post optimality analysis or _______ analysis (a) a)sensitivity analysis b)capita rationing

c)decision tree d)none

30)To solve linear programming problems _______ developed simplex method (a) a)George Dantzig b)nepolean c)George Hopkins d)Samuel john son

31)Non linear programming problems can be solved by using a)Simplex b) It has no specific method c)Hungarian method d)Dual simplex

(b)

32)In the folloing L.P problem Max Z=3X1+2X2; X1+2X2</50; 0.5X1+1X2</25 ; Which is the objective function? (a)

a)Max Z=3X1+2X2; b) X1+2X2</50;c) 0.5X1+1X2</25 ;d)none

33)In the graphical method of solving LP problem, while identifying feasible region for >/ type constraint (b) a) The area towards the origin is considered b)The area away from the origin is considered

c)the area inbetween inward and outward regions d)none

34) In the graphical method of solving LP problem, while identifying feasible region for </ type constraint (a) a)The area towards the origin will be considered b)The area away from the origin is considered c)the area inbetween inward and outward regions d)none

35)In graphical method of solving LP problem, while identifying feasible region the area common to all the constraints is called (a) a)Feasible region 36)In FIFO queueing model, the service time follows a)exponential distribution

37)Average waiting time in system Ws is given by a)1/(- )

38)Formula for probability that there is no body in the system a)P0=1-/ b)Lq= 2/ (- ) c)Lq= / - d)none

(a)

39)In FIFO queueing model, the arrival time follows

(c)

a)Exponential distribution b)probability distribution c)poisons distribution d)none

40)Formula for expected number of customers in the queue is given by a) P0=1-/ b)Lq= 2/ (- ) c)Lq= / - d)none

(b)

41) Formula for expected length of non empty queue a) / - b) a) P0=1-/ b)Lq= 2/ (- ) c)Lq= / -

(a)

42)Random numbers are used in ______ technique a)Markovian analysis b)simulation c)simplex d)bellmans

(b)

43)Types of simulation

(d)

a)system b)monte carlo c)only a d)both e)none

44)________ method uses random numbers and is used to solve problems which involve condition of uncertainty and where mathematical formulation is impossible (a)

a)monte-carlo simulation b)system c)simulation d)none

45)If supply demand in transportation model problems, ________ is to be done a)equating b)progression c)balancing d)imbalance

(c)

46)If supply>demand

(a)

a)insert a column with zeros and requiredemand b)insert a row with zeros and requiredemand c)both a & b d)none

47)If Supply < demand

(a)

a)insert a row with zeros and required supply b)insert a column with zeros and required demand c)both a & b d)none

48)In decision tree analysis the point where 2 or more events evolve is called a)a node b)a network c)cell d)activity

(a)

49)decision making is chosing a)chosing among decisions b)chosing among activities c)one among number of alternatives d)all

(c)

50)Full form of PERT is

(d)

a)Project Evaluation and Review Technique b)Process Evaluation and Review Technique c)Programme Evolution Review technique d)Programme Evaluation and Review Technique

51)Out of three methods of transportation,least cost method,vogels approximation method and north west corner rule,_________ gives the optimal solution (a) a)VAM b)LCM c)NWC d)all

52)While finding optimal solution using MODI method, closed loops should be formed taking cells as corner cells (c) a)variable b) solution cells c)basic cells d)non basic cells

53)There should be only______ positive and __________negative sign for each of the rows and Columns. (a)

a)1 & 1 b) 0 & 1 c) 1& 0 d)none

54)If number of basic cells are less than (m+n-1) allocations(occupied cells) the problem is said to be ______ transportation problem. (a) a)degenerate b) non degenerate c)basic d) non basic

55)If the number of basic cells=(m+n-1)allocations then that condition is _________ condition a)non degenerate b )degenerate c)basic d) non basic

(a)

56)Slack variables refer to__________ resources a)used b)unused c)reused d)never used

(b)

57)_______ variables are temporary slack variables which are used for purposes of calculation, and are removed later. (a) a)artificial b)basic c)non basic d)fixed

58)________ is the amount of resources by which the L.H.S of the equation exceeds the minimum limit . a)surplus variables b)artificial c)basic d)non basic (a)

59)For </ type of constraint, __________ should be added. a)artificial variables b)basic variables c)slack variables d)non basic variables

(c )

60)For >/ type of constraint,________ surplus variables and ________ artificial variables.(c) a)subtract,subtract b)add,subtract c)subtract,add d)add,none

61)For = type of constraint, __________ variables should be added. a)artificial b)basic c)non basic d)none

(a)

62)S1,S2,Sn are ________ variables a)basic b)non basic c)artificial d)solution

(a)

63)x1,x2,x3 are ________ variables a)basic b)artificial

(c)

c)non basic variables d)all

64)If all the variables are non negative, a basic feasible solution of a LP problem is called (a) a)basic feasible solution b)unbounded c)infeasible d)degenerate

65)The coefficient of artificial variables a1,a2,an are represented by a very high value M, and hence the method is known as (C) a)Small M b)maximization problem c)Big M method d)dual

66)Another way to solve minimization problems is by converting the objective function as a maximization problem by multiplying the equation by (a) a)-1 b)1 c)2 d)-2

67)In assignment models, if the given problem is a square matrix, the problem is termed as a _______ assignment problem. (a) a)balancing b)imbalance

c)equilibrium d)disequilibrium

68)If the given problem is not a square matrix, the problem is termed as an ________ assignment problem. a)unbalanced

69)In assignment models, if number of lines drawn =order of matrix, then it can be considered that______ is reached. (a) a)optimality b)result c)solution d)all

70)If number of allocations, N=m+n-1, then ______does not exist. a)non degenerousy b)degenerousy c)feasibility d)unbounded

(b)

71)If number of allocations,Nm+n-1, then ________ does exist. a)non degenerousy b)degenerousy c)feasibility d)unbounded

(a)

72)In a degenerasy condition, allocate a small positive quantity________ to one or more unoccupied cell that have lowest transportation costs, so as to make m+n-1 allocations. (a) a) b)* c) d)

73)Expected number of customers in the system a)Ls= /(1- )

(a)

b)Ls= .(1- ) c)Ls= 2/(1- ) d)none

74)probability that there are n customers in the system a)Pn=[ / ]^n .P0 b) Pn=[ / ]^n /P0 c) Pn=[ / ]^n d)none

(a)

75)Average waiting time for a customer a)W=1/ (1- ) b) W=1/ (1- ) c) W=1/ 2(1- ) d) W=1/ (1- )2

(a)

76)Average waiting time in the queue a)Wq= / .( - ) b) Wq= / /( - ) c) Wq= / .( - ) d)none

(a)

77)Probability that there is atleast one customer or queue is busy a)Pb=P0 b)Pb=1-P0

(b)

c)Pb=1/P0 d)Pb=P02

78)Traffic intensity is given by a) . b) / c) 2. d)none

(b)

79)_______is used when there are multiple goals a)goal programming b)linear programming c)dynamic programming d)integer programming

(a)

80)While selecting key row in linear programming problem in simplex method is to be taken as a)min[xb/xk] of all rows b) max[xb/xk] of all rows c) max[xb/xk] of all columns d)none

81)If one customer arrives for every 4 min, then _________ customers arrives per hour (a) a)15 b)12 c)19

d)20

82)If a server takes 2.5 min to serve a customer then_______ number of customers can be served in an hour (c) a)20 b)21 c)24 d)18

83)In queuing theory arrival rate is represented by symbol a) b) c) d)*

(c )

84) In queuing theory service rate is represented by symbol a) b) c) d)#

( b)

85)In MM1 ,infinite queue model, customers are served on ________ basis a)LILO b)FILO c)FIFO d)LIFO

( c)

86)In the Hungarian method, select the smallest element from uncovered elements and subtract from remaining elements not covered by lines and add at intersection of lines if_______ (c) a)if optimality is reached. b)if feasibility is reached c)if optimality is not reached d)none

87)________- model helps in solving problems on distribution and transportation of resources from one place to another. (a) a)Transportation b)sequencing c)scheduling d)Linear programming

88)In __________ models, un balanced problems can be solved by introducing dummy sources and dummy destinations. (b) a) sequencing b) Transportation c)Linear programming d)scheduling

89)One of the following is not a property of LP model

(e)

a)Relationship among decision variables must be linear in nature. b)A model must have an objective function c)Resource constraints are essential d)A model must have a non negativity constraint. e)ALL

90)________is the study of how changes in the co efficient of a linear programming affect the optimal solution (d) a)sensitivity analysis b)post optimality analysis c)none d)both a & b

91)The elements of a queuing system are a)The arrival pattern b)The service mechanism and queue discipline c)The number of customers allowed in the system d)The number of service channels e)all

(e)

92)________ model aims at minimizing the deviations from the predetermined goals a)goal programming b)integer programming c)dynamic programming d)none

(a)

93)__________ is a scientific method of providing executive departments with a quantitative basis for decisions regarding the operations under their control. (d) a) goal programming b)integer programming c)dynamic programming d)operations research

94) The answer to the questionHow and when orders can be placed? can be answered through (a) a)inventory models b)simulation c)game theory d)none

95)In goal programming Dur represents________ achievement of a goal. a)under b)over c)complete d)none

(a)

96) 95)In goal programming Dor represents________ achievement of a goal. a)under b)over c)complete d)none

(b)

97)Setting min stock level of bicycles in a cycle store is an example for ______- model. a)inventory models b)simulation c)game theory d)none

(a)

98)The Primal programme can be rewritten by transposing(reversing)the rows and columns of the algebraic statement of the problem. Inverting the programme in this way results in ________ programming (b) a)primal b)dual c)both d)none 99)Opening another reservation counter at the railway station is an example for _______ model (c ) a)inventory b)simulation c)queuing d)LP

100)Determination of number of bomb hits to destroy enemys nuclear plant. a)inventory b)queuing c)simulation d)none 101)Deciding the quantities of 3 products to be produced per week by the company. a)allocation b)queuing c)inventory d)simulation

(c)

(a)