The document (see pic. below) states that it is possible to find a cover of the plane by a subset of 3 half-planes. It proposes to use linear programming for this. How to formulate such a program?
The original document can be found here: On the Separation of a Polyhedron from Its Single-Part Mold.
EDIT: For clarity: i need to understand how can i use LP to find subcoverage of size 3 from coverage of bigger size.