Question

When do we get a trivial solution of a linear programming problem?

Answer 1

Suppose I have system of 3 equations

a1x+b1y+c1z=0a1x+b1y+c1z=0

a2x+b2y+c2z=0a2x+b2y+c2z=0

a3x+b3y+c3z=0a3x+b3y+c3z=0

and cofficient matrix A=⎛⎝⎜a1a2a3b1b2b3c1c2c3⎞⎠⎟A=(a1b1c1a2b2c2a3b3c3) So I have been told that solution of this matrix will be non-trivial if |A|=0|A|=0 and trivial in any other case. As far as I know non trivial solution means solutions is not equal to zero but in any case