The minimum number of lines covering all zeros in a reduced cost matrix of order n can be _____.

Related MCQs

• An optimal assignment requires that the maximum number of lines which can be drawn through squares with zero opportunity cost be equal to the number of______.
• Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have assignments equal to___________.
• The __________ time for an activity can be reduced by using increased resources.
• The irreducible minimum duration of the project is called______.
• All equality constraints can be replaced equivalently by _____________ inequalities
• The calculations of opportunity cost in the MODI method is analogous to a_____.
• While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to_________.
• The average annual cost will be minimized by replacing a machine when_____.
• The group replacement policy in suitable for identical low cost items which are likely to_________.
• In time cost trade off function analysis_________.