Decision Science | Chapter 1 | Part 4 | MBA MCQs | DS

Decision Science MCQs

  

 

1. The solution space of a LP problem is unbounded due to
   1.   An incorrect formulation of the LP model
   2.   Objective function is unbounded
   3.   Neither (a) nor (b)
   4.   Both (a) and (b)
2. The graphical method of LP problem uses
   1.   Objective function equation
   2.   All the above
   3.   Constraint equation
   4.   Linear equations
3. While solving LP problem graphically, the area bounded by the constraints is called
   1.   Feasible region
   2.   Infeasible region
   3.   Unbounded solution
   4.   None of the above
4. Which of the following is not a category of linear programming problems?
   1.   Resource allocation problem
   2.   All of the above are categories of linear programming problems
   3.   Distribution network problem
   4.   Cost benefit trade off problem
5. Which of the following may not be in a linear programming formulation?
   1.   <=.
   2.   >.
   3.   All the above
   4.   =.
6. While solving an LP problem infeasibility may be removed by
   1.   Adding another constraint
   2.   Adding another variable
   3.   Removing a constraint
   4.   Removing a variable
7. A linear programming model does not contain which of the following components?
   1.   Data
   2.   A spread sheet
   3.   Constraints
   4.   Decisions
8. Straight lines shown in a linear programming graph indicates
   1.   Objective function
   2.   Constraints
   3.   Points
   4.   All the above
9. In linear programming problem if all constraints are less than or equal to, then the feasible region is
   1.   Above lines
   2.   Below the lines
   3.   None of the above
   4.   Unbounded
10. ……. is a series of related activities which result in some product or services.
    1.   Network
    2.   transportation model
    3.   assignment
    4.   none of these
11. Any activity which does not consume either any resource or time is called
    ………..activity.
    1.   Predecessor
    2.   Dummy
    3.   Successor
    4.   End
12. All negative constraints must be written as
    1.   Equality
    2.   Greater than or equal to
    3.   Less than or equal to
    4.   Non equality
13. Activities that cannot be started until one or more of the other activities are completed, but immediately succeed them are called ……activities
    1.   Predecessor
    2.   End
    3.   Dummy
    4.   Successor
14. An event which represents the beginning of more than one activity is known as ………..event.
    1.   Merge
    2.   Burst
    3.   Net
    4.   None of the above
15. 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.   One of the constraints is redundant
    4.   The solution is unbounded
16. An activity which must be completed before one or more other activities start is known as ……….activity.
    1.   Predecessor
    2.   Dummy
    3.   End
    4.   Successor
17. Constraint in LP problem are called active if they
    1.   Represent optimal solution
    2.   At optimality do not consume all the available resources
    3.   Both of (a) and (b)
    4.   None of the above
18. While solving an LP problem, infeasibility may be removed by
    1.   Adding another constraint
    2.   Removing a constraint
    3.   Adding another variable
    4.   Removing a variable
19. ….……..is that sequence of activities which determines the total project time.
    1.   Net work
    2.   Critical path
    3.   Critical activities
    4.   None of the above
20. Activities lying on the critical path are called………….
    1.   Net work
    2.   Critical path
    3.   Critical activities
    4.   None of the above