The number of solutions sufficient for solving a family of problems

This paper deals with families of optimization problems defined over a common set of potential solutions. We consider several problems–solutions systems, and for each one, prove the existence of a small set of solutions that contains an optimal solution to every problem. These proofs are mostly algebraic in nature. The families of problems covered here mostly include separation problems, problems on graphs and hypergraphs, and SAT problems.