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

Decision Science MCQs

  

1 / 20

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