In this paper we propose a new dichotomic linear discrimination algorithm based on a criterion recursively defined from the min and max functions. This criterion allows us, using a gradient algorithm, to find two hyperplanes which split two classes in an optimal way. We give two examples of the possibilities of the method.