Top 150+ Solved Business Mathematics MCQ Questions Answer
Q. The linear function of the variables which is to be maximize or minimize is called
a. constraints
b. objective function
c. decision variable
d. none of the above
Q. The value of objective function is maximum under linear constraints
a. at the center of feasible region
b. at (0,0)
c. at any vertex of feasible region
d. the vertex which is at maximum distance from (0, 0)
Q. The first step in formulating a linear programming problem is
a. identify any upper or lower bound on the decision variables
b. state the constraints as linear combinations of the decision variables
c. understand the problem
d. identify the decision variables
Q. Constraints in an LP model represents
a. limititations
b. requirements
c. balancing, limitations and requirements
d. all of above
Q. The best use of linear programming is to find optimal use of
a. money
b. manpower
c. machine
d. all the above
Q. Which of the following is assumption of an LP model
a. divisibility
b. proportionality
c. additivity
d. all of the above
Q. Before formulating a formal LP model, it is better to
a. express each constraints in words
b. express the objective function in words
c. verbally identify decision variables
d. all of the above
Q. Non-negative condition in an LP model implies
a. a positive coefficient of variables in objective function
b. a positive coefficient of variables in any constraint
c. non-negative value of resourse
d. none of the above
Q. The set of decision variable which satisfies all the constraints of the LPP is called as-----
a. solution
b. basic solution
c. feasible solution
d. none of the above
Q. The intermediate solutions of constraints must be checked by substituting them back into
a. objective function
b. constraint equations
c. not required
d. none of the above
Q. A basic solution is called non-degenerate, if
a. all the basic variables are zero
b. none of the basic variables is zero
c. at least one of the basic variables is zero
d. none of these
Q. A solution which satisfies non-negative conditions also is called as-----
a. solution
b. basic solution
c. feasible solution
d. none of the above
Q. In graphical method of linear programming problem if the iOS-cost line coincide with a sideof region of basic feasible solutions we get
a. unique optimum solution
b. unbounded optimum solution
c. no feasible solution
d. infinite number of optimum solutions
Q. If the number of available constraints is 3 and the number of parameters to be optimized is 4,then
a. the objective function can be optimized
b. the constraints are short in number
c. the solution is problem oriented
d. none of these