Is it possible to count all possible Solutions of a Problem?

In principle, it is possible to enumerate "all" solutions of a problem. How to do this with Xpress is described in the manual here.

However, there are some caveats:

• You can only enumerate different integer solutions and even that only makes sense if all variables are bounded. Consider for example the problem "min x, x >= 0, no further restrictions". Any positive real number is a solution, so there are infinitely many solutions. Even if x is required to be integer, there are infinitely many solutions.
• Even if all variables are bounded, there may be a lot of solutions, so enumeration may take time.
• If you have integer and continuous variables in your model then enumeration is only on integer variables. If two solutions differ only in the continuous variables they will be considered equal with respect to enumeration by Xpress.

If you want to avoid a particular solution to be found (again) then you can add a (no good) constraint that explicitly forbids that solution: Assume your problem is all binary and has N binary variables x. Also suppose you want to forbid the solution represented by s. Then the constraint

sum(i in N with s == 1) x + sum(i in N with s == 0) (1 - x) < N

forbids exactly that solution.

If you only want to find solutions that are better than a certain value then you can add a constraint that requires the objective value to be better than that value. However, having a constraint that is parallel to the objective function can hurt numerics and it may be better to use the MIPABSCUTOFF control. This has the same effect without explicitly introducing that constraint.

Note however that as soon as Xpress finds a feasible solution, it automatically sets the cutoff so that only better solutions are found. So doing repeated solves will by default only find better solutions.