This document discusses linear programming approaches for solving casting problems in computational geometry. It first introduces the problem of determining if a polyhedron can be cast based on the angles between facets. This leads to representing the problem as finding the intersection of half-planes, which can be solved using linear programming. The document then provides algorithms for intersecting half-planes and using incremental linear programming to find a solution in linear expected time by randomly ordering the half-plane constraints.