[Bonmin] assertion in OA

Pierre Bonami pierre.bonami at gmail.com
Mon Jan 16 16:02:01 EST 2012


Hi Ashutosh,
This is fixed in stable/1.5 (will fix in next release).
Best,
Pierre

On Tue, Jan 10, 2012 at 3:37 AM, Ashutosh Mahajan <asm4 at lehigh.edu> wrote:

> I was trying to solve using OA CLay0203H.nl, which is a benchmark problem
> from
> CMU. I get the following assert
>
> [mahajan at flogin3 bonmin-1.5.1-minlp-oa]$ cat bonmin.opt
> bonmin.algorithm                            B-OA
> bonmin.time_limit                           7200.0
> bonmin.nlp_log_level                        0
> bonmin.bb_log_level                         1
> bonmin.bb_log_interval                      1000
>
> [mahajan at flogin3 bonmin-1.5.1-minlp-oa]$ cat CLay0203H.out
> Bonmin 1.5.1 using Cbc 2.7.2 and Ipopt 3.10.1
>
>
>
> ******************************************************************************
> This program contains Ipopt, a library for large-scale nonlinear
> optimization.
> Ipopt is released as open source code under the Eclipse Public License
> (EPL).
> For more information visit http://projects.coin-or.org/Ipopt
>
> ******************************************************************************
>
> bonmin:
>
> ../../../../../Bonmin/src/Algorithms/OaGenerators/BonOACutGenerator2.cpp:218:
> virtual double Bonmin::OACutGenerator2::performOa(OsiCuts&,
> Bonmin::OaDecompositionBase::solverManip&, Bonmin::BabInfo*,
> double&, const CglTreeInfo&) const: Assertion `cutoff < ub' failed.
>
> Cheers.
> --
> regards
> Ashutosh Mahajan
> http://coral.ie.lehigh.edu/~asm4
>
> _______________________________________________
> 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/20120116/7ad37e90/attachment.html>


More information about the Bonmin mailing list