# Removing linear redundant constraints using Gauss Elimination

I have a set of linear constraints in the form of $c_i x \ge d_i$ and I need to identify if an additional constraint is redundant with respect of the previously mentioned set.

Here I found a similar question, however it is not clear to me how to use Gauss elimination to identify the redundant constraint.

Do you have any hints on this?

-
I'm not sure but you can find the rank of $C$ (of $Cx\geq d$) and then append the new constraint at the bottom of $C$ to form $C^*$ and find the rank of $C^*x\geq d^*$. Rank can be found by RREF which is esentially Gauss Elimination. – Inquest Nov 11 '12 at 20:19
Actually, I think the link is better, since I don't want to copy someone else's question without his/her permission. – amWhy Nov 11 '12 at 21:01
amWhy: Sure, thanks for your help – Jack Nov 11 '12 at 21:04

+1. ${{{{{}}}}}$ – Tim Nov 11 '12 at 21:12