Combinatorial optimization problems related to the committee polyhedral separability of finite sets

In the paper, the computational and approximational complexity of the minimal affine separating committee problem, as well as of some important special cases of this problem, is investigated.