On This Page

This set of Management Science Multiple Choice Questions & Answers (MCQs) focuses on Management Science Set 7

Q1 | ......................... deals with making sound decisions under conditions of certainty, risk anduncertainty.
  • Game theory
  • Network analysis
  • Decision theory
  • None of these
Q2 | ....................... deals with the concepts such as critical path, float, events, etc.
  • Game theory
  • Decision theory
  • Queuing theory
  • Network analysis
Q3 | ............................... is used to imitate an operation prior to actual performance.
  • Inventory control
  • Simulation
  • Game theory
  • Integrated Production Model
Q4 | ............................... is concerned with determination of the most economic replacement policy.
  • Probabilistic programming
  • Linear programming
  • Search theory
  • Replacement theory
Q5 | The O R technique which helps in minimising total waiting and service cost is:
  • Game theory
  • Queuing theory
  • Both a and b
  • Decision theory
Q6 | Linear Programming technique is a:
  • Constrained optimisation technique
  • Technique for economic allocation of resources
  • Mathematical technique
  • All of the above
Q7 | A constraint in a Linear Programming Model restricts:
  • Value of objective function
  • Value of decision variable
  • Use of available resources
  • All of the above
Q8 | Before formulating a formal L P model, it is better to:
  • Verbally identify decision variables
  • Express the objective function in words
  • Express each constraint in words
  • All of the above
Q9 | Linear Programming Technique helps to find an optimal use of:
  • Machine
  • Money
  • Manpower
  • All of the above
Q10 | Which of the followings is an assumption of Linear Programming Technique?
  • Divisibility
  • Additivity
  • Proportionality
  • All of the above
Q11 | Which of the following is true with regard to a Linear Programming Model?
  • No guarantee to get integer valued solution
  • The relationship among decision variables is liner
  • Both a and b
  • None of the these
Q12 | The graphical method if LPP uses:
  • Linear equations
  • Constraint equations
  • Objective function
  • All of the above
Q13 | Constraints in an LPP are treated as active, if they:
  • Do not consume all the available resources at optimality
  • Represent optimal solution
  • Both a and b
  • None of these
Q14 | While solving a LPP graphically, the area bounded by constraints is called .................
  • Feasible region
  • Infeasible region
  • Unbounded region
  • None of these
Q15 | While solving an LPP, infeasibility may be removed by:
  • Removing a variable
  • Removing a constraint
  • Adding a variable
  • Adding a constraint
Q16 | ........................variables are fictitious and cannot have any physical meaning.
  • Slack variables
  • Surplus variables
  • Artificial variables
  • Decision variables
Q17 | An optimal solution is considered as the ................... among the feasible solutions.
  • Worst
  • Best
  • Ineffective
  • None of these
Q18 | ........................... method is used to solve an assignment problem.
  • American method
  • Hungarian method
  • German method
  • British method
Q19 | The allocated cells in the transportation table are called ..............................
  • Occupied cells
  • Empty cells
  • Unoccupied cells
  • None of these
Q20 | In transportation Problems, VAM stands for .........................
  • Value Addition Method
  • Vogel’s Approximation Method
  • Virgenean Approximation Method
  • None of these
Q21 | Initial feasible solution to a transportation Problem can be found out by .........................
  • VAM
  • MODI Method
  • Both a and b
  • None of these
Q22 | ........................ is applied to determine optimal solution.
  • NWCR
  • VAM
  • MODI Method
  • None of these
Q23 | A Transportation Problem is said to be unbalanced when total supply is not equal to ............
  • Total cost
  • Total demand
  • Both a and b
  • None of these
Q24 | For a minimisation Transportation Problem, the objective is to minimise:
  • Profit
  • Cost
  • Solution
  • None of these
Q25 | ....................... is an important Operations Research Technique to analyse the queuing behaviour.
  • Game theory
  • Waiting line theory
  • Decision theory
  • Simulation