<div dir="ltr"><div><div><div>Hi Christian,<br><br></div>I haven't seen this happen in Couenne before, though I don't use Pyomo very often. Can you share the model that yields this error? <br><br>Also, there might be a .sol file containing the solution in case that's all you want. This file can be either in /tmp or in the directory where the program was started. The solution file format is relatively easy: After a preamble with unused parameter, look for two lines with the same number, say k, that is the number of variables of the original problem. The following k lines are an optimal solution as found by Couenne.<br><br></div>Regards,<br></div>Pietro<br></div><div class="gmail_extra"><br><div class="gmail_quote">On Tue, May 3, 2016 at 10:30 AM, "Christian Schröder" <span dir="ltr"><<a href="mailto:Chris.Schroed1991@web.de" target="_blank">Chris.Schroed1991@web.de</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div><div style="font-family:Verdana;font-size:12.0px"><div>Hello,</div>
<div> </div>
<div>i tried to solve a model with Couenne using Pyomo for modeling and got an error message i dont understand. </div>
<div>Couenne finds a integer solution and finishes optimal. Still the last line from the output says:</div>
<div> </div>
<div>CoenneRecordBestSol::getModSol(): ###ERROR: expectedCard: -1 cardModSol: 121</div>
<div> </div>
<div>Could you help me out?</div>
<div> </div>
<div>Regards,</div>
<div>Christian </div>
<div> </div>
<div> </div>
<div>complete output:</div>
<div>####################################################</div>
<div>!pyomo solve --solver=couenne model_1.py <br>
[ 0.00] Setting up Pyomo environment<br>
[ 0.00] Applying Pyomo preprocessing actions<br>
[ 0.01] Creating model<br>
[ 0.03] Applying solver<br>
ERROR: "[base]\pyomo-4.3.11329-py2.7.egg\pyomo\opt\base\solvers.py", 570, solve<br>
Solver (asl) returned non-zero return code (1)<br>
ERROR: "[base]\pyomo-4.3.11329-py2.7.egg\pyomo\opt\base\solvers.py", 575, solve<br>
Solver log:<br>
Couenne 0.4.7 -- an Open-Source solver for Mixed Integer Nonlinear Optimization<br>
Mailing list: <a href="mailto:couenne@list.coin-or.org" target="_blank">couenne@list.coin-or.org</a><br>
Instructions: <a href="http://www.coin-or.org/Couenne" target="_blank">http://www.coin-or.org/Couenne</a><br>
<br>
NLP0012I <br>
Num Status Obj It time Location<br>
NLP0014I 1 OPT 1.1975299 124 0.231<br>
Coin0506I Presolve 126 (-32) rows, 74 (-47) columns and 350 (-79) elements<br>
Clp0006I 0 Obj 1.92 Primal inf 369.47823 (20) Dual inf 26.380188 (2)<br>
Clp0006I 38 Obj 0.96<br>
Clp0000I Optimal - objective value 0.96<br>
Clp0032I Optimal objective 0.96 - 38 iterations time 0.002, Presolve 0.00<br>
Clp0000I Optimal - objective value 0.96<br>
NLP0014I 2 INFEAS 0.017486949 34 0.055<br>
Clp0000I Optimal - objective value 0.96<br>
Cbc0031I 4 added rows had average density of 2.5<br>
Cbc0013I At root node, 4 cuts changed objective from 0.96 to 0.96328023 in 4 passes<br>
Cbc0014I Cut generator 0 (Couenne convexifier cuts) - 12 row cuts average 2.6 elements, 2 column cuts (6 active)<br>
Cbc0010I After 0 nodes, 0 on tree, 1e+050 best solution, best possible 0.96328023 (0.32 seconds)<br>
Cbc0010I After 100 nodes, 44 on tree, 1e+050 best solution, best possible 1.2 (2.32 seconds)<br>
Cbc0004I Integer solution of 1.8970508 found after 974 iterations and 115 nodes (2.35 seconds)<br>
Cbc0010I After 200 nodes, 54 on tree, 1.8970508 best solution, best possible 1.2 (2.82 seconds)<br>
Cbc0010I After 300 nodes, 86 on tree, 1.8970508 best solution, best possible 1.2 (3.18 seconds)<br>
Cbc0010I After 400 nodes, 130 on tree, 1.8970508 best solution, best possible 1.2 (3.38 seconds)<br>
Cbc0004I Integer solution of 1.44 found after 3500 iterations and 468 nodes (3.52 seconds)<br>
Cbc0010I After 500 nodes, 57 on tree, 1.44 best solution, best possible 1.2261503 (3.57 seconds)<br>
Cbc0010I After 600 nodes, 54 on tree, 1.44 best solution, best possible 1.2355182 (3.81 seconds)<br>
Cbc0010I After 700 nodes, 20 on tree, 1.44 best solution, best possible 1.2636993 (3.96 seconds)<br>
Cbc0010I After 800 nodes, 1 on tree, 1.44 best solution, best possible 1.4379178 (4.24 seconds)<br>
Cbc0001I Search completed - best objective 1.44, took 5821 iterations and 802 nodes (4.24 seconds)<br>
Cbc0035I Maximum depth 57, 5 variables fixed on reduced cost<br>
<br>
couenne: Optimal<br>
<br>
"Finished"<br>
CouenneRecordBestSol::getModSol(): ### ERROR: expectedCard: -1 cardModSol: 121<br>
[ 4.57] Pyomo Finished<br>
ERROR: Unexpected exception while running model:<br>
Solver (asl) did not exit normally<br>
</div>
<div> </div>
<div> </div>
<div> </div>
<div> </div></div></div>
<br>_______________________________________________<br>
Couenne mailing list<br>
<a href="mailto:Couenne@list.coin-or.org">Couenne@list.coin-or.org</a><br>
<a href="http://list.coin-or.org/mailman/listinfo/couenne" rel="noreferrer" target="_blank">http://list.coin-or.org/mailman/listinfo/couenne</a><br></blockquote></div><br></div>