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\}$$.

enter image description here----------------------------

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.

  • $\begingroup$ Just combine all the inequalities and equalities in one set...?? $\endgroup$ Nov 8, 2020 at 9:22
  • $\begingroup$ @ShubhamJohri but how to remove redundant inequalities and equalities? $\endgroup$
    – GPrathap
    Nov 8, 2020 at 9:35
  • $\begingroup$ @GPrathap If this is part of your question then you should include it into the post. Otherwise the answer of Shubham is correct and is exactly what you can expect. $\endgroup$
    – M. Winter
    Nov 12, 2020 at 9:47
  • $\begingroup$ @M.Winter sure thanks $\endgroup$
    – GPrathap
    Nov 12, 2020 at 9:49


You must log in to answer this question.