Solving an integer linear program: why are solvers claiming a solvable instance is infeasible?

Question

I\'m trying to solve integer programming problems. I\'ve tried both use SCIP and LPSolve

For example, given the final values of A and B, I want to solve for valA in

Answer 1

You could also have a look at SCIP 3.1.0 and especially its extended precision arithmetic features. Using GMP the LP solution can be computed up to a very high accuracy.