Decision Science

MCQ Re test 10 marks

Instruction : Copy this Question Paper, mark correct option and mail it.
1) For constraints of type ≥ we mark the feasible region as
a) the region towards the origin b) region away from the origin
c)constraint line only d) first quadrant.
2) In LPP the constraints of a minimization problem are normally of
a) less than or equal to type b) greater than or equal to type
c) less than type d) greater than type
3) For constraints of type ≤ we mark the feasible region as
a) the region towards the origin b) region away from the origin
c)constraint line only d) first quadrant.
4) In LPP the constraints of a maximization problem are normally of
a) less than or equal to type b) greater than or equal to type
c) less than type d) greater than type
5)While plotting constraints on a graph paper, terminal points on both the axes are
connected by a straight line because
a) The resources are limited in supply.
b) The objective function is a linear function.
c) the constraints are linear equations or inequalities.
d) all of these
6) 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
7) The purpose of a dummy row or column in an assignment problem is to
a) obtain a balance between total activities and total resources
b) prevent a solution from becoming degenerate
c) provide a means of representing a dummy problem
d) none of the above
8) Maximization assignment problem is transformed into a minimization problem by
a) adding each entry in a column from the maximum 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
9)An optimal solution of an assignment problem can be obtained only if
a) each row and column has only one zero element
b) each row and column has at least one zero element
c) the data are arrangement in a square matrix
d) none of the above
10) The penalty in VAM is obtained by
a) deducting smallest element in the row/column from all the other elements of the
row/column
b) deducting smallest element in the row/column from next higher element of the row/column
c) deducting smallest element from the highest element of the row/column
d) adding smallest element of the row/column to the highest element in the row/column