1.In Graphical solution the feasible region is_____________.
a. where all the constraints are satisfied simultaneously.
b. any one constraint is satisfied.
c. only the first constraint is satisfied.
d. any one of the above conditions.
2.Some case in LPP has _________.
a. one optimal solutions.
b. two optimal solutions.
c. three.
d. multiple optimal solution.
3.An LPP deals with problems involving only_________.
a. single objective.
b. multiple objectives.
c. two objective.
d. none of these.
4.Which of the following is not associated with any LPP_____________.
a. feasible solution.
b. optimum solution.
c. deterministic in nature.
d. Quadratic equation.
5.The graphical method can be used when an LPP has ______ decision variables.
a. 2
b. 3
c. 4
d. more than 4
6.Which method is used to get optimal solution in graphical method of solving an LPP?
a. corner point solution method
b. polynomial method
c. modi method
d. quadratic method
7.A constraint implies ____.
a. cost function
b. the restriction put on resources.
c. profit function.
d. none of these.
8.In the graphical method, all the constraints are plotted in the graph as
a. a curve
b. a straight line
c. a circle
d. none of these
9.In Graphical solution the feasible solution is any solution to an LPP which satisfies _______.
a. only objective function.
b. non-negativity restriction.
c. only constraint.
d. all the three.
10.In Graphical solution the redundant constraint is____________.
a. which forms the boundary of feasible region.
b. which do not optimizes the objective function.
c. which does not form boundary of feasible region.
d. which optimizes the objective function.
1:A 2:D 3:A 4:D 5:A 6:A 7:B 8:B 9:B 10:C.
11.If an LPP has more than one optimal solution, it is called...
a. infeasibility.
b. multiple optimal solution.
c. unbounded solution.
d. redundancy.
12.Optimal solution in an LPP is ___________.
a. which maximizes or minimizes the objective function.
b. which maximizes the objective function.
c. which minimizes the objective function.
d. which satisfies the non-negativity
restrictions.
13.Unbounded solution in an LPP is ___________.
a. where the objective function can be decreased indefinitely.
b. which maximizes the objective function.
c. where the objective function can be increased or decreased indefinitely.
d. where the objective function can be increased indefinitely.
14.Every LPP can be written in an alternate form and that is called____.
a. primal
b. dual
c. rival
d. none of these
15.If primal is of "maximization" type, then its dual will be____.
a. maximization
b. minimization
c. dual cannot be obtained
d. none of these
16.The canonical form of LPP if the objective function is of maximization, then all the constraints other than non-negativity conditions are __________.
a. greater than type.
b. lesser than type.
c. greater than or equal to type.
d. lesser than or equal to type.
17.The canonical form of LPP if the objective function is of minimization then all the constraints other than non-negativity conditions are ___________.
a. greater than type.
b. lesser than type.
c. greater than or equal to type.
d. lesser than or equal to type.
18.In standard form LPP, the decision variables____.
a. can be negative.
b. must be zero.
c. must be non-negative.
d. none of these.
19.In an LPP the Objective function is to be____________.
a. Minimized.
b. maximized.
c. minimized or maximized.
d. Maximin.
20.The region on the graph sheet with satisfies the constraints including the non- negativity restrictions is called the _______space.
a. solution.
b. interval.
c. concave.
d. convex.
21.The __________is the method available for solving an L.P.P.
a. graphical method.
b. least cost method.
c. MODI method.
d. Hungarian method.
11:B 12:A 13:C 14:B 15:B 16:D 17:C 18:C 19:C 20:A 21:A.
- sources: https://brainmass.com/business/business-management/50-multiple-choice-questions-on-quantitative-methods-69857
- https://www.slideshare.net/akshaygavate1/ds-mcq
https://wps.prenhall.com/
Very nice and informative article
ReplyDelete