[Couenne] Error with CouenneRecordBestSol
Luca Mencarelli
mencarelli at lix.polytechnique.fr
Mon May 30 11:00:34 EDT 2016
Dear all,
Is it possible passing the options to Couenne with "option couenne_option"
(e.g. option couenne_option root node) directly in the Ampl .run file?
Thanks in advance Best regards,
Luca Mencarelli
--
"Qu'est-ce qu'un homme révolté ? Un homme qui dit non. Mais s'il refuse,
il ne renonce pas : c'est aussi un homme qui dit oui, dès son premier
mouvement." Albert Camus, L'Homme Révolté (1951).
---------------------------------------------------------
Luca Mencarelli
PhD Candidate at LIX (UMR 7161), Ecole Polytechnique
91128 Palaiseau CEDEX, France
Office: 2072 (Bâtiment Alan Turing, second floor)
LIX e-mail address: mencarelli at lix.polytechnique.fr
INRIA e-mail address: luca.mencarelli at inria.fr
Twitter: @l_mencarelli
> Hi Christian,
>
> 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?
>
> 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.
>
> Regards,
> Pietro
>
> On Tue, May 3, 2016 at 10:30 AM, "Christian Schröder" <
> Chris.Schroed1991 at web.de> wrote:
>
>> Hello,
>>
>> i tried to solve a model with Couenne using Pyomo for modeling and got
>> an
>> error message i dont understand.
>> Couenne finds a integer solution and finishes optimal. Still the last
>> line
>> from the output says:
>>
>> CoenneRecordBestSol::getModSol(): ###ERROR: expectedCard: -1 cardModSol:
>> 121
>>
>> Could you help me out?
>>
>> Regards,
>> Christian
>>
>>
>> complete output:
>> ####################################################
>> !pyomo solve --solver=couenne model_1.py
>> [ 0.00] Setting up Pyomo environment
>> [ 0.00] Applying Pyomo preprocessing actions
>> [ 0.01] Creating model
>> [ 0.03] Applying solver
>> ERROR: "[base]\pyomo-4.3.11329-py2.7.egg\pyomo\opt\base\solvers.py",
>> 570,
>> solve
>> Solver (asl) returned non-zero return code (1)
>> ERROR: "[base]\pyomo-4.3.11329-py2.7.egg\pyomo\opt\base\solvers.py",
>> 575,
>> solve
>> Solver log:
>> Couenne 0.4.7 -- an Open-Source solver for Mixed Integer
>> Nonlinear Optimization
>> Mailing list: couenne at list.coin-or.org
>> Instructions: http://www.coin-or.org/Couenne
>>
>> NLP0012I
>> Num Status Obj It time
>> Location
>> NLP0014I 1 OPT 1.1975299 124 0.231
>> Coin0506I Presolve 126 (-32) rows, 74 (-47) columns and 350
>> (-79)
>> elements
>> Clp0006I 0 Obj 1.92 Primal inf 369.47823 (20) Dual inf
>> 26.380188
>> (2)
>> Clp0006I 38 Obj 0.96
>> Clp0000I Optimal - objective value 0.96
>> Clp0032I Optimal objective 0.96 - 38 iterations time 0.002,
>> Presolve 0.00
>> Clp0000I Optimal - objective value 0.96
>> NLP0014I 2 INFEAS 0.017486949 34 0.055
>> Clp0000I Optimal - objective value 0.96
>> Cbc0031I 4 added rows had average density of 2.5
>> Cbc0013I At root node, 4 cuts changed objective from 0.96 to
>> 0.96328023 in 4 passes
>> Cbc0014I Cut generator 0 (Couenne convexifier cuts) - 12 row
>> cuts
>> average 2.6 elements, 2 column cuts (6 active)
>> Cbc0010I After 0 nodes, 0 on tree, 1e+050 best solution, best
>> possible 0.96328023 (0.32 seconds)
>> Cbc0010I After 100 nodes, 44 on tree, 1e+050 best solution, best
>> possible 1.2 (2.32 seconds)
>> Cbc0004I Integer solution of 1.8970508 found after 974
>> iterations
>> and 115 nodes (2.35 seconds)
>> Cbc0010I After 200 nodes, 54 on tree, 1.8970508 best solution,
>> best possible 1.2 (2.82 seconds)
>> Cbc0010I After 300 nodes, 86 on tree, 1.8970508 best solution,
>> best possible 1.2 (3.18 seconds)
>> Cbc0010I After 400 nodes, 130 on tree, 1.8970508 best solution,
>> best possible 1.2 (3.38 seconds)
>> Cbc0004I Integer solution of 1.44 found after 3500 iterations
>> and
>> 468 nodes (3.52 seconds)
>> Cbc0010I After 500 nodes, 57 on tree, 1.44 best solution, best
>> possible 1.2261503 (3.57 seconds)
>> Cbc0010I After 600 nodes, 54 on tree, 1.44 best solution, best
>> possible 1.2355182 (3.81 seconds)
>> Cbc0010I After 700 nodes, 20 on tree, 1.44 best solution, best
>> possible 1.2636993 (3.96 seconds)
>> Cbc0010I After 800 nodes, 1 on tree, 1.44 best solution, best
>> possible 1.4379178 (4.24 seconds)
>> Cbc0001I Search completed - best objective 1.44, took 5821
>> iterations and 802 nodes (4.24 seconds)
>> Cbc0035I Maximum depth 57, 5 variables fixed on reduced cost
>>
>> couenne: Optimal
>>
>> "Finished"
>> CouenneRecordBestSol::getModSol(): ### ERROR: expectedCard: -1
>> cardModSol: 121
>> [ 4.57] Pyomo Finished
>> ERROR: Unexpected exception while running model:
>> Solver (asl) did not exit normally
>>
>>
>>
>>
>>
>>
>> _______________________________________________
>> Couenne mailing list
>> Couenne at list.coin-or.org
>> http://list.coin-or.org/mailman/listinfo/couenne
>>
> _______________________________________________
> Couenne mailing list
> Couenne at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/couenne
More information about the Couenne
mailing list