Computational complexity of problems of classification by a matrix of relations

Statements of the problem of classification by the relation matrix which rely on numerical criteria (functionals) for consistence of elements in a subset are condidered. With some natural assumptions on the relation functional the associated classification problem is proved to be $NP$-complete.