This paper proposes two cases of efficiency matrix to minimize or maximize assignment problems:(i) the smallest elements are located on different rows and columns in matrix; and(ii) the largest elements lie in different rows and columns. In both cases

the optimal solutions of two kinds of assignment problems are obtained

which the values of the decision variables are 1 in the corresponding position of the smallest or largest elements; otherwise the value is 0.