Hello, i’m using Couenne to solve a MINLP problem. It has been running for days now, and during this time, i keep getting messages like this:
Cbc0010I After 26300 nodes, 3934 on tree, 1e+050 best solution, best possible 1 (324734.74 seconds) Cbc0010I After 26400 nodes, 3918 on tree, 1e+050 best solution, best possible 1.0000347 (325483.56 s econds) Optimality Based BT: 0 improved bounds Optimality Based BT: 21 improved bounds Cbc0010I After 26500 nodes, 3915 on tree, 1e+050 best solution, best possible 2 (369102.49 seconds)
In my problem, i’m trying to minimize this:
@variable(m, a[i=1:Nt], Bin) @objective(m, Min, sum(a[i] for i = 1:Nt))
Can anyone explain to me what does that mean? For example, in the first one, it has already solved 26300 problems in the BB tree? and what does 3934 on tree and 1e+050 means? Is the best value of my objective function found so far 1?
This makes sense to me, because i know that if any of those
a[i] = 1 i have a viable solution.
But as you can see, in the last message, the best possible is 2. How can this be?