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

Decision Science MCQs

  

1 / 20

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