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

Decision Science MCQs

  

 

1. Let X be the number of units to make and Y be the number of units to buy. If its cost is Rs. 3 to make a unit and Rs. 4 to buy a unit and 3000 units are needed, the objective function is:
   
   1.   Max (3X+4Y)
   2.   Min 3000 (3X+4Y)
   3.   Max (9000X+12000Y)
   4.   Min (3X+4Y)
2. Find, if possible, the minimum value of the objective function 3x-4y subject to the constraints -2x+y <= 12, x-y <= 2, x >= 0 and y >= 0
   1.   No solution
   2.   -8
   3.   8
   4.   0
3. Transportation techniques are basically used for
   1.   Reduce the cost of transportation
   2.   allocating the man machine combination
   3.   Increase the total revenue
   4.   To provide quality service to customers
4. When the problem contains total number of allocations not equal to (m+n-1) the case is considered as:
   1.   Unbalanced
   2.   Degenerate
   3.   Feasible
   4.   Balanced
5. Which of the following considered to give optimum basic feasible solution,
   1.   North west corner
   2.   least cost method
   3.   VAM
   4.   MODI
6. What is penalty in VAM
   1.   difference between two highest cost
   2.   difference between alternate cost
   3.   difference between lowest and second lowest cost
   4.   none of the given
7. The unbalanced problem of Transportation is solved with the help of:
   1.   dummy row
   2.   dummy column
   3.   a) or b)
   4.   both a) and b)
8. The occurrence of degeneracy while solving a transportation problem means that
   1.   total supply = total demand
   2.   the solution obtained is not feasible
   3.   few allocations become negative
   4.   none of the given
9. The stepping-stone method requires that one or more artificially occupied cells with a flow of zero be created in the transportation tableau when the number of occupied cells is fewer than
   1.   m + n - 2
   2.   m + n - 1
   3.   m + n
   4.   m + n + 1
10. The assignment problem is a special case of the
    1.   transportation problem
    2.   transshipment problem
    3.   maximal flow problem
    4.   shortest-route problem
11. Operations Research techniques helps to find ………..solution
    1.   Feasible
    2.   non-feasible
    3.   Optimal
    4.   non-optimal
12. The best use of linear programming technique is to find an optimal use of
    1.   Money
    2.   Manpower
    3.   Machine
    4.   all of the above
13. While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to
    
    1.   Minimize total cost of assignment
    2.   reduce cost of assignment to zero
    3.   reduce cost of that particular assignment to zero
    4.   all of the above
14. The purpose of dummy row or column in an assignment problem is to
    1.   Obtain balance between total activities and total resources
    2.   prevent a solution from becoming degenerate
    3.   provide a means of representing a dummy problem
    4.   none of the above
15. Maximization assignment problem is transformed into minimization problem by
    1.   adding each entry in a column from the maximum value in that colum
    2.   subtracting each entry in a column from the maximum value in that column
    3.   subtracting each entry in a table from the maximum value in that column
    4.   any of the above
16. Allocation of sales territory to sales person is ____________ problem
    1.   Maximization problem
    2.   Minimization problem
    3.   both
    4.   none of the above
17. Balance matrix is__________
    1.   no. of lines = no. of rows & columns
    2.   no. of rows = no. of columns
    3.   no. of lines = no. of rows
    4.   none of the above
18. In Assignment techniques Hungarian method is also known as
    1.   Flood’s Techniques
    2.   Markov Chain
    3.   Maxi method
    4.   Hungarian’s Techniques
19. If there were n workers and n jobs there would be
    1.   n! solutions
    2.   (n-1)! solutions
    3.   n!n solutions
    4.   n solutions
20. Traffic Intensity means :
    1.   a) Probability that the server is busy
    2.   Both a) and c)
    3.   c) Probability that there are more than one customer in the system
    4.   b) Probability that the server is Idle