I’m doing research in Optimization and I have found this obstacle in the way. If we have set of half planes like $ c_ix\leq b_i$ where $ i\in \{1,\ldots ,k\}$ there is an algorithm(it would be better if it is polynomial time) such that we can certify $ \{\cup _{i\neq p}\{c_ix\leq b_i\}\}\subset \{c_px\leq b_p\}$ IfRead more