A SPECIAL MATCHING PROBLEM AND AN ALGORITHM FOR IT

two attribute values A(p) and F(p), where A(p) takes a binary value 'good' or 'bad' and F(p) takes a value of real number given according to some evaluation of p. Then, the problem is to find an interchanging rule so that by repeatedly interchanging attrib-n ute values A(p) and F(p) between Pl' P2E:N(N= U Ni)' the value (1) i=l should be minimized under the condition that the value (2) lbe maximal: (1) Max Max IF(p)-F(p) I iE:B pE:N i (2) Value of IBI where, (i) B = {i IA(p) = 'good' VpE:N i } (ii) A(p) and rep) are attribute functions modified by interchanging. In this paper, the authors have developed a theory by which this problem could be handled as a matching problem for a bipar-tite graph and presented an efficient algorithm for it. A nwnerical example and a result of numerical experiment are also given.