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

Decision Science MCQs

  

1 / 20

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