Top 250+ Solved Management Science MCQ Questions Answer
Q. The variables which cannot be manipulated by the decision maker are called....................
a. Controllable variables
b. Uncontrollable variables
c. Both a and b
d. None of these
Q. Controllable variables are also called..................................
a. Slack variables
b. Surplus variables
c. Artificial variable
d. Decision variables
Q. The best use of linear programming technique is to find an optimal use of
a. money
b. man power
c. machine
d. all of the above
Q. Which of the following as an assumption of an LP model
a. divisibility
b. proportionality
c. additively
d. all of the above
Q. Most of the constraints in the linear programming problem are expressed as ……….
a. equality
b. inequality
c. uncertain
d. all of the above
Q. The graphical method of LP problem uses
a. objective function equation
b. constraint equation
c. linear equations
d. all the above
Q. A feasible solution to a linear programming problem
a. must satisfy all problem constraints simultaneously
b. need not satisfy all constraints
c. must be a corner point of the feasible region
d. must optimize the value of the objective function
Q. While plotting constraints on a graph paper, terminal points on both axes are connectedby a straight line because
a. the resources are limited in supply
b. the objective function is a linear function
c. the constraints are linear equations or in equalities
d. all of the above
Q. Constraints in LP problem are called active if they
a. represent optimal solution
b. at optimality do not consume all the available resources
c. both of (a) and (b)
d. none of the above
Q. The solution space of a LP problem is unbounded due to
a. an incorrect formulation of the lp model
b. objective function is unbounded
c. neither (a) nor (b)
d. both (a) and (b)
Q. While solving LP problem graphically, the area bounded by the constraints is called
a. feasible region
b. infeasible region
c. unbounded solution
d. none of the above
Q. Which of the following is not a category of linear programming problems?
a. resource allocation problem
b. cost benefit trade off problem
c. distribution network problem
d. all of the above are categories of linear programming problems.
Q. A linear programming model does not contain which of the following components?
a. data
b. decisions
c. constraints
d. a spread sheet
Q. Which of the following may not be in a linear programming formulation?
a. <=.
b. >.
c. =.
d. all the above
Q. While solving an LP problem infeasibility may be removed by
a. adding another constraint
b. adding another variable
c. removing a constraint
d. removing a variable