Top 250+ Solved Management Science MCQ Questions Answer
Q. Linear Programming technique is a:
a. Constrained optimisation technique
b. Technique for economic allocation of resources
c. Mathematical technique
d. All of the above
Q. A constraint in a Linear Programming Model restricts:
a. Value of objective function
b. Value of decision variable
c. Use of available resources
d. All of the above
Q. Before formulating a formal L P model, it is better to:
a. Verbally identify decision variables
b. Express the objective function in words
c. Express each constraint in words
d. All of the above
Q. Linear Programming Technique helps to find an optimal use of:
a. Machine
b. Money
c. Manpower
d. All of the above
Q. Which of the followings is an assumption of Linear Programming Technique?
a. Divisibility
b. Additivity
c. Proportionality
d. All of the above
Q. Which of the following is true with regard to a Linear Programming Model?
a. No guarantee to get integer valued solution
b. The relationship among decision variables is liner
c. Both a and b
d. None of the these
Q. The graphical method if LPP uses:
a. Linear equations
b. Constraint equations
c. Objective function
d. All of the above
Q. Constraints in an LPP are treated as active, if they:
a. Do not consume all the available resources at optimality
b. Represent optimal solution
c. Both a and b
d. None of these
Q. While solving a LPP graphically, the area bounded by constraints is called .................
a. Feasible region
b. Infeasible region
c. Unbounded region
d. None of these
Q. While solving an LPP, infeasibility may be removed by:
a. Removing a variable
b. Removing a constraint
c. Adding a variable
d. Adding a constraint
Q. ........................variables are fictitious and cannot have any physical meaning.
a. Slack variables
b. Surplus variables
c. Artificial variables
d. Decision variables
Q. An optimal solution is considered as the ................... among the feasible solutions.
a. Worst
b. Best
c. Ineffective
d. None of these
Q. ........................... method is used to solve an assignment problem.
a. American method
b. Hungarian method
c. German method
d. British method
Q. The allocated cells in the transportation table are called ..............................
a. Occupied cells
b. Empty cells
c. Unoccupied cells
d. None of these
Q. In transportation Problems, VAM stands for .........................
a. Value Addition Method
b. Vogel’s Approximation Method
c. Virgenean Approximation Method
d. None of these