On the belonging of the problems MIN-PC and MASC-GP$(n)$ to the class of MAX-SNP-hard problems

It is known that the problem on the minimal covering of a finite number of points in a plane by a set of straight lines (MIN-PC) and the problem on the minimal affine separating committee formulated in a space of fixed dimension (MASC-GP$(n)$) are NP-hard in the strong sense. We show that these problems are MAX-SNP-hard.