Hello everyone,
I am trying to solve conjunctions of linear equations together with linear inequalities. As I am looking for a complete solution, and due to the inequalities, I know that the function to use is Reduce.
Reduce expresses the complete solution in a logical expression. When the logical expression is simple enough, we can manually verify that it is satisfiable and thus that solution(s) exist(s). But as we can hardly perform such manual verification when the logical expression begins to be too long, the following question arises : when Reduce returns a logical expression different from True or False, is that logical expression always satisfiable ? The fact that I am dealing with linear systems might help.
Thanks in advance.
