Business Mathematics - Questions and Answers for Competitive Exams | GkSeries

25. An LPP deals with problems involving only ______

• [A] single objective.
• [B] multiple objective.
• [C] two objective.
• [D] none of these.

Answer: Option [A]

26. Which of the following is not true about feasibility?

• [A] It cannot be determined in a graphical solution of an LPP.
• [B] It is independent of the objective function.
• [C] It implies that there must be a convex region satisfying all the constraints.
• [D] Extreme points of the convex region give the optimum solution

Answer: Option [A]

27. 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.

Answer: Option [C]

28. 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.

Answer: Option [C]

29. In an LPP the solution for the problems involving more than 2 variables can be solved using _____________.

• [A] graphical method.
• [B] simplex method.
• [C] hungarian method.
• [D] all the above

Answer: Option [B]

30. In the standard form of LPP if the objective function is of minimization then the right hand side of the constraints should be ___________.

• [A] positive
• [B] negative.
• [C] non-negative.
• [D] zero.

Answer: Option [C]

31. The Key column in simplex method is selected when the column of Z_j-C_j is ______.

• [A] most negative.
• [B] largest negative.
• [C] positive.
• [D] zero.

Answer: Option [A]

32. In a linear programming minimization model the objective function is to be ________.

• [A] minimized.
• [B] maximized.
• [C] minimized or maximized
• [D] standardized.

Answer: Option [A]

33.Which of the following is associated with any L.P.P?

• [A] feasible solution.
• [B] optimum solution.
• [C] basic solution.
• [D] all the above.

Answer: Option [D]

34. Which of the following is not true about feasibility?

• [A] it cannot be determined in a graphical solution of an L.P.P.
• [B] it is independent of the objective function.
• [C] it implies that there must be a convex region satisfying all the constraints..
• [D] extreme points of the convex region gives the optimum solution.

Answer: Option [A]

35. The objective of network analysis is to _____.

• [A] Minimize total project duration
• [B] Minimize total project cost.
• [C] Minimize product delays,interruption and conflicts
• [D] All the above.

Answer: Option [A]

36. The slack for an activity is equal to______

• [A] LF-LS.
• [B] EF-ES.
• [C] LS-ES.
• [D] None of the above.

Answer: Option [C]