Unit No.

I MCQ
1. Decision Science approach is
A. Multi-disciplinary
B. Scientific
C. Intuitive
D. All of the above
2. For analysing a problem, decision-makers should study
A. Its qualitative aspects
B. Its quantitative aspects
C. Both A & B
D. Neither a nor b
3. Decision variables are
A. Controllable
B. Uncontrollable
C. Parameters
D. None of the above
4. A model is
A. An essence of reality
B. An approximation
C. An idealization
D. All of the above
5. Managerial decisions are based on
A. An evaluation of quantitative data
B. The use of qualitative factors
C. Results generated by formal models
D. All of the above
6. The use of decision models
A. Is possible when the variables value is known
B. Reduces the scope of judgement & intuition known with certainty in decision-making
C. Require the use of computer software
D. None of the above
7. Every mathematical model
A. Must be deterministic
B. Requires computer aid for its solution
C. Represents data in numerical form
D. All of the above
8. An optimization model
A. Provides the best decision
B. Provides decision within its limited context
C. Helps in evaluating various alternatives
D. All of the above
9. The quantitative approach to decision analysis is a
A. Logical approach
 B. Rational approach
C. Scientific approach
D. All of the above
10. The method used for solving an assignment problem is called
A. Reduced matrix method
B. MODI method
C. Hungarian method
D. None of the above
11. The purpose of a dummy row or column in an assignment problem is to
A. Obtain balance between total activities & total resources
B. Prevent a solution from becoming degenerate
C. Provide a means of representing a dummy problem
D. None of the above
12. Maximization assignment problem is transformed into a minimization problem by
A. Adding each entry in a column from the maximization value in that column
B. Subtracting each entry in a column from the maximum value in that column
C. Subtracting each entry in the table from the maximum value in that table
D. Any one of the above
13. If there were n workers & n jobs there would be
A. n! solutions
B. (n-1)! solutions
C. (n!)n solutions
D. n solutions
14. An assignment problem can be solved by
A. Simplex method
B. Transportation method
C. Both a & b
D. None of the above

15. The Objective function of Transportation problem is to________.

A. Maximize The Total Cost.
B. Minimize Or Maximize The Total Cost.
C. Minimize The Total Cost.
D. Total cost should be zero.
16. In Transportation problem the preferred method of obtaining either optimal or very close
to the optimal solution is _____________.
A. North West corner rule.
B. Least cost method.
C. Vogel’s approximation method.
D. Simplex method.
17. In Transportation problem the improved solution of the initial basic feasible solution is
called ___________.
 A. Basic solution.
B. Optimal solution.
C. Degenerate solution.
D. Non-degenerate solution.
18. In Transportation problem optimal solution can be verified by using________.
A. North west corner rule.
B. Least cost method .
C. Modi method.
D. Matrix method .
19. The cells in the Transportation problem can be classified as ________.
A. Assigned cells and empty cells.
B. Allocated cells and Occupied Cell.
C. Occupied and unoccupied cells.
D. Assigned and unoccupied cells.
20. In North West corner rule the allocation is done in ________.
A. Upper left corner.
B. Upper right corner.
C. Middle cell in the transportation table.
D. Cell with the lowest cost.
21. In Least cost method the allocation is done by selecting ___________.
A. Upper left corner.
B. Upper right corner.
C. Middle cell in the transportation table.
D. Cell with the lowest cost.
22. In Transportation problem is said to be balanced if ________.
A. Total supply is not equal to total demand.
B. Total supply is greater than total demand.
C. Total supply is lesser than total demand.
D. Total supply is equal to total demand.
23. In transportation problem the solution is said to non-degenerate solution if occupied cells
are __________.
A. Greater than m+n-1.
B. Lesser than m+n-1.
C. Greater than or equal to m+n-1.
D. Lesser than or equal to m+n-1.
24. In transportation problem if total supply > total demand we add _________.
A. Dummy row with cost 0.
B. Dummy column with cost 0.
C. Dummy row with cost 1.
D. Dummy column with cost 1.
25. The application of assignment problems is to obtain _________.
A. Only minimum cost.
B. Only maximum profit.
C. Minimum cost or maximum profit.
 D. Assign the jobs
26. The solution of a transportation problem with m rows and n-columns is feasible if
number of positive allocations are__________.
A. m+n.
B. mxn.
C. m+n-1.
D. m+n+1.
27. The purpose of dummy row or column in an assignment problem is to_________.
A. Obtain balance between total activities and total resources.
B. Prevent a solution from becoming degenerate.
C. Provide a means of representing a dummy problem.
D. Any one of the above.
28. An optimal assignment requires that the maximum number of lines that can be drawn
through squares with zero opportunity cost be equal to number of_________.
A. Rows or columns.
B. Rows and columns.
C. Rows+columns-1.
D. Rows.
29. If we were to use opportunity cost value for an unused cell to test optimality it should be
A. Equal to zero
B. Most negative number
C. Most positive number
D. Any value
30. This innovative science of Operations Research was discovered during ‐‐‐‐‐‐‐‐‐‐‐‐‐
A. Civil War
B. World War I
C. World War II
D. Industrial Revolution
The initial feasible solution of the transportation problem can be obtained by applying any
known method however, the only condition is that
A. The solution the optimal
B. The rim condition are satisfied
C. The solution not be degenerate
D. All of the above

The dummy source or destination in the transportation problem is added to

A. Satisfy rim conditions
B. Prevent solution from becoming degenerate
C. ensure that the total cost does not exceed limit
D. none of the above

The occurrence of degeneracy while solving a the transportation problem means that
A. Total supply equal total demand
B. The solution so obtained is not feasible
C. The few locations become negative
D. None of the above

An alternative optimal solution to a minimization transportation problem exists whenever

opportunity cost corresponding to unused route of transportation is:
A. Positive and greater than zero
B. Positive with at least one equal to zero
C. Negative with at least one equal to zero
D. None of the above

One disadvantage of using North West corner rule to find initial solution to the transportation
problem is that
A. It is complicated to use
B. It does not take into account cost of transportation
C. It leads to degenerate initial solution
D. All of the above

The calculation of opportunity cost in the MODI method is analogous to

A. Cj – Zj value for non-basic variable column in the simplex method
B. Values of a variable in XB- column of the simplex method
C. Variable in the B - column in the simplex method
D. None of the above
If we were to use opportunity cost value for an unused cell to test optimality it should be
E. Equal to zero
F. Most negative number
G. Most positive number
H. Any value

During the iteration while moving from one solution to next degeneracy may occur when
A. The closed path indicates diagonal movie
B. Two or more occupied sales are on the closed path but neither of them represent a
corner of the path
C. Two or more occupied sales on the closed path with minus sign are tied for
lowest circle value
D. Either of the above