<div>I'm running a later version:<br></div><div><br></div><div><span class="s1">$ cbc --version</span><br></div><p class="p1"><span class="s1">Welcome to the CBC MILP Solver<span class="Apple-converted-space"> </span></span><br></p><p class="p1"><span class="s1">Version: 2.9.6<span class="Apple-converted-space"> </span></span><br></p><div><span class="s1">Build Date: Dec 22 2017<span class="Apple-converted-space"> </span></span><br></div><div><br></div><div>and it's not core-dumping or marking the problem as infeasible (whic it's not)<br></div><div><br></div><div class="protonmail_signature_block"><div class="protonmail_signature_block-user"><div>-Ryan<br></div></div><div class="protonmail_signature_block-proton protonmail_signature_block-empty"><br></div></div><div><br></div><blockquote type="cite" class="protonmail_quote"><div>-------- Original Message --------<br></div><div>Subject: Re: [Cbc] Suboptimal solution as optimal?<br></div><div>Local Time: December 27, 2017 3:03 PM<br></div><div>UTC Time: December 27, 2017 9:03 PM<br></div><div>From: rod@frowd.net<br></div><div>To: Rhavar <rhavar@protonmail.com>, cbc@list.coin-or.org <cbc@list.coin-or.org><br></div><div><br></div><div> <br></div><p>Which version of cbc are you running? It is solving to the
optimal and then core dumping?<br></p><p></p><div>cbc -import problem.lp -min -solve<br></div><div> Welcome to the CBC MILP Solver <br></div><div> Version: 2.8.12 <br></div><div> Build Date: Feb 22 2016 <br></div><div> <br></div><div> command line - cbc -import problem.lp -min -solve (default
strategy 1)<br></div><div> Continuous objective value is 0 - 0.00 seconds<br></div><div> Cgl0003I 0 fixed, 9 tightened bounds, 1 strengthened rows, 0
substitutions<br></div><div> Cgl0004I processed model has 7 rows, 164 columns (164 integer) and
636 elements<br></div><div> Cutoff increment increased from 1e-05 to 0.9999<br></div><div> Cbc0038I Pass 1: suminf. 0.30901 (2) obj. 70.3063 iterations
3<br></div><div> Cbc0038I Solution found of 70.3063<br></div><div> Cbc0038I Branch and bound needed to clear up 2 general integers<br></div><div> Cbc0038I Full problem 7 rows 164 columns, reduced to 4 rows 25
columns<br></div><div> Cbc0038I Cleaned solution of 31480<br></div><div> Cbc0038I Before mini branch and bound, 160 integers at bound fixed
and 0 continuous<br></div><div> Cbc0038I Mini branch and bound improved solution from 31480 to
31480 (0.04 seconds)<br></div><div> Cbc0038I Round again with cutoff of 28331.1<br></div><div> Cbc0038I Pass 2: suminf. 0.30901 (2) obj. 70.3063 iterations
0<br></div><div> Cbc0038I Solution found of 70.3063<br></div><div> Cbc0038I Branch and bound needed to clear up 2 general integers<br></div><div> Cbc0038I Full problem 8 rows 164 columns, reduced to 4 rows 14
columns<br></div><div> Cbc0038I Mini branch and bound could not fix general integers<br></div><div> Cbc0038I No solution found this major pass<br></div><div> Cbc0038I Before mini branch and bound, 160 integers at bound fixed
and 0 continuous<br></div><div> Cbc0038I Mini branch and bound did not improve solution (0.04
seconds)<br></div><div> Cbc0038I After 0.04 seconds - Feasibility pump exiting with
objective of 31480 - took 0.02 seconds<br></div><div> Cbc0012I Integer solution of 31480 found by feasibility pump after
0 iterations and 0 nodes (0.04 seconds)<br></div><div> Cbc0038I Full problem 7 rows 164 columns, reduced to 3 rows 5
columns<br></div><div> Cbc0038I Full problem 7 rows 164 columns, reduced to 2 rows 3
columns<br></div><div> Cbc0031I 3 added rows had average density of 91.666667<br></div><div> Cbc0013I At root node, 3 cuts changed objective from 0 to 0 in 38
passes<br></div><div> Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0
elements, 2 column cuts (2 active) in 0.052 seconds - new
frequency is -100<br></div><div> Cbc0014I Cut generator 1 (Gomory) - 49 row cuts average 162.6
elements, 0 column cuts (0 active) in 0.016 seconds - new
frequency is -100<br></div><div> Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0
elements, 0 column cuts (0 active) in 0.000 seconds - new
frequency is -100<br></div><div> Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0
elements, 0 column cuts (0 active) in 0.000 seconds - new
frequency is -100<br></div><div> Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 43 row cuts
average 140.8 elements, 0 column cuts (0 active) in 0.004 seconds
- new frequency is -100<br></div><div> Cbc0014I Cut generator 6 (TwoMirCuts) - 14 row cuts average 150.1
elements, 0 column cuts (0 active) in 0.000 seconds - new
frequency is -100<br></div><div> Cbc0010I After 0 nodes, 1 on tree, 31480 best solution, best
possible 0 (0.14 seconds)<br></div><div> Cbc0016I Integer solution of 11580 found by strong branching after
238 iterations and 20 nodes (0.15 seconds)<br></div><div> Cbc0038I Full problem 7 rows 164 columns, reduced to 7 rows 8
columns<br></div><div> Cbc0038I Full problem 7 rows 164 columns, reduced to 6 rows 7
columns<br></div><div> Cbc0016I Integer solution of 8600 found by strong branching after
474 iterations and 87 nodes (0.18 seconds)<br></div><div> Cbc0038I Full problem 7 rows 164 columns, reduced to 7 rows 9
columns<br></div><div> Cbc0038I Full problem 7 rows 164 columns, reduced to 4 rows 7
columns<br></div><div> Cbc0012I Integer solution of 1025 found by RINS after 482
iterations and 91 nodes (0.19 seconds)<br></div><div> Cbc0038I Full problem 7 rows 164 columns, reduced to 7 rows 12
columns<br></div><div> Cbc0012I Integer solution of 825 found by combine solutions after
482 iterations and 91 nodes (0.19 seconds)<br></div><div> Cbc0038I Full problem 7 rows 164 columns, reduced to 3 rows 7
columns<br></div><div> Cbc0004I Integer solution of 70 found after 1719 iterations and
372 nodes (0.27 seconds)<br></div><div> Cbc0038I Full problem 7 rows 164 columns, reduced to 7 rows 13
columns<br></div><div> Cbc0038I Full problem 7 rows 164 columns, reduced to 4 rows 8
columns<br></div><div> cbc: CbcModel.cpp:15284: int CbcModel::doOneNode(CbcModel*,
CbcNode*&, CbcNode*&): Assertion `feasible' failed.<br></div><div> Aborted (core dumped)<br></div><p></p><p><br></p><div><br></div><div class="moz-cite-prefix">On 28/12/2017 5:58 AM, Rhavar wrote:<br></div><blockquote type="cite"><div>I just realized, an easy way to prove the solver is finding a
suboptimal solution is by forcing it's hand and adding an
additional constraint:<br></div><div><br></div><div>force: i22 = 1<br></div><div><br></div><div>and you will see it returns a better solution that it didn't
see before<br></div><div><br></div><div class="protonmail_signature_block"><div class="protonmail_signature_block-user"><div>-Ryan<br></div></div><div class="protonmail_signature_block-proton
protonmail_signature_block-empty"><br></div></div><div><br></div><blockquote type="cite" class="protonmail_quote"><div>-------- Original Message --------<br></div><div>Subject: Suboptimal solution as optimal?<br></div><div>Local Time: December 27, 2017 12:37 PM<br></div><div>UTC Time: December 27, 2017 6:37 PM<br></div><div>From: <a class="moz-txt-link-abbreviated" href="mailto:rhavar@protonmail.com">rhavar@protonmail.com</a><br></div><div>To: <a class="moz-txt-link-abbreviated" href="mailto:cbc@list.coin-or.org">cbc@list.coin-or.org</a> <a class="moz-txt-link-rfc2396E" href="mailto:cbc@list.coin-or.org"><cbc@list.coin-or.org></a><br></div><div><br></div><div>I have a problem:<br></div><div><a href="https://gist.github.com/RHavar/dfb9de631363ecb9e1c326fff5ebd09b">https://gist.github.com/RHavar/dfb9de631363ecb9e1c326fff5ebd09b</a><br></div><div><br></div><div>(lp file and solution file attached)<br></div><div><br></div><div>In the solution it says: "Optimal - objective value" but I
think I have found a superior solution by hand:<br></div><div><br></div><div><span class="s1"><span class="Apple-converted-space"> </span>o6
= 1</span><br></div><div>i22 = 1<br></div><div><br></div><div>Which gives a better objective (<span class="s1">70 instead
of </span>825)<br></div><div><br></div><div>--<br></div><div><br></div><div>So I guess my question is, does "Optimal - objective
value" mean that it's guaranteed to be the optimal solution?
Or am I doing something wrong? Or is there a bug in cbc? <br></div><div><br></div><div><br></div><div class="protonmail_signature_block"><div class="protonmail_signature_block-user"><div>-Ryan<br></div></div><div class="protonmail_signature_block-proton
protonmail_signature_block-empty"><br></div></div><div><br></div></blockquote><div><br></div><div><br></div><div><br></div><pre wrap="">_______________________________________________
Cbc mailing list
<a class="moz-txt-link-abbreviated" href="mailto:Cbc@list.coin-or.org">Cbc@list.coin-or.org</a>
<a class="moz-txt-link-freetext" href="https://list.coin-or.org/mailman/listinfo/cbc">https://list.coin-or.org/mailman/listinfo/cbc</a>
<br></pre></blockquote><div><br></div><div><div><br></div><table style="border-top: 1px solid #D3D4DE;"><tbody><tr><td style="width: 55px; padding-top: 13px;"><a href="https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=emailclient"><img class="proton-embedded" alt="" width="46" height="29" style="width: 46px; height: 29px;"></a><br></td><td style="width: 470px; padding-top: 12px; color: #41424e; font-size: 13px; font-family: Arial, Helvetica, sans-serif; line-height: 18px;">Virus-free. <a href="https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=emailclient" style="color: #4453ea;">www.avast.com</a><br></td></tr></tbody></table><div><a href="#DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2" width="1" height="1"></a><br></div></div></blockquote><div><br></div>