In this section, next to the original linear programming problem, we describe some of its relatives. In particular, combinatorial abstractions of the problem are important with respect to polytope theory (and, more general, discrete geometry). We pick out the aspect of combinatorial cube programming here (and leave aside abstractions like general combinatorial linear programming, LP-type problems, and oriented matroid programming), since it has received considerable attention lately.