Top 250+ Solved Management Science MCQ Questions Answer
Q. The assignment problem is:
a. Requires that only one activity be assigned to each resource
b. Is a special case of transportation problem
c. Can be used to maximise resource
d. All the above
Q. The Hungarian method for solving an assignment problem can also be used to solve:
a. A transportation problem
b. A travelling salesman problem
c. A linear programming problem
d. Both a and b
Q. All the parameters in the linear programming model are assumed to be .....................
a. Variables
b. Constraints
c. Functions
d. None of these
Q. Graphic method can be applied to solve a liner programming problem when there are only........................... variables
a. A one
b. Two
c. Three
d. More than three
Q. If the feasible region of a linear programming problem is empty, the solution is ....................
a. Unbounded
b. Infeasible
c. Infeasible
d. Alternative
Q. The variables whose coefficient vectors are unit vectors, are called ......................
a. Unit variables
b. Basic variables
c. Non-basic variables
d. None of these
Q. Any column or row of a simplex table is known as .........................
a. Key column
b. Key row
c. Vector
d. None of these
Q. .................... is considered as the pioneer of Linear Programming Technique.
a. Churchman
b. D W Miller
c. James Lundy
d. George B Dantzig
Q. A minimisation problem can be connected into maximisation problem by changing the signs ofcoefficients in the ...........................
a. Constraints
b. Objectives
c. Both a and b
d. None of these
Q. In an LPP, if the solution of a variable can be made infinitely large without violating theconstraints, then the solution is ..............................
a. Infeasible
b. Alternative
c. Unbounded
d. Unique
Q. ......................... deals with making sound decisions under conditions of certainty, risk anduncertainty.
a. Game theory
b. Network analysis
c. Decision theory
d. None of these
Q. ....................... deals with the concepts such as critical path, float, events, etc.
a. Game theory
b. Decision theory
c. Queuing theory
d. Network analysis
Q. ............................... is used to imitate an operation prior to actual performance.
a. Inventory control
b. Simulation
c. Game theory
d. Integrated Production Model
Q. ............................... is concerned with determination of the most economic replacement policy.
a. Probabilistic programming
b. Linear programming
c. Search theory
d. Replacement theory
Q. The O R technique which helps in minimising total waiting and service cost is:
a. Game theory
b. Queuing theory
c. Both a and b
d. Decision theory