Let's say a polyhedron is defined as follows:
$$P = \{x|a_j^Tx\leq b_j, j=1,...,m \quad c_j^Tx=d_j, j=1,...,p\}$$.
I have a set of polyhedrons which were defined as above in 3D. I want to find the intersection of those as one polyhedron whose redundant equalities and inequalities should be removed. Any suggestions on this really appreciated.