Assignment method

This document discusses solving assignment problems using the Hungarian method. It provides an 8-step process for solving both balanced and unbalanced assignment problems to minimize or maximize the objective. For balanced problems, the steps include reducing the matrix, finding possible assignments based on zeros, and covering and updating the matrix if no optimal solution is found. For unbalanced problems, dummy rows or columns are added to create a balanced matrix before applying the same steps. Examples demonstrate solving both minimization and maximization problems.