[Bonmin] another assertion in HYB

Pierre Bonami pierre.bonami at gmail.com
Thu Jan 26 11:33:45 EST 2012


Hi Ashutosh,
Sorry for the delay but this is tougher. The assert failure is probably
harmless but to fix it is difficult (it is bad communication between bonmin
and cbc). Right now I don't really know what to do with it.
Best,
Pierre
On Tue, Jan 10, 2012 at 3:50 AM, Ashutosh Mahajan <asm4 at lehigh.edu> wrote:

> This time in Syn15M04M.nl running HYB.
>
> [mahajan at flogin3 bonmin-1.5.1-minlp-hyb]$ cat bonmin.opt
> bonmin.algorithm                            B-HYB
> 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-hyb]$ cat Syn15M04M.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
>
> ******************************************************************************
>
> OA0003I New best feasible of -408.15457 found after 0.140979 sec and
> OA0014I Major iteration 1 ub: -408.15049
> OA0003I New best feasible of -408.15457 found after 0.278958 sec and
> OA0014I Major iteration 2 ub: -408.15049
> OA0003I New best feasible of -408.15457 found after 0.415937 sec and
> OA0014I Major iteration 3 ub: -408.15049
> Cbc0012I Integer solution of -408.15457 found by nonlinear programm after
> 76 iterations and 0 nodes (0.43 seconds)
> Cbc0031I 52 added rows had average density of 8.8076923
> Cbc0013I At root node, 52 cuts changed objective from -9422.7666 to
> -5864.5586 in 20 passes
> Cbc0014I Cut generator 0 (NLP solution based oa cuts) - 0 row cuts average
> 0.0 elements, 0 column cuts (0 active)
> Cbc0014I Cut generator 1 (Mixed Integer Gomory) - 156 row cuts average
> 43.8 elements, 0 column cuts (46 active)
> Cbc0014I Cut generator 2 (Mixed Integer Rounding) - 85 row cuts average
> 2.8 elements, 0 column cuts (6 active)
> Cbc0014I Cut generator 3 (Clique) - 2 row cuts average 3.0 elements, 0
> column cuts (0 active)
> Cbc0014I Cut generator 4 (Flow Covers) - 24 row cuts average 2.1 elements,
> 0 column cuts (0 active)
> Cbc0014I Cut generator 5 (Feasibility Pump for MINLP.) - 4 row cuts
> average 3.0 elements, 0 column cuts (0 active)
> Cbc0014I Cut generator 6 (Outer Approximation feasibility check.) - 0 row
> cuts average 0.0 elements, 0 column cuts (0 active)
> Cbc0014I Cut generator 7 (Outer Approximation strong branching solution
> check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active)
> Cbc0010I After 0 nodes, 1 on tree, -408.15457 best solution, best possible
> -5864.5586 (0.66 seconds)
> OA0003I New best feasible of -4903.4785 found after 1.236812 sec and
> Cbc0016I Integer solution of -4903.4785 found by strong branching after
> 1133 iterations and 12 nodes (1.24 seconds)
> bonmin: ../../../Cbc/src/CbcBranchDynamic.cpp:551: virtual int
> CbcBranchDynamicDecision::betterBranch(CbcBranchingObject*,
> CbcBranchingObject*, double, int, double, int): Assertion `distance >= 0.0'
> 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/20120126/a36cccff/attachment-0001.html>


More information about the Bonmin mailing list