Question

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

Answer 1

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

Step-by-step explanation:

inn collegil pooyirunno,...

Answer 2

Answer:

The minimum number of lines covering all zeros in a reduced cost matrix of order n can be AT THE MOST N

It is given that the assignment problem is of order n in the reduced cost matrix.

There is some row and / or column without assignment.

There is one assignment in, each row and in each column. In this case the optimal assignment can be made in the current solution.