A little improvement over the Hungarian solution to the maximized assignment problem

Assignment issues;  Hungarian solution;  Improvements

Aiming at the Hungarian solution of the minimization problem in the assignment problem, a solution method of maximizing the problem is proposed that is different from the traditional solution. This method does not need to replace the original coefficient matrix with a new coefficient matrix at the beginning, but can be solved directly on the original coefficient matrix, but some principles in the solution process are different from the solution principle of minimizing the problem. Since the number of problem-solving steps corresponds to the number of problem-solving steps and the number of problem-solving steps of the minimized problem, the same program with coefficients can be used to solve two different problems. This method is simple and intuitive, which provides a convenient way for the implementation of the solution on the computer.