[Bonmin] assertion in OA

[Ashutosh Mahajan]

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