This book covers a range of innovative problems in combinatorics, poset and graph theories, optimization, and number theory that constitute a far-reaching extension of committee methods in pattern recognition. The universal language of oriented matroids offers a fresh look at infeasible systems of homogeneous strict linear inequalities – the standard model for the contradictory two-class pattern recognition problem in its geometric setting.