Tag: mathematical-optimization

Determining divisibility of number by 11 for large numbers

bit-manipulation division java math mathematical-optimization

I’m looking for a way to determine a large number is divisible by 11 My understanding: (sum of digits at even positions – sum of digits at odd positions) % 11 == 0 ==> yes This works for some examples. Example: 3816 => (3+1) – (8+6) = -10 In case of negative, do we need to consider 2’s complement of

Benders.Strategy using Java and opl

algorithm cplex java mathematical-optimization opl

I’m solving a mathematical model using Java however when i tried to call the Benders Strategy i keep receiving this error: Exception in thread “main” java.lang.IllegalArgumentException: No enum class ilog.cplex.cppimpl.IloCplex$IntParam with value 1501 at ilog.cplex.cppimpl.IloCplex$IntParam.swigToEnum(IloCplex.java:1974) at ilog.opl.IloCplex.setParam(IloCplex.java:5640) Here’s a part of my code in Java (i’m using CPLEX 12.8 and the library oplall.jar) : Answer There’s a similar question here.