Equations of the form F(x)=f(x)+Ax=y where f(x)=[f1(x1 ) f2(x2) . . . f n(xn)]T, A is a P 0 matrix and for all i=1,2, . . ., n, fi(xi), are monotonic and piecewise linear but not necessarily strictly monotonic, are studied. Such networks are shown to have a unique solution if the Jacobian determinant has the same sign in all the regions. This is much more general than several sufficient conditions available in the papers by Sandberg and Willson (1969) and by Chien (1977). Furthermore it is not possible to improve this any further as the condition is both necessary and sufficient. A new sufficient condition is proposed to quickly check the sign condition on the Jacobians