[Scip] no call made to the pricer

Wed Apr 16 18:44:06 CEST 2014

Hi Shahin,

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).

Best,
Gerald

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

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://listserv.zib.de/pipermail/scip/attachments/20140416/967e1e97/attachment.html>