The committee method is presented, designed to solve both joint and incompatible (contradictory) problems of optimal planning and pattern recognition. The method is based on the identification of dead-end, i.e. minimum for inclusion incompatible and maximum for inclusion joint subsystems from the entire system of restrictions of the initial optimization or classification problem. From the solutions of joint subsystems, committee constructions are built that generalize the concept of solving a system of restrictions in the event that this system is incompatible.