Checking large number of configurations with multiple constraints I have a very large number of constraints such as:


$ A1 \land B1 \land C1 \land D1 \land E1 \land F1$
$ A2 \land B2 \land C2 \land D2 \land E2 \land F2$
$ A3 \land B3 \land C3 \land D3 \land E3 \land F3$
$ A4 \land B4 \land C4 \land D4 \land E4 \land F4$


Here a constraint is a condition. For example, A1 is (response time &lt; 10). All the condition needs to be satisfied such that the configuration is feasible. For instance, the configuration 1 needs to have A1, B1, C1, D1, E1 and F1 =1. How can I quickly check which configurations are valid? At moment I'm using a CSP (choco-solver) and iterate over each configuration and check the conditions. Is there a better (faster) way to do this rather than just checking the configuration one by one?
Apparently, based on your comments, each condition is a linear inequality, you have a list of conditions, and you want to test whether an assignment satisfies all of the conditions, or find an assignment that satisfies all of the conditions.

Testing whether an assignment satisfies all of the conditions is just a simple matter of programming. For each inequality, you just plug in the values of the variables, then test whether the inequality holds or not.  No special solver or anything is needed.

It's also possible to find an assignment that satisfies all of the conditions, i.e., find values for all of the variables that makes all of the conditions true.  This is exactly the linear programming problem.  There are good, efficiently algorithms known for linear programming.  You can use any off-the-shelf linear programming solver.  They should very rapidly find a valid configuration.