[Bonmin] find_first_feasible option

[Pierre Bonami]

Dear Francois,

First note that to solve a non-convex problem you should always use the 
B-BB algorithm (the others will most certainly not find any feasible 
solution). You can set the option by putting in a file called bonmin.opt
bonmin.algorithm B-BB

There is an option which does what you want. You can put
bonmin.solution_limit 1
in a bonmin.opt file. Then the algorithm should stop at first feasible 
solution.
Best regards,
Pierre
Francois Dionne wrote:
> Dear mailing list,
>  
> I'm thinking of following Pietro Belotti's advice (thank you, by the 
> way) and using the stable version of Bonmin.
>  
> Now I have one more question: does Bonmin have an option to stop the 
> search after the first feasible solution is found?Symphony's linear 
> solver implements this feature by setting the "find_first_feasible" 
> key to TRUE .
>  
> Best regards,
> François Dionne
>  
> ------------------------------------------------------------------------
>
> _______________________________________________
> Bonmin mailing list
> Bonmin at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/bonmin
>