--- Job rlp2 Start 10/03/08 05:36:45 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G080908/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- rlp2.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/rlp2.gdx --- rlp2.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.028 --- rlp2.gms(123) 4 Mb --- Generating MIP model m --- rlp2.gms(124) 4 Mb --- 69 rows 452 columns 5,397 non-zeroes --- 450 discrete-columns --- rlp2.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.042 SCIP version 1.10.0 [LP solver: Clp 1.8stable] Copyright (c) 2002-2008 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB) Optionfile /home/stefan/work/gams/benchmarks/LINLib.MIP/scip.opt successfully read. Starting MIP solve... presolving: (round 1) 0 del vars, 6 del conss, 0 chg bounds, 6 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 10 clqs (round 2) 0 del vars, 6 del conss, 1 chg bounds, 6 chg sides, 0 chg coeffs, 23 upgd conss, 0 impls, 10 clqs (round 3) 50 del vars, 6 del conss, 1 chg bounds, 6 chg sides, 0 chg coeffs, 23 upgd conss, 14478 impls, 10 clqs (round 4) 99 del vars, 6 del conss, 1 chg bounds, 6 chg sides, 0 chg coeffs, 23 upgd conss, 20405 impls, 10 clqs presolving (5 rounds): 99 deleted vars, 6 deleted constraints, 1 tightened bounds, 0 added holes, 6 changed sides, 0 changed coefficients 20405 implications, 10 cliques presolved problem has 352 variables (351 bin, 0 int, 1 impl, 0 cont) and 62 constraints 13 constraints of type 10 constraints of type 39 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.30 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 159 |2074k| 0 | 1.036582e+01 | -- | Inf 1 | 0 | 603 |2093k| 0 | 1.100000e+01 | -- | Inf 1 | 0 | 797 |2241k| 0 | 1.318182e+01 | -- | Inf 1 | 0 | 818 |2234k| 0 | 1.400000e+01 | -- | Inf 1 | 0 | 891 |2320k| 0 | 1.400000e+01 | -- | Inf 1 | 0 | 937 |2383k| 0 | 1.400000e+01 | -- | Inf 1 | 0 | 1049 |2404k| 0 | 1.400000e+01 | -- | Inf s 1 | 0 | 1049 |2411k| 0 | 1.400000e+01 | 7.000000e+01 | 400.00% 1 | 0 | 1143 |2445k| 0 | 1.400000e+01 | 7.000000e+01 | 400.00% 1 | 0 | 1226 |2481k| 0 | 1.400000e+01 | 7.000000e+01 | 400.00% 1 | 0 | 1294 |2494k| 0 | 1.400000e+01 | 7.000000e+01 | 400.00% s 1 | 0 | 1294 |2500k| 0 | 1.400000e+01 | 5.500000e+01 | 292.86% E 1 | 0 | 1294 |2507k| 0 | 1.400000e+01 | 1.900000e+01 | 35.71% 1 | 0 | 1294 |2507k| 0 | 1.400000e+01 | 1.900000e+01 | 35.71% 1 | 0 | 1359 |2531k| 0 | 1.400000e+01 | 1.900000e+01 | 35.71% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 2 | 1359 |2532k| 0 | 1.400000e+01 | 1.900000e+01 | 35.71% 100 | 7 | 3946 |2552k| 12 | 1.400000e+01 | 1.900000e+01 | 35.71% 200 | 7 | 5510 |2564k| 18 | 1.400000e+01 | 1.900000e+01 | 35.71% 300 | 9 | 7553 |2568k| 19 | 1.405195e+01 | 1.900000e+01 | 35.21% 400 | 9 | 8799 |2569k| 28 | 1.474194e+01 | 1.900000e+01 | 28.88% 500 | 7 | 9928 |2570k| 35 | 1.474194e+01 | 1.900000e+01 | 28.88% 600 | 5 | 11151 |2571k| 35 | 1.474194e+01 | 1.900000e+01 | 28.88% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 4.54 Solving Nodes : 655 Primal Bound : +1.90000000000000e+01 (3 solutions) Dual Bound : +1.90000000000000e+01 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 4.54 Original Problem : Problem name : gamsmodel Variables : 451 (450 binary, 0 integer, 0 implicit integer, 1 continuous) Constraints : 68 initial, 68 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 352 (351 binary, 0 integer, 1 implicit integer, 0 continuous) Constraints : 62 initial, 90 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 0 0 0 0 0 0 0 0 dualfix : 0.00 0 0 0 0 0 0 0 0 boundshift : 0.00 0 0 0 0 0 0 0 0 inttobinary : 0.00 0 0 0 0 0 0 0 0 implics : 0.00 0 0 0 0 0 0 0 0 probing : 0.27 99 0 0 0 0 0 0 0 knapsack : 0.02 0 0 0 0 0 0 0 0 setppc : 0.00 0 0 0 0 0 0 0 0 linear : 0.01 0 0 0 1 0 6 6 0 logicor : 0.00 0 0 0 0 0 0 0 0 root node : - 46 - - 53 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 833 0 48 724 0 0 654 knapsack : 13 8 3249 0 0 83 5535 23 0 0 setppc : 10 8 3166 0 0 43 8589 0 0 0 linear : 39 8 3123 0 0 0 3312 0 0 0 logicor : 0+ 0 426 0 0 0 27 0 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 2.31 0.00 0.00 2.31 0.00 knapsack : 0.04 0.00 0.04 0.00 0.00 setppc : 0.01 0.00 0.01 0.00 0.00 linear : 0.26 0.00 0.26 0.00 0.00 logicor : 0.00 0.00 0.00 0.00 0.00 countsols : 0.00 0.00 0.00 0.00 0.00 Propagators : Time Calls Cutoffs DomReds rootredcost : 0.00 0 0 0 pseudoobj : 0.00 2033 0 7 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.01 27 25 56 39.8 0 0.0 - infeasible LP : 0.00 331 0 0 0.0 0 0.0 0 bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0 strong branching : 0.00 0 0 0 0.0 0 0.0 0 pseudo solution : 0.00 0 0 0 0.0 0 0.0 - applied globally : - - - 28 14.0 - - - applied locally : - - - 4 60.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 7 - - 139 - (maximal pool size: 393) redcost : 0.03 831 0 2615 0 0 impliedbounds : 0.00 8 0 0 50 0 intobj : 0.00 0 0 0 0 0 gomory : 0.07 8 0 0 8 0 strongcg : 0.06 8 0 0 7 0 cmir : 0.10 8 0 0 198 0 flowcover : 0.13 8 0 0 296 0 clique : 0.01 8 0 0 40 0 zerohalf : 0.00 0 0 0 0 0 mcf : 0.00 0 0 0 0 0 Pricers : Time Calls Vars problem variables: 0.00 0 0 Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children relpscost : 2.31 833 48 724 0 0 654 pscost : 0.00 0 0 0 0 0 0 inference : 0.00 0 0 0 0 0 0 mostinf : 0.00 0 0 0 0 0 0 leastinf : 0.00 0 0 0 0 0 0 fullstrong : 0.00 0 0 0 0 0 0 allfullstrong : 0.00 0 0 0 0 0 0 random : 0.00 0 0 0 0 0 0 Primal Heuristics : Time Calls Found LP solutions : 0.00 - 0 pseudo solutions : 0.00 - 0 intshifting : 0.00 0 0 oneopt : 0.00 1 0 feaspump : 0.03 1 0 crossover : 0.01 1 0 pscostdiving : 0.02 4 0 coefdiving : 0.01 4 0 fracdiving : 0.01 4 0 veclendiving : 0.02 4 0 linesearchdiving : 0.03 4 0 guideddiving : 0.03 4 0 simplerounding : 0.00 0 0 rounding : 0.01 375 0 shifting : 0.06 102 2 fixandinfer : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 objpscostdiving : 0.01 3 0 rootsoldiving : 0.03 3 0 octane : 0.00 0 0 rens : 0.08 1 1 rins : 0.00 0 0 localbranching : 0.00 0 0 mutation : 0.00 0 0 dins : 0.00 0 0 LP : Time Calls Iterations Iter/call Iter/sec primal LP : 0.01 0 0 0.00 - dual LP : 0.98 1085 10997 10.14 11221.43 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.16 179 992 5.54 6200.00 strong branching : 2.30 1555 46587 29.96 20255.22 (at root node) : - 26 3230 124.23 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 655 nodes (total) : 655 nodes left : 0 max depth : 40 max depth (total): 40 backtracks : 60 (9.2%) delayed cutoffs : 0 repropagations : 65 (20 domain reductions, 0 cutoffs) avg switch length: 3.30 switching time : 0.06 Solution : Solutions found : 3 (3 improvements) Primal Bound : +1.90000000000000e+01 (in run 1, after 1 nodes, 0.80 seconds, depth 0, found by ) Dual Bound : +1.90000000000000e+01 Gap : 0.00 % Root Dual Bound : +1.40000000000000e+01 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- rlp2.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job rlp2.gms Stop 10/03/08 05:36:50 elapsed 0:00:04.704