[Bonmin] no solution due to time limit

[ycollet at freesurf.fr]

precisely, when I went back to the history of the messages generated by
bonmin, I haven't found this one. Ipopt solves successfully but the
solution was not integer.
The success of Ipopt mislead me.

Thank's for the info.

YC

> Hi,
> You should look for a message of the type:
> Cbc0004I Integer solution of 769440 found after 1772 iterations and 79
> nodes (9.29 seconds)
> This will indicate that an integer feasible solution was found by
> Bonmin (the solutions found by Ipopt are most of the time not integer
> feasible).
> If one is found, it should be in x when the search terminates.
> Best,
> Pierre
> On Apr 23, 2009, at 4:42 AM, ycollet at freesurf.fr wrote:
>
>> Hello,
>>
>> I am a little bit disappointed: I use bonmin as a C++ library.
>> I launched bonmin on a .nl file, in the messages printed by bonmin,
>> I can
>> see that some of the iptop resolutions find feasible solutions
>> (primal and
>> dual feasibility under threshold).
>> But bonmin is stopped due to a time limit I set.
>> On exit, bonmin returns no solution. If I try to get the content of
>> vector
>> x in finalize_solution, I get a memory access.
>>
>> How can I retrieve a feasible solution when a limit has been reached
>> (node
>> limit, iteration limit, time limit).
>>
>> Your sincerely,
>>
>> YC
>>
>> _______________________________________________
>> Bonmin mailing list
>> Bonmin at list.coin-or.org
>> http://list.coin-or.org/mailman/listinfo/bonmin
>
>