The problem of colorful linear programming is: if we are in d-space and have d+1 simplexes (which are collections of d+1 points) we'll call these colors such that 0 is in the convex hull of each then we want to find a "colorful simplex." (That is a simplex, which has no more than one point from each color), which contains zero in its convex hull.