Top 250+ Solved Management Science MCQ Questions Answer
Q. .........................are called mathematical models.
a. Iconic models
b. Symbolic models
c. Analogue models
d. None of these
Q. Probabilistic models are also called ...........................
a. Deterministic models
b. Dynamic models
c. Stochastic models
d. None of these
Q. ........................ models assume that the values of the variables do not change with time during aparticular period.
a. Dynamic
b. Static
c. Both a and b
d. None of these
Q. .......................models consider time as one of the important variable.
a. Dynamic
b. Static
c. Botha and b
d. None of these
Q. ........................may be defined as a method of determining an optimal program of interdependentactivities in view of available resources.
a. Goal programming
b. Linear programming
c. Decision making
d. None of these
Q. ..................... are expressed in the form of equations
a. Objectives
b. Constraints
c. Both a and b
d. None of these
Q. If there are more than one optimal solutions for the decision variables, the solution is ...........
a. Infeasible
b. Unbounded
c. Alternative
d. None of these
Q. Dual of the dual s a ..........................
a. Dual
b. Primal
c. Alternative
d. None of these
Q. The quantitative approach to decision analysis is a ..........................
a. Logical approach
b. Rational approach
c. Scientific approach
d. All of the above
Q. A model is a ...........................
a. An essence of reality
b. An approximation
c. An idealisation
d. All of the above
Q. The dummy source/destination in a transportation problem is added to ........................
a. Satisfy rim constraints
b. Prevent solution from becoming degenerate
c. Ensure total cost does not exceed a limit
d. None of the above
Q. The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the numberof positive allocations are:
a. m + n
b. m x n
c. m +n – 1
d. m +n + 1
Q. The method used for solving an assignment problem is:
a. Reduced matrix method
b. MODI method
c. Hungarian method
d. None of these
Q. An assignment problem can be solved by .........................
a. Simplex method
b. Transportation method
c. Both a and b
d. None of these
Q. For salesman who has to visit ‘n’ cities, which of the following are the ways of his tour plans:
a. n !
b. (n+1) !
c. (n-1) !
d. n