Abstract
We show a theorem which characterizes optimal independent assignments. Based on the theorem, we propose an algorithm for finding an optimal independent assignment, which is of a primal type in that we start from a maximum independent matching and that we get maximum independent matchings having smaller total weights than the old ones as the computation proceeds.
