--- Job rgn Start 10/03/08 05:36:44 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 --- rgn.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/rgn.gdx --- rgn.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.007 --- rgn.gms(123) 4 Mb --- Generating MIP model m --- rgn.gms(124) 4 Mb --- 25 rows 181 columns 541 non-zeroes --- 100 discrete-columns --- Executing SCIP: elapsed 0:00:00.011 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) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 4 clqs (round 2) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 4 upgd conss, 0 impls, 4 clqs presolving (3 rounds): 5 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 70 implications, 4 cliques presolved problem has 175 variables (100 bin, 0 int, 0 impl, 75 cont) and 24 constraints 4 constraints of type 20 constraints of type Presolving Time: 0.02 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 86 | 408k| 0 | 4.880000e+01 | -- | Inf F 1 | 0 | 196 | 417k| 0 | 4.880000e+01 | 8.220000e+01 | 68.44% 1 | 0 | 237 | 506k| 0 | 5.987097e+01 | 8.220000e+01 | 37.30% 1 | 0 | 282 | 541k| 0 | 6.628571e+01 | 8.220000e+01 | 24.01% 1 | 0 | 361 | 578k| 0 | 6.892591e+01 | 8.220000e+01 | 19.26% 1 | 0 | 380 | 608k| 0 | 6.980546e+01 | 8.220000e+01 | 17.76% 1 | 0 | 412 | 634k| 0 | 7.065439e+01 | 8.220000e+01 | 16.34% 1 | 0 | 449 | 654k| 0 | 7.212736e+01 | 8.220000e+01 | 13.97% 1 | 0 | 487 | 670k| 0 | 7.348340e+01 | 8.220000e+01 | 11.86% 1 | 0 | 519 | 693k| 0 | 7.455622e+01 | 8.220000e+01 | 10.25% 1 | 0 | 547 | 704k| 0 | 7.565635e+01 | 8.220000e+01 | 8.65% 1 | 0 | 591 | 730k| 0 | 7.691948e+01 | 8.220000e+01 | 6.86% 1 | 0 | 608 | 731k| 0 | 7.794545e+01 | 8.220000e+01 | 5.46% E 1 | 0 | 677 | 734k| 0 | 7.794545e+01 | 8.220000e+01 | 5.46% (run 1, node 1) restarting after 60 global fixings of integer variables (restart) converted 121 cuts from the global cut pool into linear constraints presolving: (round 1) 60 del vars, 4 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 0 upgd conss, 70 impls, 4 clqs (round 2) 60 del vars, 4 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 9 upgd conss, 70 impls, 4 clqs presolving (3 rounds): 60 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 0 changed coefficients 70 implications, 4 cliques presolved problem has 115 variables (40 bin, 0 int, 0 impl, 75 cont) and 141 constraints 9 constraints of type 4 constraints of type 128 constraints of type Presolving Time: 0.02 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 825 | 675k| 0 | 7.794545e+01 | 8.220000e+01 | 5.46% 1 | 0 | 829 | 679k| 0 | 7.794545e+01 | 8.220000e+01 | 5.46% 1 | 2 | 829 | 680k| 0 | 7.794545e+01 | 8.220000e+01 | 5.46% c 4 | 5 | 876 | 699k| 3 | 7.860000e+01 | 8.220000e+01 | 4.58% * 39 | 12 | 1253 | 704k| 18 | 7.885361e+01 | 8.220000e+01 | 4.24% 100 | 11 | 1846 | 723k| 18 | 7.885361e+01 | 8.220000e+01 | 4.24% * 187 | 24 | 2472 | 743k| 18 | 7.981739e+01 | 8.220000e+01 | 2.99% 200 | 27 | 2574 | 745k| 18 | 7.981739e+01 | 8.220000e+01 | 2.99% s 248 | 41 | 2978 | 763k| 24 | 7.981739e+01 | 8.220000e+01 | 2.99% 300 | 41 | 3365 | 776k| 24 | 7.981739e+01 | 8.220000e+01 | 2.99% 400 | 51 | 3996 | 793k| 24 | 8.000869e+01 | 8.220000e+01 | 2.74% 500 | 61 | 4604 | 812k| 24 | 8.121818e+01 | 8.220000e+01 | 1.21% 600 | 49 | 5170 | 816k| 24 | 8.180000e+01 | 8.220000e+01 | 0.49% 700 | 37 | 5657 | 811k| 25 | 8.180000e+01 | 8.220000e+01 | 0.49% 800 | 31 | 6179 | 806k| 25 | 8.180000e+01 | 8.220000e+01 | 0.49% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 900 | 17 | 6643 | 805k| 25 | 8.180000e+01 | 8.220000e+01 | 0.49% 1000 | 7 | 7056 | 801k| 25 | 8.183636e+01 | 8.220000e+01 | 0.44% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 1.42 Solving Nodes : 1009 (total of 1010 nodes in 2 runs) Primal Bound : +8.21999972328572e+01 (47 solutions) Dual Bound : +8.21999972328572e+01 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 1.42 Original Problem : Problem name : gamsmodel Variables : 180 (100 binary, 0 integer, 0 implicit integer, 80 continuous) Constraints : 24 initial, 24 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 115 (40 binary, 0 integer, 0 implicit integer, 75 continuous) Constraints : 141 initial, 141 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 60 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.01 0 0 0 0 0 0 0 0 varbound : 0.00 0 0 0 0 0 0 0 0 setppc : 0.00 0 0 0 0 0 0 0 0 linear : 0.01 0 5 0 0 0 4 4 0 root node : - 71 - - 121 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 631 0 36 120 0 0 1014 varbound : 9 1 1615 0 0 0 183 0 0 0 setppc : 4 13 2206 2 0 0 3301 0 0 0 linear : 128 13 2403 2 0 0 2896 0 0 0 countsols : 0 0 0 2 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.15 0.00 0.00 0.15 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 setppc : 0.00 0.00 0.00 0.00 0.00 linear : 0.16 0.00 0.16 0.00 0.00 countsols : 0.00 0.00 0.00 0.00 0.00 Propagators : Time Calls Cutoffs DomReds rootredcost : 0.00 4 0 20 pseudoobj : 0.02 2219 0 2320 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 0 0 0 0.0 0 0.0 - infeasible LP : 0.00 1 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 : - - - 0 0.0 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 0 - - 0 - (maximal pool size: 3) redcost : 0.00 700 0 285 0 0 impliedbounds : 0.00 13 0 0 14 0 intobj : 0.00 0 0 0 0 0 gomory : 0.01 13 0 0 15 0 strongcg : 0.01 13 0 0 0 0 cmir : 0.19 11 0 0 273 0 flowcover : 0.05 11 0 0 73 0 clique : 0.00 13 0 0 0 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 : 0.15 629 36 120 0 0 1014 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 - 2 pseudo solutions : 0.00 - 0 oneopt : 0.00 5 0 feaspump : 0.01 1 1 veclendiving : 0.01 4 0 linesearchdiving : 0.02 4 0 coefdiving : 0.01 5 1 pscostdiving : 0.01 5 0 fracdiving : 0.02 5 0 guideddiving : 0.01 5 0 crossover : 0.03 2 2 objpscostdiving : 0.01 3 3 rootsoldiving : 0.01 3 3 simplerounding : 0.00 0 0 rounding : 0.01 320 0 shifting : 0.02 83 34 intshifting : 0.01 5 0 fixandinfer : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.03 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.00 0 0 0.00 - dual LP : 0.51 1312 6246 4.76 12247.06 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.10 163 855 5.25 8550.00 strong branching : 0.15 435 4839 11.12 32260.00 (at root node) : - 10 268 26.80 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 2 nodes : 1009 nodes (total) : 1010 nodes left : 0 max depth : 25 max depth (total): 25 backtracks : 258 (25.6%) delayed cutoffs : 0 repropagations : 4 (14 domain reductions, 0 cutoffs) avg switch length: 4.76 switching time : 0.04 Solution : Solutions found : 47 (6 improvements) Primal Bound : +8.21999972328572e+01 (in run 2, after 248 nodes, 0.80 seconds, depth 20, found by ) Dual Bound : +8.21999972328572e+01 Gap : 0.00 % Root Dual Bound : +7.79454521861157e+01 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- rgn.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job rgn.gms Stop 10/03/08 05:36:45 elapsed 0:00:01.500