Hi,
The format of a candidate solution is a vector of integers, say x = [x1, x2, x3, ...] where x1,..., x_n are integers.
I'm trying to optimize with MILX operator following the example [mixedint.jl] provided.
For variable size n <= 3, the optimization works, however, for n >3 the code generates the following errors:
InexactError: Int64(27.580148493398855)
But I set tc = fill(Int,dim), which should limit the solution to integers. One assumption is during the optimization process, we don't have valid solutions with better fitness, therefore causing the issue.
Hi,
The format of a candidate solution is a vector of integers, say x = [x1, x2, x3, ...] where x1,..., x_n are integers.
I'm trying to optimize with MILX operator following the example [mixedint.jl] provided.
For variable size n <= 3, the optimization works, however, for n >3 the code generates the following errors:
But I set
tc = fill(Int,dim), which should limit the solution to integers. One assumption is during the optimization process, we don't have valid solutions with better fitness, therefore causing the issue.