[Bonmin] number of nodes and the computational time until first feasible and optimal solutions

[Pierre Bonami]

Hi Pratim,
I am affraid that there is no possibility to retrieve the option  
through Ampl with Bonmin right now.
The way I usualy do is that I redirect the output of Bonmin in a text  
file and then parse it.

Each time an integer feasible solution is found there is a line like  
this:
Cbc0004I Integer solution of -2.50014 found after 38 iterations and 2  
nodes (0.10 seconds)
(always starts with Cbc0004I)

At the end of optimization there is a line like this:
Cbc0001I Search completed - best objective -2.500141411335856, took  
43 iterations and 3 nodes (0.11 seconds)

Sorry, that there is no better solution right now.
Best regards,
Pierre
On Jun 20, 2008, at 4:24 PM, Pratim Vakish wrote:

> Hello,
>
> I am using Bonmin to solve MINLP problems modelled in AMPL.
> I would like to record in a text file:
> 1) the number of nodes and the computational time needed until  
> Bonmin finds the first feasible solution, and
> 2) the number of nodes and the computational time needed until  
> Bonmin finds the optimal solution.
>
> Could you please indicate me how/which command line/option I can  
> use (again I am using AMPL) to obtain this output?
>
> Thanks!
>
>
> Pratim
>
> The other season of giving begins 6/24/08. Check out the i’m  
> Talkathon. Check it out!
> _______________________________________________
> Bonmin mailing list
> Bonmin at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/bonmin

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://list.coin-or.org/pipermail/bonmin/attachments/20080625/515a21b6/attachment.html