Convex polyhedron is a subset of that satisfies system of linear inequalities
where . It can be alternatively represented by two finite sets of generators :
where conv(V) denotes all convex combinations of points in V and cone(W) all nonnegative linear combinations of points in W.
Now, what if we allow to be from . Is there some similar representation in terms of generating points for such sets?