On families of hyperplanes that separate polyhedra

The problem of constructing a family of hyperplanes that separate two disjoint nonempty polyhedra is examined. the polyhedra are given by systems of linear inequalities or by systems of linear equalities with nonnegative variables. constructive algorithms for solving this problem are presented. the construction of separating hyperplanes relies heavily on theorems of the alternative.