On computing complexity of choosing exchange options with a limited number of resources

Choice of an optimal set of exchange options with a limited number of indivisible resources is discussed for the a general case of equitable exchanges. In both cases the problem is proved to belong to the class of $NP$-difficult combinatorial problems. A procedure of reducing the well-known $NP$-difficult problem of vertex graph cover to this problem is described.