Given a set of m equations with n variables x1, x2, … xn and there are more variables than equations (ie n > m and underdetemined) I am looking for an algorithm (which I will be coding into C#), to find out if there are any solutions with all variables >=0
I don’t really need to know a specific solution (though that’s also nice if it’s easy), just whether any solution exists.
I have investigated the Simplex Method, but I’m hoping there’s something simpler and in-particular doesn’t have the risk of being degenerate or too slow (there will be hundreds of variables / equations)