--- Job p2756 Start 10/03/08 03:55:55 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 --- p2756.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p2756.gdx --- p2756.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.046 --- p2756.gms(123) 4 Mb --- Generating MIP model m --- p2756.gms(124) 5 Mb --- 756 rows 2,757 columns 11,104 non-zeroes --- 2,756 discrete-columns --- p2756.gms(124) 5 Mb --- Executing SCIP: elapsed 0:00:00.092 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) 33 del vars, 33 del conss, 15 chg bounds, 190 chg sides, 469 chg coeffs, 0 upgd conss, 264 impls, 220 clqs (round 2) 75 del vars, 46 del conss, 17 chg bounds, 209 chg sides, 525 chg coeffs, 0 upgd conss, 264 impls, 220 clqs (round 3) 107 del vars, 51 del conss, 17 chg bounds, 218 chg sides, 541 chg coeffs, 0 upgd conss, 264 impls, 219 clqs (round 4) 107 del vars, 52 del conss, 17 chg bounds, 218 chg sides, 541 chg coeffs, 526 upgd conss, 264 impls, 219 clqs (round 5) 107 del vars, 52 del conss, 17 chg bounds, 924 chg sides, 1953 chg coeffs, 698 upgd conss, 1710 impls, 219 clqs (round 6) 107 del vars, 134 del conss, 17 chg bounds, 1415 chg sides, 2939 chg coeffs, 702 upgd conss, 2556 impls, 284 clqs (round 7) 111 del vars, 148 del conss, 17 chg bounds, 1677 chg sides, 3492 chg coeffs, 702 upgd conss, 3080 impls, 284 clqs (round 8) 111 del vars, 163 del conss, 17 chg bounds, 1679 chg sides, 3498 chg coeffs, 702 upgd conss, 3080 impls, 284 clqs (0.5s) probing: 1000/2645 (37.8%) - 12 fixings, 0 aggregations, 57 implications, 0 bound changes (0.5s) probing: 1100/2645 (41.6%) - 12 fixings, 0 aggregations, 57 implications, 0 bound changes (0.5s) probing aborted: 100/100 successive totally useless probings (round 9) 123 del vars, 163 del conss, 17 chg bounds, 1679 chg sides, 3498 chg coeffs, 702 upgd conss, 3194 impls, 284 clqs (round 10) 123 del vars, 232 del conss, 17 chg bounds, 1679 chg sides, 3498 chg coeffs, 702 upgd conss, 3194 impls, 284 clqs (round 11) 243 del vars, 314 del conss, 17 chg bounds, 1679 chg sides, 3498 chg coeffs, 702 upgd conss, 3194 impls, 274 clqs (0.5s) probing: 1207/2645 (45.6%) - 17 fixings, 0 aggregations, 80 implications, 0 bound changes (0.5s) probing aborted: 100/100 successive totally useless probings (round 12) 248 del vars, 314 del conss, 17 chg bounds, 1679 chg sides, 3498 chg coeffs, 702 upgd conss, 3240 impls, 274 clqs (round 13) 248 del vars, 321 del conss, 17 chg bounds, 1679 chg sides, 3500 chg coeffs, 702 upgd conss, 3240 impls, 274 clqs (round 14) 307 del vars, 374 del conss, 17 chg bounds, 1704 chg sides, 3546 chg coeffs, 702 upgd conss, 3240 impls, 268 clqs (round 15) 313 del vars, 385 del conss, 17 chg bounds, 1704 chg sides, 3546 chg coeffs, 702 upgd conss, 3240 impls, 266 clqs (round 16) 315 del vars, 386 del conss, 17 chg bounds, 1706 chg sides, 3548 chg coeffs, 702 upgd conss, 3240 impls, 266 clqs (round 17) 317 del vars, 387 del conss, 17 chg bounds, 1706 chg sides, 3548 chg coeffs, 702 upgd conss, 3240 impls, 266 clqs (0.6s) probing: 1217/2645 (46.0%) - 17 fixings, 0 aggregations, 80 implications, 0 bound changes (0.6s) probing aborted: 100/100 successive totally useless probings presolving (18 rounds): 317 deleted vars, 387 deleted constraints, 17 tightened bounds, 0 added holes, 1706 changed sides, 3548 changed coefficients 3240 implications, 266 cliques presolved problem has 2439 variables (2439 bin, 0 int, 0 impl, 0 cont) and 1758 constraints 309 constraints of type 1330 constraints of type 1 constraints of type 118 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.57 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 330 |7908k| 0 | 2.704483e+03 | -- | Inf s 1 | 0 | 330 |8010k| 0 | 2.704483e+03 | 6.354100e+04 |2249.47% 1 | 0 | 511 |8323k| 0 | 3.059486e+03 | 6.354100e+04 |1976.85% s 1 | 0 | 511 |8357k| 0 | 3.059486e+03 | 5.336000e+03 | 74.41% 1 | 0 | 556 |7977k| 0 | 3.111287e+03 | 5.336000e+03 | 71.50% s 1 | 0 | 556 |8011k| 0 | 3.111287e+03 | 4.881000e+03 | 56.88% 1 | 0 | 572 |8026k| 0 | 3.112997e+03 | 4.881000e+03 | 56.79% s 1 | 0 | 572 |8060k| 0 | 3.112997e+03 | 3.285000e+03 | 5.53% 1 | 0 | 590 |7967k| 0 | 3.115863e+03 | 3.285000e+03 | 5.43% 1 | 0 | 601 |8032k| 0 | 3.117371e+03 | 3.285000e+03 | 5.38% 1 | 0 | 607 |8116k| 0 | 3.117434e+03 | 3.285000e+03 | 5.38% 1 | 0 | 618 |8182k| 0 | 3.117838e+03 | 3.285000e+03 | 5.36% 1 | 0 | 625 |8273k| 0 | 3.117933e+03 | 3.285000e+03 | 5.36% 1 | 0 | 642 |8331k| 0 | 3.118221e+03 | 3.285000e+03 | 5.35% 1 | 0 | 660 |8381k| 0 | 3.118328e+03 | 3.285000e+03 | 5.34% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 688 |8402k| 0 | 3.118435e+03 | 3.285000e+03 | 5.34% 1 | 0 | 727 |8421k| 0 | 3.118568e+03 | 3.285000e+03 | 5.34% 1 | 0 | 742 |8444k| 0 | 3.118597e+03 | 3.285000e+03 | 5.34% 1 | 0 | 748 |8464k| 0 | 3.118651e+03 | 3.285000e+03 | 5.33% 1 | 0 | 751 |8480k| 0 | 3.118664e+03 | 3.285000e+03 | 5.33% s 1 | 0 | 751 |8514k| 0 | 3.118664e+03 | 3.167000e+03 | 1.55% 1 | 0 | 761 |8506k| 0 | 3.118673e+03 | 3.167000e+03 | 1.55% s 1 | 0 | 761 |8540k| 0 | 3.118673e+03 | 3.155000e+03 | 1.16% k 1 | 0 | 761 |8608k| 0 | 3.118673e+03 | 3.146000e+03 | 0.88% (run 1, node 1) restarting after 1060 global fixings of integer variables (restart) converted 182 cuts from the global cut pool into linear constraints presolving: (round 1) 1311 del vars, 136 del conss, 6 chg bounds, 225 chg sides, 360 chg coeffs, 0 upgd conss, 3462 impls, 99 clqs (round 2) 1348 del vars, 156 del conss, 6 chg bounds, 238 chg sides, 383 chg coeffs, 119 upgd conss, 3462 impls, 99 clqs (round 3) 1351 del vars, 195 del conss, 6 chg bounds, 264 chg sides, 436 chg coeffs, 119 upgd conss, 3490 impls, 99 clqs (round 4) 1351 del vars, 197 del conss, 6 chg bounds, 270 chg sides, 443 chg coeffs, 119 upgd conss, 3490 impls, 99 clqs (round 5) 1351 del vars, 198 del conss, 6 chg bounds, 278 chg sides, 463 chg coeffs, 119 upgd conss, 3490 impls, 99 clqs (round 6) 1351 del vars, 204 del conss, 6 chg bounds, 278 chg sides, 463 chg coeffs, 119 upgd conss, 3490 impls, 99 clqs (round 7) 1353 del vars, 206 del conss, 6 chg bounds, 280 chg sides, 465 chg coeffs, 119 upgd conss, 3490 impls, 99 clqs presolving (8 rounds): 1353 deleted vars, 206 deleted constraints, 6 tightened bounds, 0 added holes, 280 changed sides, 465 changed coefficients 3490 implications, 99 cliques presolved problem has 1086 variables (1086 bin, 0 int, 0 impl, 0 cont) and 728 constraints 264 constraints of type 317 constraints of type 15 constraints of type 132 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.64 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1025 |7640k| 0 | 3.118676e+03 | 3.146000e+03 | 0.88% 1 | 0 | 1036 |7658k| 0 | 3.118684e+03 | 3.146000e+03 | 0.88% 1 | 2 | 1036 |7658k| 0 | 3.118684e+03 | 3.146000e+03 | 0.88% (run 2, node 1) restarting after 91 global fixings of integer variables (restart) converted 3 cuts from the global cut pool into linear constraints presolving: (round 1) 115 del vars, 34 del conss, 1 chg bounds, 54 chg sides, 100 chg coeffs, 0 upgd conss, 3562 impls, 85 clqs (round 2) 150 del vars, 56 del conss, 1 chg bounds, 57 chg sides, 109 chg coeffs, 3 upgd conss, 3562 impls, 83 clqs (round 3) 153 del vars, 58 del conss, 1 chg bounds, 58 chg sides, 112 chg coeffs, 3 upgd conss, 3562 impls, 83 clqs (round 4) 153 del vars, 73 del conss, 1 chg bounds, 58 chg sides, 112 chg coeffs, 3 upgd conss, 3562 impls, 83 clqs presolving (5 rounds): 153 deleted vars, 73 deleted constraints, 1 tightened bounds, 0 added holes, 58 changed sides, 112 changed coefficients 3562 implications, 83 cliques presolved problem has 933 variables (933 bin, 0 int, 0 impl, 0 cont) and 620 constraints 226 constraints of type 267 constraints of type 10 constraints of type 117 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.71 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1264 |7460k| 0 | 3.118684e+03 | 3.146000e+03 | 0.88% 1 | 0 | 1269 |7483k| 0 | 3.118697e+03 | 3.146000e+03 | 0.88% 1 | 2 | 1269 |7483k| 0 | 3.118697e+03 | 3.146000e+03 | 0.88% * 51 | 29 | 1658 |7676k| 24 | 3.123751e+03 | 3.145000e+03 | 0.68% * 69 | 34 | 1803 |7719k| 24 | 3.123790e+03 | 3.144000e+03 | 0.65% * 80 | 21 | 1824 |7709k| 24 | 3.123790e+03 | 3.134000e+03 | 0.33% R 86 | 19 | 1873 |7771k| 24 | 3.123919e+03 | 3.132000e+03 | 0.26% * 86 | 16 | 1887 |7807k| 24 | 3.123919e+03 | 3.131000e+03 | 0.23% * 90 | 14 | 1910 |7840k| 24 | 3.123930e+03 | 3.130000e+03 | 0.19% * 91 | 8 | 1911 |7861k| 24 | 3.123930e+03 | 3.128000e+03 | 0.13% * 100 | 11 | 1962 |7892k| 24 | 3.123930e+03 | 3.127000e+03 | 0.10% * 113 | 6 | 2068 |7937k| 24 | 3.123933e+03 | 3.126000e+03 | 0.07% * 114 | 0 | 2069 |7961k| 24 | 3.124000e+03 | 3.124000e+03 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 2.95 Solving Nodes : 114 (total of 116 nodes in 3 runs) Primal Bound : +3.12400000000000e+03 (23 solutions) Dual Bound : +3.12400000000000e+03 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 2.95 Original Problem : Problem name : gamsmodel Variables : 2756 (2756 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 755 initial, 755 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 933 (933 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 620 initial, 620 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 1151 0 0 0 0 0 0 0 dualfix : 0.01 616 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 3 0 0 0 0 0 0 probing : 0.30 17 0 0 0 0 0 0 0 knapsack : 0.28 0 0 0 7 0 151 1826 3576 setppc : 0.04 0 0 0 0 0 369 0 0 linear : 0.03 24 12 0 17 0 102 218 549 logicor : 0.00 0 0 0 0 0 44 0 0 root node : - 1407 - - 1407 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 138 0 2 64 0 0 182 knapsack : 226 18 2975 9 0 8 479 187 0 0 setppc : 267 18 2967 9 0 7 1276 0 0 0 linear : 10 18 2956 8 0 0 10 9 0 0 logicor : 117 18 488 9 0 0 82 0 0 0 countsols : 0 0 0 9 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.61 0.00 0.00 0.61 0.00 knapsack : 0.06 0.02 0.04 0.00 0.00 setppc : 0.08 0.00 0.08 0.00 0.00 linear : 0.00 0.00 0.00 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 9 0 227 pseudoobj : 0.00 517 0 5 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 0 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: 9) redcost : 0.02 229 0 4374 0 0 impliedbounds : 0.00 18 0 0 11 0 intobj : 0.00 0 0 0 0 0 gomory : 0.20 18 0 0 282 0 strongcg : 0.15 18 0 0 210 0 cmir : 0.10 12 0 0 196 0 flowcover : 0.48 12 0 0 410 0 clique : 0.01 18 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.61 129 2 64 0 0 182 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 - 9 pseudo solutions : 0.00 - 0 fracdiving : 0.00 0 0 veclendiving : 0.00 0 0 objpscostdiving : 0.00 0 0 rootsoldiving : 0.00 0 0 linesearchdiving : 0.00 0 0 guideddiving : 0.00 0 0 crossover : 0.00 0 0 feaspump : 0.00 0 0 coefdiving : 0.02 1 0 pscostdiving : 0.00 1 0 simplerounding : 0.00 160 0 rounding : 0.00 149 1 shifting : 0.01 35 11 intshifting : 0.00 0 0 oneopt : 0.01 9 1 fixandinfer : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.04 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.02 0 0 0.00 0.00 dual LP : 0.44 185 2030 10.97 4613.64 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.00 13 39 3.00 - strong branching : 0.61 421 5027 11.94 8240.98 (at root node) : - 36 1120 31.11 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 3 nodes : 114 nodes (total) : 116 nodes left : 0 max depth : 24 max depth (total): 24 backtracks : 9 (7.9%) delayed cutoffs : 0 repropagations : 51 (123 domain reductions, 0 cutoffs) avg switch length: 3.23 switching time : 0.02 Solution : Solutions found : 23 (17 improvements) Primal Bound : +3.12400000000000e+03 (in run 3, after 114 nodes, 2.95 seconds, depth 16, found by ) Dual Bound : +3.12400000000000e+03 Gap : 0.00 % Root Dual Bound : +3.11869711840276e+03 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- p2756.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p2756.gms Stop 10/03/08 03:55:58 elapsed 0:00:03.213