Hi Ashutosh,<div>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.<br>
Best,</div><div>Pierre<br><div class="gmail_quote">On Tue, Jan 10, 2012 at 3:50 AM, Ashutosh Mahajan <span dir="ltr"><<a href="mailto:asm4@lehigh.edu">asm4@lehigh.edu</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
This time in Syn15M04M.nl running HYB.<br>
<br>
[mahajan@flogin3 bonmin-1.5.1-minlp-hyb]$ cat bonmin.opt<br>
bonmin.algorithm B-HYB<br>
bonmin.time_limit 7200.0<br>
bonmin.nlp_log_level 0<br>
bonmin.bb_log_level 1<br>
bonmin.bb_log_interval 1000<br>
<br>
[mahajan@flogin3 bonmin-1.5.1-minlp-hyb]$ cat Syn15M04M.out<br>
Bonmin 1.5.1 using Cbc 2.7.2 and Ipopt <a href="tel:3.10.1" value="+333101">3.10.1</a><br>
<br>
<br>
******************************************************************************<br>
This program contains Ipopt, a library for large-scale nonlinear optimization.<br>
Ipopt is released as open source code under the Eclipse Public License (EPL).<br>
For more information visit <a href="http://projects.coin-or.org/Ipopt" target="_blank">http://projects.coin-or.org/Ipopt</a><br>
******************************************************************************<br>
<br>
OA0003I New best feasible of -408.15457 found after 0.140979 sec and<br>
OA0014I Major iteration 1 ub: -408.15049<br>
OA0003I New best feasible of -408.15457 found after 0.278958 sec and<br>
OA0014I Major iteration 2 ub: -408.15049<br>
OA0003I New best feasible of -408.15457 found after 0.415937 sec and<br>
OA0014I Major iteration 3 ub: -408.15049<br>
Cbc0012I Integer solution of -408.15457 found by nonlinear programm after 76 iterations and 0 nodes (0.43 seconds)<br>
Cbc0031I 52 added rows had average density of 8.8076923<br>
Cbc0013I At root node, 52 cuts changed objective from -9422.7666 to -5864.5586 in 20 passes<br>
Cbc0014I Cut generator 0 (NLP solution based oa cuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active)<br>
Cbc0014I Cut generator 1 (Mixed Integer Gomory) - 156 row cuts average 43.8 elements, 0 column cuts (46 active)<br>
Cbc0014I Cut generator 2 (Mixed Integer Rounding) - 85 row cuts average 2.8 elements, 0 column cuts (6 active)<br>
Cbc0014I Cut generator 3 (Clique) - 2 row cuts average 3.0 elements, 0 column cuts (0 active)<br>
Cbc0014I Cut generator 4 (Flow Covers) - 24 row cuts average 2.1 elements, 0 column cuts (0 active)<br>
Cbc0014I Cut generator 5 (Feasibility Pump for MINLP.) - 4 row cuts average 3.0 elements, 0 column cuts (0 active)<br>
Cbc0014I Cut generator 6 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active)<br>
Cbc0014I Cut generator 7 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active)<br>
Cbc0010I After 0 nodes, 1 on tree, -408.15457 best solution, best possible -5864.5586 (0.66 seconds)<br>
OA0003I New best feasible of -4903.4785 found after 1.236812 sec and<br>
Cbc0016I Integer solution of -4903.4785 found by strong branching after 1133 iterations and 12 nodes (1.24 seconds)<br>
bonmin: ../../../Cbc/src/CbcBranchDynamic.cpp:551: virtual int CbcBranchDynamicDecision::betterBranch(CbcBranchingObject*, CbcBranchingObject*, double, int, double, int): Assertion `distance >= 0.0' failed.<br>
<br>
Cheers.<br>
<span class="HOEnZb"><font color="#888888">--<br>
regards<br>
Ashutosh Mahajan<br>
<a href="http://coral.ie.lehigh.edu/~asm4" target="_blank">http://coral.ie.lehigh.edu/~asm4</a><br>
<br>
_______________________________________________<br>
Bonmin mailing list<br>
<a href="mailto:Bonmin@list.coin-or.org">Bonmin@list.coin-or.org</a><br>
<a href="http://list.coin-or.org/mailman/listinfo/bonmin" target="_blank">http://list.coin-or.org/mailman/listinfo/bonmin</a><br>
</font></span></blockquote></div><br></div>