This flow chart outlines the steps to solve an assignment problem by reducing rows and columns of a matrix until the number of lines equals the order of the matrix. If the solution is not optimum, it selects the least uncovered element to subtract from uncovered elements, add to junction elements, and leaves covered elements untouched, then continues drawing lines. If the solution is optimum, it boxes the zeros to find the optimal assignment.
This flow chart outlines the steps to solve an assignment problem by reducing rows and columns of a matrix until the number of lines equals the order of the matrix. If the solution is not optimum, it selects the least uncovered element to subtract from uncovered elements, add to junction elements, and leaves covered elements untouched, then continues drawing lines. If the solution is optimum, it boxes the zeros to find the optimal assignment.