<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
<div class="moz-cite-prefix">Hi Shahin,<br>
<br>
you compiled SCIP without linking to an LP solver (you used
LPS=none). Therefore, no LPs are solved and your pricer is not
called. Please compile again and link to an LP solver, e.g.,
SoPlex, which comes with the SCIP Optimization Suite (LPS=spx).<br>
<br>
Best,<br>
Gerald<br>
<br>
On 16.04.2014 17:27, Shahin Gelareh wrote:<br>
</div>
<blockquote
cite="mid:CA+r-pT7rtDmnHrFpgxcq6DZAd-MFOSrESaKkh_vKd5A2wdaoNw@mail.gmail.com"
type="cite">
<div dir="ltr">
<div>
<div>Dear SCIPers <br>
</div>
<br>
</div>
<div>I have a problem in form of:<br>
</div>
<div>min cx<br>
</div>
<div> Az = a<br>
</div>
<div> x<= z<br>
</div>
<div> Bx = b<br>
</div>
<div>for which I am trying to design a branch and price in SCIP.<br>
</div>
<div>I put Bx = b in the subproblem.<br>
<br>
</div>
<div>The master problem then turn to<br>
<div>min cx<br>
</div>
<div> Az = a<br>
</div>
x<= z<br>
</div>
<div>in the space of z primals and x written in lambdas.<br>
<br>
</div>
<div>The pricer is adeed and initialized<br>
SCIP_CALL( SCIPincludeObjPricer(scip,
hrp_pricer_ptr, true) );<br>
/* activate pricer */<br>
SCIP_CALL( SCIPactivatePricer(scip,
SCIPfindPricer(scip, HRP_PRICER_NAME)) );<br>
</div>
<div>The constructure is called and the scip_init is called.<br>
</div>
<div>but then the pricer never gets called and I have the
following log.<br>
</div>
<div><br>
</div>
<div>I guess I am missing something but when I compare with the
examples supplied with SCIP, I cannot detect what is missing.
<br>
</div>
<div>I would appreciate constructive comments on this.<br>
<br>
</div>
<div>Cheers<br>
</div>
<div>Shahin<br>
</div>
<div><br>
<br>
<br>
<br>
SCIP version 3.1.0 [precision: 8 byte] [memory: block] [mode:
debug] [LP solver: NONE] [GitHash: 577ee45]<br>
Copyright (c) 2002-2014 Konrad-Zuse-Zentrum fuer
Informationstechnik Berlin (ZIB)<br>
<br>
LP Solver <NONE>: upper objective limit cannot be set --
can lead to unnecessary simplex iterations<br>
LP Solver <NONE>: primal feasibility tolerance cannot be
set -- tolerance of SCIP and LP solver may differ<br>
LP Solver <NONE>: dual feasibility tolerance cannot be
set -- tolerance of SCIP and LP solver may differ<br>
LP Solver <NONE>: barrier convergence tolerance cannot
be set -- tolerance of SCIP and LP solver may differ<br>
LP Solver <NONE>: fastmip setting not available -- SCIP
parameter has no effect<br>
LP Solver <NONE>: scaling not available -- SCIP
parameter has no effect<br>
LP Solver <NONE>: presolving not available -- SCIP
parameter has no effect<br>
LP Solver <NONE>: iteration limit cannot be set -- can
lead to unnecessary simplex iterations<br>
LP Solver <NONE>: pricing strategy cannot be set -- SCIP
parameter has no effect<br>
LP Solver <NONE>: lpinfo setting not available -- SCIP
parameter has no effect<br>
LP Solver <NONE>: row representation of the basis not
available -- SCIP parameter lp/rowrepswitch has no effect<br>
LP Solver <NONE>: condition number limit for the basis
not available -- SCIP parameter lp/conditionlimit has no
effect<br>
LP Solver <NONE>: number of threads settings not
available -- SCIP parameter has no effect<br>
transformed problem has 1180 variables (1000 bin, 0 int, 0
impl, 180 cont) and 15532 constraints<br>
15532 constraints of type <linear><br>
<br>
original problem has 82770 active (0.45161%) nonzeros and
82770 (0.45161%) check nonzeros<br>
<br>
presolving:<br>
(round 1) 90 del vars, 46 del conss, 0 add conss, 0 chg
bounds, 0 chg sides, 0 chg coeffs, 2155 upgd conss, 5220
impls, 235 clqs<br>
(6.1s) probing: 100/1000 (10.0%) - 0 fixings, 0
aggregations, 23905 implications, 0 bound changes<br>
(9.7s) probing: 200/1000 (20.0%) - 0 fixings, 0
aggregations, 46992 implications, 0 bound changes<br>
(13.2s) probing: 300/1000 (30.0%) - 0 fixings, 0
aggregations, 67288 implications, 0 bound changes<br>
(16.4s) probing: 400/1000 (40.0%) - 0 fixings, 0
aggregations, 84793 implications, 0 bound changes<br>
(19.5s) probing: 500/1000 (50.0%) - 0 fixings, 0
aggregations, 99507 implications, 0 bound changes<br>
(22.5s) probing: 600/1000 (60.0%) - 0 fixings, 0
aggregations, 111430 implications, 0 bound changes<br>
(25.4s) probing: 700/1000 (70.0%) - 0 fixings, 0
aggregations, 120562 implications, 0 bound changes<br>
(27.9s) probing: 800/1000 (80.0%) - 0 fixings, 0
aggregations, 126903 implications, 0 bound changes<br>
(30.3s) probing: 900/1000 (90.0%) - 0 fixings, 0
aggregations, 130436 implications, 0 bound changes<br>
(32.3s) probing: 1000/1000 (100.0%) - 0 fixings, 0
aggregations, 131355 implications, 0 bound changes<br>
(32.3s) probing cycle finished: starting next cycle<br>
(32.3s) probing: 1/1000 (0.1%) - 0 fixings, 0 aggregations,
131355 implications, 0 bound changes<br>
(32.3s) probing aborted: 1000/1000 successive useless
probings<br>
(round 2) 90 del vars, 246 del conss, 20 add conss, 0 chg
bounds, 0 chg sides, 0 chg coeffs, 2155 upgd conss, 511830
impls, 235 clqs<br>
(round 3) 90 del vars, 1866 del conss, 20 add conss, 0 chg
bounds, 0 chg sides, 0 chg coeffs, 2155 upgd conss, 511830
impls, 235 clqs<br>
<br>
presolved problem has 78260 active (0.52461%) nonzeros and
78260 (0.52461%) check nonzeros<br>
<br>
presolving (4 rounds):<br>
90 deleted vars, 1866 deleted constraints, 20 added
constraints, 0 tightened bounds, 0 added holes, 0 changed
sides, 0 changed coefficients<br>
511830 implications, 235 cliques<br>
presolved problem has 1090 variables (1000 bin, 0 int, 0 impl,
90 cont) and 13686 constraints<br>
10 constraints of type <knapsack><br>
325 constraints of type <setppc><br>
20 constraints of type <and><br>
13331 constraints of type <linear><br>
Presolving Time: 32.25<br>
<br>
(node 1) unresolved numerical troubles in LP 0 -- using pseudo
solution instead (loop 1)<br>
time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars
|cons |cols |rows |cuts |confs|strbr| dualbound |
primalbound | gap<br>
32.5s| 1 | 2 | 0 | - | 38M| 0 | - |1090
| 13k|1090 | 13k| 0 | 0 | 0 | -- |
-- | Inf<br>
(node 2) unresolved numerical troubles in LP 0 -- using pseudo
solution instead (loop 1)<br>
(node 3) unresolved numerical troubles in LP 0 -- using pseudo
solution instead (loop 1)<br>
(node 4) unresolved numerical troubles in LP 0 -- using pseudo
solution instead (loop 1)<br>
(node 5) unresolved numerical troubles in LP 0 -- using pseudo
solution instead (loop 1)<br>
(node 6) unresolved numerical troubles in LP 0 -- using pseudo
solution instead (loop 1)<br>
(node 7) unresolved numerical troubles in LP 0 -- using pseudo
solution instead (loop 1)<br>
(node 8) unresolved numerical troubles in LP 0 -- using pseudo
solution instead (loop 1)<br>
(node 9) unresolved numerical troubles in LP 0 -- using pseudo
solution instead (loop 1)<br>
(node 11) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 13) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 14) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 15) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 16) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 17) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 18) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 19) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 20) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 21) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 23) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 24) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 25) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 26) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 27) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 28) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 29) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 31) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 33) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 35) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 36) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 37) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 38) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 39) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 40) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 41) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 42) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 43) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 45) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 46) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 47) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 48) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 49) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 50) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 51) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 52) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 53) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 54) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 55) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 56) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 57) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 58) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 59) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 60) unresolved numerical troubles in LP 0 -- using
pseudo solution instead (loop 1)<br>
(node 60) forcing the solution of an LP (last LP 0)...<br>
[..\..\scipoptsuite\scip\src\scip\solve.c:3415] ERROR: (node
60) unresolved numerical troubles in LP 0 cannot be dealt with<br>
[..\..\scipoptsuite\scip\src\scip\solve.c:3681] ERROR: Error
<-6> in function call<br>
[..\..\scipoptsuite\scip\src\scip\solve.c:4312] ERROR: Error
<-6> in function call<br>
[..\..\scipoptsuite\scip\src\scip\scip.c:13633] ERROR: Error
<-6> in function call<br>
[d:\work\project\hlprouting\hrp-scip\hrp_main.cpp:180] ERROR:
Error <-6> in function call<br>
Press any key to continue . . .<br>
<br>
<br>
</div>
<div><br>
<br>
<br>
</div>
</div>
<br>
<fieldset class="mimeAttachmentHeader"></fieldset>
<br>
<pre wrap="">_______________________________________________
Scip mailing list
<a class="moz-txt-link-abbreviated" href="mailto:Scip@zib.de">Scip@zib.de</a>
<a class="moz-txt-link-freetext" href="http://listserv.zib.de/mailman/listinfo/scip">http://listserv.zib.de/mailman/listinfo/scip</a>
</pre>
</blockquote>
<br>
</body>
</html>