Bachelor of Management Studies (B.M.S.) SEM VI 2020 21 2020-21 OR BMS MCQs Question Paper - Mumbai University | munotes

Introduction to Operations Research
(1) Operations Research Models in which values of all variables and all
possible outcomes are known with certainty are called models
(b) Symbolic
(c) Deterministic
(d) Probabilistic
(2) Operations Research Models in which some or all variables are random in
nature are called models
(b) Symbolic
(c) Deterministic
(d) Probabilistic
(3) Mean, median and mode are measures of
(a) Central tendency
(b) Dispersion
(c) Probability
(4) and are techniques applied in project management
(a) CPM and PERT
(b) Assignment and Transportation
(c) Decision theory and Inventory models
(5) Operations Research techniques are in nature
(a) Qualitative
(c) Approximate
(d) Quantitative
(Basic Concepts and Problem Formulation)
(1) are the entities whose values are to be determined from the
solution of the LPP
(a) Objective function
(b) Decision Variables
(c) Constraints
(d) Opportunity costs
(2) specifies the objective or goal of solving the LPP
(a) Objective function
(b) Decision Variables
(c) Constraints
(d) Opportunity costs
(3) Objective function is expressed in terms of the
(a) Numbers
(b) Symbols
(c) Decision Variables
(4) are the restrictions or limitations imposed on the LPP
(a) Variables
(b) Costs
(c) Profits
(d) Constraints
(5) The type of constraint which specifies maximum capacity of a resource is
‘ or equal to’ constraint
(a) Less than
(b) Greater than
(c) Less than or greater than
[Ans.: (a) less than]
(6) In linear programming represents mathematical equation of the
limitations imposed by the problem. (April 19)
(a) Objective function
(b) Decision variable
(c) Redundancy
(d) Constraints
(1) The region of feasible solution in LPP graphical method is
(a) Infeasible region
(b) Unbounded region
(c) Infinite region
(d) Feasible region
(2) When it is not possible to find solution in LPP, it is called as case of
(a) Unknown solution
(b) Unbounded solution
(c) Infeasible solution
(d) Improper solution
(3) When the feasible region is such that the value of objective function can
extend to infinity, it is called a case of
(b) Alternate optimal
(c) Unbounded solution
(d) Unique solution
(4) When the constraints are a mix of ‘less than’ and ‘greater than’ it is a
(a) Multiple constraints
(b) Infinite constraints
(c) Infeasible constraints
(d) Mixed constraints
(5) Incase of an‘ constraint, the feasible region is a straight line
(a) less than or equal to
(b) greater than or equal to
(c) mixed
(d) equal to
[Ans.: (d) equal to]
(b) Degenerate solution
(c) Infinite solutions
(d) Unique solution
(1) The incoming variable column in the simplex algorithm is called
(a) key column
(b) incoming column
(c) variable column
(d) important column
(2) The outgoing variable row in the simplex algorithm is called
(a) outgoing row
(b) key row
(c) interchanging row
(d) basic row
(3) The intersection value of key column and key row is called
(a) element
(b) important element
(c) key element
(d) basic element
(4) The variable added to the LHS of a less than or equal to constraint to
convert it into equality is called
(a) surplus variable
(b) artificial variable
(c) variable
(d) additional variable
(5) A resource which is completely utilized is called in simplex
(a) null resource
(b) scarce resource
(c) zero resource
(d) abundant resource
(6) A resource which is partially utilized is called in simplex
(a) surplus resource
(b) extra resource
(c) available resource
(d) abundant resource
(7) The value of one extra unit of resource is called in simplex
(a) unit price
(b) extra price
(c) price
(d) shadow price
(8) In simplex, a maximization problem is optimal when all Delta J,
(a) Either zero or positive
(b) Either zero or negative
(c) Only positive
(d) Only negative
[Ans.: (a) Either zero or negative]
(1) To find initial feasible solution of a transportation problem the method
which starts allocation from the lowest cost is called method
(b) least cost
(d) Vogel’s approximation
(2) Ina transportation problem, the method of penalties is called
(a) least cost
(c) Vogel’s approximation
(3) When the total of allocations of a transportation problem match with
supply and demand values, the solution is called solution
(a) non-degenerate
(b) degenerate
(c) feasible
(d) infeasible
(4) When the allocations of a transportation problem satisfy the rim condition
(m the solution is called solution
(a) degenerate
(b) infeasible
(c) unbounded
(d) non-degenerate
(5) When there is a degeneracy in the transportation problem, we add an
imaginary allocation called in the solution
(a) dummy
(b) penalty
(c) epsilon
(d) regret
(6) IfM+N-1=Number of allocations in transportation, it means
(Where ‘M’ is number of rows and ‘N’ is number of columns)
(a) There is no degeneracy
(b) Problem is unbalanced
(c) Problem is degenerate
(d) Solution is optimal
[Ans.: (a) There is no degeneracy]
(7) Which of the following considers difference between two least costs for
each row and column while finding initial basic feasible solution in
the number of rows and columns in an assignment problem are not equal
than it is called problem
(a) prohibited
(b) infeasible
(c) unbounded
(d) unbalanced
(2) The method of solution of assignment problems is called
(c) LCM
(d) Hungarian
(3) When a maximization assignment problem is converted in minimization
problem, the resulting matrix is called
(a) Cost matrix
(b) Profit matrix
(c) Regret matrix
(d) Dummy matrix
(4) The extra row or column which is added to balance an assignment problem
(b) epsilon
(c) dummy
(d) extra
(5) When a particular assignment in the given problem is not possible or
restricted as a condition, it is called a problem
(a) infeasible
(b) degenerate
(c) unbalanced
(d) prohibited
(6) If in an assignment problem, number of rows is not equal to number of
(a) Problem is degenerate
(b) Problem is unbalanced
(c) a maximization problem
(d) Optimal solution is not possible
[Ans.: (b) Problem is unbalanced]
(1) The longest path in the network diagram is called path
(a) best
(b) worst
(d) critical
(2) The second longest path in the network diagram is called path
(a) alternate
(b) feasible
(d) critical
(3) Forward pass calculations are done to find occurrence times of
(c) latest
(d) approximate
(4) Backward pass calculations are done to find occurrence times of
(a) tentative
(b) definite
(c) latest
(5) An activity whose start or end cannot be delayed without affecting total
(a) dummy
(b) non-critical