Abstract We consider polyhedral separation of sets as a possible tool in supervised classification. In particular, we focus on the optimization model introduced by Astorino and Gaudioso (J Optim Theory Appl 112(2):265–293, 2002) adopt its reformulation difference convex (DC) form. tackle problem adapting algorithm for DC programming known DCA. present results implementation DCA number benchmark...