The given steps of the Hungarian method work well in the preceding example because the zero entries in the final matrix happen to produce a feasible assignment (in the
sense that each child is assigned a distinct chore). In some cases, the zeros created bysteps 1
and 2 may not yield a feasible solution directly, and further steps are needed to find the
optimal (feasible) assignment. The following example demonstrates this situation