Consider the following graph for an infeasible 7 ×7 assignment problem: persons 1, 2, and 3 can be assigned only to objects 1 and 2; persons 4 and 5 can be assigned only to objects 1,2, 3, 4, and 5; persons 6 and 7 can be assigned only to objects 6 and 7. Determine the problem's decomposition into feasible and independent components (cf. the discussion of Sections 7.1.5 and 3.1.4).
