Decision Science | Chapter 3 | Part 3 | MBA MCQs | DS

Decision Science MCQs

  

1 / 20

1. A feasible solution to an LP problem
   1.   Must satisfy all of the problem’s constraints simultaneously
   2.   Must optimize the value of the objective function
   3.   Need not satisfy all of the constraints, only some of them
   4.   Must be a corner point of the feasible region
2. The best use of linear programming technique is to find an optimal use of
   1.   Money
   2.   Manpower
   3.   All of the above
   4.   Machine
3. Non-negativity condition in an LP model implies
   1.   Non-negative value of resources
   2.   A positive coefficient of variables in objective function
   3.   None of the above
   4.   A positive coefficient of variables in any constraint
4. Which of the following is a limitation associated with an LP model
   1.   No consideration of effect of time & uncertainty on LP model
   2.   The relationship among decision variables in linear
   3.   All of the above
   4.   No guarantee to get integer valued solutions
5. The graphical method of LP problem uses
   1.   Constraint equations
   2.   Objective function equation
   3.   Linear equations
   4.   All of the above
6. If two constraints do not intersect in the positive quadrant of the graph, then
   1.   One of the constraints is redundant
   2.   None of the above
   3.   The problem is infeasible
   4.   The solution is unbounded
7. If a non-redundant constraint is removed from an LP problem then
   1.   Feasible region will become smaller
   2.   None of the above
   3.   Feasible region will become larger
   4.   Solution will become infeasible
8. An iso-profit line represents
   1.   An infinite number of optimal solutions
   2.   A boundary of the feasible region
   3.   An infinite number of solutions all of which yield the same profit
   4.   An infinite number of solution all of which yield the same cost
9. Which of the following statements is true with respect to the optimal solution of an LP problem
   1.   If an optimal solution exists, there will always be at least one at a corner
   2.   Every LP problem has an optimal solution
   3.   Optimal solution of an LP problem always occurs at an extreme point
   4.   At optimal solution all resources are completely used
10. While solving a LP model graphically, the area bounded by the constraints is called
    1.   None of the above
    2.   Unbounded solution
    3.   Infeasible region
    4.   Feasible region
11. A constraint in an LP model becomes redundant because
    1.   Two iso-profit line may be parallel to each other
    2.   None of the above
    3.   This constraint is not satisfied by the solution values
    4.   The solution is unbounded
12. While plotting constraints on a graph paper, terminal points on both the axes are connected by a straight line because
    1.   All of the above
    2.   The resources are limited in supply
    3.   The objective function as a linear function
    4.   The constraints are linear equations or inequalities
13. If one of the constraint of an equation in an LP problem has an unbounded solution,
    then
    1.   Alternative solutions exist
    2.   None of the above
    3.   Feasible region should have a line segment
    4.   Solution to such LP problem must be degenerate
14. Which of the following is an assumption of an LP model
    1.   Proportionality
    2.   Divisibility
    3.   All of the above
    4.   Additivity
15. While solving a LP problem, infeasibility may be removed by
    1.   Removing a variable
    2.   Adding another constraint
    3.   Adding another variable
    4.   Removing a constraint
16. Which of the following is not a characteristic of the LP
    1.   Parameters value remains constant during the planning period
    2.   The problem must be of minimization type
    3.   Resources must be limited
    4.   only one objective function
17. Alternative solutions exist of an LP model when
    1.   All of the above
    2.   Two constraints are parallel
    3.   Objective function equation is parallel to one of the constraints
    4.   One of the constraints is redundant
18. Constraints in LP problem are called active if they
    1.   At optimality do not consume all the available resources
    2.   None of the above
    3.   Both a & b
    4.   Represent optimal solution
19. The solution space (region) of an LP problem is unbounded due to
    1.   Both a & b
    2.   Objective function is unbounded
    3.   An incorrect formulation of the LP model
    4.   Neither a nor b
20. If an iso-profit line yielding the optimal solution coincides with a constaint line, then
    1.   The constraint which coincides is redundant
    2.   The solution is infeasible
    3.   None of the above
    4.   The solution is unbounded