Constraint & Linear Solvers

There are many Constraint and Linear solvers (open source and commercial) which can be utilized by Rule Solver.  Constraint solvers can represent almost any problem while linear solvers are limited to linear constraints only. Linear solvers usually can find optimal solutions for problems of very large size faster in situations when constraint solvers stop short. Rule Solver uses the same approach as Java Solver allowing you to easily switch between underlying off-the-shelf solvers without changing anything in your optimization model

Rule Solver can automatically install and use several open source constraint solvers including Constrainer, Choco, JSetl, and Sugar.

The majority of currently available linear solvers (open source or commercial) use the executable files of the corresponding solvers that cannot be included into the Maven Repository. It means that you need to install these solvers from their original repositories and make sure that your Environment variable PATH includes the path to their executables. Here are the names of the executable and links from where you may download linear solvers:
– COIN: clp.exe
– SCIP: scip.exe
– GLPK: glpsol.exe
– CPLEX: cplex.exe
– GUROBI: gurobi.exe

However, the linear solver CLP can be used without an additional installation thanks to the library clp-java. It can work only with real variables and doesn’t support MIP.

If you have any questions and/or want to become a contributor, send a request to support@openrules.com.