QN1. Decision Science approach is
a. Multi-disciplinary
b. Scientific
c. Intuitive
d. All of the above
Answer
Answer: a. Multi-disciplinary
QN2. For analyzing a problem, decision-makers should study
a. Its qualitative aspects
b. Its quantitative aspects
c. Both a & b
d. Neither a nor b
Answer
Answer: c. Both a & b
QN3. Decision variables are
a. Controllable
b. Uncontrollable
c. Parameters
d. None of the above
Answer
Answer: a. Controllable
QN4. A model is
a. An essence of reality
b. An approximation
c. An idealization
d. All of the above
Answer
Answer: d. All of the above
QN5. Managerial decisions are based on
a. An evaluation of quantitative data
b. The use of qualitative factors
c. Results generated by formal models
d. All of the above
Answer
Answer: d. All of the above
QN6. The use of decision models
a. Is possible when the variables value is known
b. Reduces the scope of judgement & intuition known with certainty in decision-making
c. Require the use of computer software
d. None of the above
Answer
Answer: d. None of the above
QN7. Every mathematical model
a. Must be deterministic
b. Requires computer aid for its solution
c. Represents data in numerical form
d. All of the above
Answer
Answer: c. Represents data in numerical form
QN8. A physical model is example of
a. An iconic model
b. An analogue model
c. A verbal model
d. A mathematical model
Answer
Answer: c. A verbal model
QN9. An optimization model
a. Provides the best decision
b. Provides decision within its limited context
c. Helps in evaluating various alternatives
d. All of the above
Answer
Answer: a. Provides the best decision
QN10. The quantitative approach to decision analysis is a
a. Logical approach
b. Rational approach
c. Scientific approach
d. All of the above
Answer
Answer: c. Scientific approach
QN11. The qualitative approach to decision analysis relies on
a. Experience
b. Judgement
c. Intuition
d. All of the above
Answer
Answer: d. All of the above
QN12. The mathematical model of an LP problem is important because
a. It helps in converting the verbal description & numerical data into mathematical expression
b. Decision-makers prefer to work with formal models
c. It captures the relevant relationship among decision factors
d. It enables the use of algebraic technique
Answer
Answer: a. It helps in converting the verbal description & numerical data into mathematical expression
QN13. Linear programming is a
a. Constrained optimization technique
b. Technique for economic allocation of limited resources
c. Mathematical technique
d. All of the above
Answer
Answer: d. All of the above
QN14. 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
Answer
Answer: d. All of the above
QN15. 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
Answer
Answer: a. Relationship among all variables is linear
QN16. Constraints in an LP model represents
a. Limitations
b. Requirements
c. Balancing limitations & requirements
d. All of the above
Answer
Answer: d. All of the above
QN17. Non-negativity condition is an important component of LP model because
a. Variables value should remain under the control of the decision-maker
b. Value of variables make sense & correspond to real-world problems
c. Variables are interrelated in terms of limited resources
d. None of the above
Answer
Answer: b. Value of variables make sense & correspond to real-world problems
QN18. Before formulating a formal LP model, it is better to
a. Express each constrain in words
b. Express the objective function in words
c. Verbally identify decision variables
d. All of the above
Answer
Answer: d. All of the above
QN19. Maximization of objective function in an LP model means
a. Value occurs at allowable set of decisions
b. Highest value is chosen among allowable decisions
c. Neither of above
d. Both a & b
Answer
Answer: a. Value occurs at allowable set of decisions
QN20. Which of the following is not a characteristic of the LP model
a. Alternative courses of action
b. An objective function of maximization type
c. Limited amount of resources
d. Non-negativity condition on the value of decision variables.
Answer
Answer: b. An objective function of maximization type
QN21. 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
Answer
Answer: d. All of the above
QN22. 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
Answer
Answer: d. The problem must be of minimization type
QN23. Non-negativity 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 resources
d. None of the above
Answer
Answer: d. None of the above
QN24. Which of the following is an assumption of an LP model
a. Divisibility
b. Proportionality
c. Additivity
d. All of the above
Answer
Answer: d. All of the above
QN25. 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
Answer
Answer: d. All of the above
QN26. The graphical method of LP problem uses
a. Objective function equation
b. Constraint equations
c. Linear equations
d. All of the above
Answer
Answer: d. All of the above
QN27. 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
Answer
Answer: a. Must satisfy all of the problem’s constraints simultaneously
QN28. Which of the following statements is true with respect to the optimal solution of an LP problem
a. Every LP problem has an optimal solution
b. Optimal solution of an LP problem always occurs at an extreme point
c. At optimal solution all resources are completely used
d. If an optimal solution exists, there will always be at least one at a corner
Answer
Answer: d. If an optimal solution exists, there will always be at least one at a corner
QN29. 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
Answer
Answer: a. An infinite number of solutions all of which yield the same profit
QN30. 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
Answer
Answer: d. None of the above
QN31. While plotting constraints on a graph paper, terminal points on both the axes are connected by a straight line because
a. The resources are limited in supply
b. The objective function as a linear function
c. The constraints are linear equations or inequalities
d. All of the above
Answer
Answer: c. The constraints are linear equations or inequalities
QN32. 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
Answer
Answer: d. None of the above
QN33. If two constraints do not intersect in the positive quadrant of the graph, then
a. The problem is infeasible
b. The solution is unbounded
c. One of the constraints is redundant
d. None of the above
Answer
Answer: a. The problem is infeasible
QN34. 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 a & b
d. None of the above
Answer
Answer: a. Represent optimal solution
QN35. The solution space (region) of an 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 & b
Answer
Answer: c. Neither a nor b
QN36. While solving a LP model graphically, the area bounded by the constraints is called
a. Feasible region
b. Infeasible region
c. Unbounded solution
d. None of the above
Answer
Answer: a. Feasible region
QN37. Alternative solutions exist of an LP model when
a. One of the constraints is redundant
b. Objective function equation is parallel to one of the constraints
c. Two constraints are parallel
d. All of the above
Answer
Answer: b. Objective function equation is parallel to one of the constraints
QN38. While solving a LP problem, infeasibility may be removed by
a. Adding another constraint
b. Adding another variable
c. Removing a constraint
d. Removing a variable
Answer
Answer: c. Removing a constraint
QN39. If a non-redundant constraint is removed from an LP problem then
a. Feasible region will become larger
b. Feasible region will become smaller
c. Solution will become infeasible
d. None of the above
Answer
Answer: a. Feasible region will become larger
QN40. If one of the constraint of an equation in an LP problem has an unbounded solution, then
a. Solution to such LP problem must be degenerate
b. Feasible region should have a line segment
c. Alternative solutions exist
d. None of the above
Answer
Answer: b. Feasible region should have a line segment
