Top 150+ Solved Business Mathematics MCQ Questions Answer
Q. A solution which optimizes the objective function is called as ------
a. solution
b. basic solution
c. feasible solution
d. optimal solution
Q. In. L.P.P----
a. objective function is linear
b. constraints are linear
c. both objective function and constraints are linear
d. none of the above
Q. If the constraints in a linear programming problem are changed
a. the problem is to be re-evaluated
b. solution is not defined
c. the objective function has to be modified
d. the change in constraints is ignore
Q. Linear programming is a
a. constrained optimization technique
b. technique for economic allocation of limited resources
c. mathematical technique
d. all of the above
Q. A constraint in an LP model restricts
a. value of objective function
b. value of a decision variable
c. use of the available resources
d. all of the above
Q. The distinguishing feature of an LP model is
a. relationship among all variables is linear
b. it has single objective function & constraints
c. value of decision variables is non-negative
d. all of the above
Q. The best use of linear programming technique is to find an optimal use of
a. money
b. manpower
c. machine
d. all of the above
Q. Which of the following is not a characteristic of the LP
a. resources must be limited
b. only one objective function
c. parameters value remains constant during the planning period
d. the problem must be of minimization type
Q. Which of the following is an assumption of an LP model
a. divisibility
b. proportionality
c. additivity
d. all of the above
Q. Which of the following is a limitation associated with an LP model
a. the relationship among decision variables in linear
b. no guarantee to get integer valued solutions
c. no consideration of effect of time & uncertainty on lp model
d. all of the above
Q. The graphical method of LP problem uses
a. objective function equation
b. constraint equations
c. linear equations
d. all of the above
Q. A feasible solution to an LP problem
a. must satisfy all of the problem’s constraints simultaneously
b. need not satisfy all of the constraints, only some of them
c. must be a corner point of the feasible region
d. must optimize the value of the objective function
Q. An iso-profit line represents
a. an infinite number of solutions all of which yield the same profit
b. an infinite number of solution all of which yield the same cost
c. an infinite number of optimal solutions
d. a boundary of the feasible region
Q. If an iso-profit line yielding the optimal solution coincides with a constaint line, then
a. the solution is unbounded
b. the solution is infeasible
c. the constraint which coincides is redundant
d. none of the above
Q. A constraint in an LP model becomes redundant because
a. two iso-profit line may be parallel to each other
b. the solution is unbounded
c. this constraint is not satisfied by the solution values
d. none of the above