Given a matrix $[A|B]$ I want to find a minimal matrix $[A'|B'] \subseteq [A|B]$ (i.e. the rows in $[A'|B']$ are also in $[A|B]$) such that $A'x < B' \Rightarrow Ax < B$.
Geometrically, I want to discard the half-planes $X_i$ which contain the intersection of rest of the half-planes i.e. $X_i \supseteq \cup_{j \neq i} X_j$.
For now my solution is, for each row in $[A|B]$, flip the sign (i.e., multiply by $-1$) and check if the new $[A''|B'']$ is infeasible. If it is, that row is discarded, otherwise it is kept. This would take $n$ calls to a LP solver, on inputs of size $[A|B]$, where $n$ is the number of rows in $[A|B]$. Is there a more efficient way to do this?