--- Job p0282 Start 10/03/08 03:55:54 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 --- p0282.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p0282.gdx --- p0282.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.015 --- p0282.gms(123) 4 Mb --- Generating MIP model m --- p0282.gms(124) 4 Mb --- 242 rows 283 columns 2,249 non-zeroes --- 282 discrete-columns --- p0282.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.025 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) 1 del vars, 21 del conss, 0 chg bounds, 0 chg sides, 40 chg coeffs, 0 upgd conss, 354 impls, 0 clqs (round 2) 82 del vars, 81 del conss, 0 chg bounds, 0 chg sides, 95 chg coeffs, 0 upgd conss, 354 impls, 0 clqs (round 3) 82 del vars, 81 del conss, 0 chg bounds, 0 chg sides, 95 chg coeffs, 159 upgd conss, 354 impls, 0 clqs (round 4) 82 del vars, 81 del conss, 0 chg bounds, 116 chg sides, 327 chg coeffs, 160 upgd conss, 586 impls, 0 clqs (round 5) 82 del vars, 88 del conss, 0 chg bounds, 152 chg sides, 399 chg coeffs, 160 upgd conss, 658 impls, 0 clqs (round 6) 82 del vars, 89 del conss, 0 chg bounds, 152 chg sides, 399 chg coeffs, 160 upgd conss, 658 impls, 0 clqs (0.0s) probing: 101/200 (50.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes (0.0s) probing aborted: 100/100 successive totally useless probings presolving (7 rounds): 82 deleted vars, 89 deleted constraints, 0 tightened bounds, 0 added holes, 152 changed sides, 399 changed coefficients 658 implications, 0 cliques presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 304 constraints 35 constraints of type 152 constraints of type 117 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.02 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 61 | 970k| 0 | 2.467401e+05 | -- | Inf s 1 | 0 | 61 | 977k| 0 | 2.467401e+05 | 3.526260e+05 | 42.91% 1 | 0 | 80 | 999k| 0 | 2.495491e+05 | 3.526260e+05 | 41.31% s 1 | 0 | 80 |1004k| 0 | 2.495491e+05 | 2.821170e+05 | 13.05% 1 | 0 | 96 |1054k| 0 | 2.502795e+05 | 2.821170e+05 | 12.72% 1 | 0 | 116 |1072k| 0 | 2.521345e+05 | 2.821170e+05 | 11.89% 1 | 0 | 139 |1124k| 0 | 2.525826e+05 | 2.821170e+05 | 11.69% 1 | 0 | 152 |1156k| 0 | 2.526916e+05 | 2.821170e+05 | 11.64% s 1 | 0 | 152 |1160k| 0 | 2.526916e+05 | 2.767160e+05 | 9.51% 1 | 0 | 159 |1202k| 0 | 2.527382e+05 | 2.767160e+05 | 9.49% 1 | 0 | 179 |1224k| 0 | 2.529417e+05 | 2.767160e+05 | 9.40% 1 | 0 | 203 |1237k| 0 | 2.530604e+05 | 2.767160e+05 | 9.35% 1 | 0 | 234 |1248k| 0 | 2.539732e+05 | 2.767160e+05 | 8.95% 1 | 0 | 240 |1270k| 0 | 2.540264e+05 | 2.767160e+05 | 8.93% 1 | 0 | 247 |1271k| 0 | 2.541212e+05 | 2.767160e+05 | 8.89% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 264 |1274k| 0 | 2.543436e+05 | 2.767160e+05 | 8.80% 1 | 0 | 283 |1282k| 0 | 2.545010e+05 | 2.767160e+05 | 8.73% 1 | 0 | 309 |1286k| 0 | 2.546680e+05 | 2.767160e+05 | 8.66% 1 | 0 | 338 |1300k| 0 | 2.549266e+05 | 2.767160e+05 | 8.55% 1 | 0 | 374 |1305k| 0 | 2.551656e+05 | 2.767160e+05 | 8.45% 1 | 0 | 400 |1308k| 0 | 2.552712e+05 | 2.767160e+05 | 8.40% 1 | 0 | 406 |1310k| 0 | 2.552931e+05 | 2.767160e+05 | 8.39% 1 | 0 | 424 |1311k| 0 | 2.553802e+05 | 2.767160e+05 | 8.35% 1 | 0 | 439 |1312k| 0 | 2.554043e+05 | 2.767160e+05 | 8.34% 1 | 0 | 452 |1315k| 0 | 2.554646e+05 | 2.767160e+05 | 8.32% 1 | 0 | 470 |1315k| 0 | 2.555062e+05 | 2.767160e+05 | 8.30% 1 | 0 | 479 |1316k| 0 | 2.555143e+05 | 2.767160e+05 | 8.30% k 1 | 0 | 479 |1323k| 0 | 2.555143e+05 | 2.680870e+05 | 4.92% E 1 | 0 | 479 |1323k| 0 | 2.555143e+05 | 2.587230e+05 | 1.26% 1 | 0 | 479 |1323k| 0 | 2.555143e+05 | 2.587230e+05 | 1.26% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 479 |1296k| 0 | 2.555143e+05 | 2.587230e+05 | 1.26% 1 | 2 | 479 |1296k| 0 | 2.555143e+05 | 2.587230e+05 | 1.26% (run 1, node 1) restarting after 32 global fixings of integer variables (restart) converted 74 cuts from the global cut pool into linear constraints presolving: (round 1) 32 del vars, 56 del conss, 0 chg bounds, 33 chg sides, 27 chg coeffs, 0 upgd conss, 664 impls, 0 clqs (round 2) 36 del vars, 61 del conss, 0 chg bounds, 37 chg sides, 31 chg coeffs, 66 upgd conss, 664 impls, 0 clqs (round 3) 36 del vars, 62 del conss, 0 chg bounds, 43 chg sides, 43 chg coeffs, 66 upgd conss, 664 impls, 0 clqs (round 4) 36 del vars, 65 del conss, 0 chg bounds, 43 chg sides, 43 chg coeffs, 66 upgd conss, 664 impls, 0 clqs presolving (5 rounds): 36 deleted vars, 65 deleted constraints, 0 tightened bounds, 0 added holes, 43 changed sides, 43 changed coefficients 664 implications, 0 cliques presolved problem has 164 variables (164 bin, 0 int, 0 impl, 0 cont) and 269 constraints 74 constraints of type 100 constraints of type 95 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.02 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 598 | 985k| 0 | 2.555498e+05 | 2.587230e+05 | 1.24% 1 | 0 | 611 |1011k| 0 | 2.556149e+05 | 2.587230e+05 | 1.22% 1 | 0 | 632 |1000k| 0 | 2.557782e+05 | 2.587230e+05 | 1.15% 1 | 0 | 632 |1000k| 0 | 2.557782e+05 | 2.587230e+05 | 1.15% (run 2, node 1) restarting after 38 global fixings of integer variables (restart) converted 11 cuts from the global cut pool into linear constraints presolving: (round 1) 38 del vars, 46 del conss, 0 chg bounds, 40 chg sides, 65 chg coeffs, 11 upgd conss, 692 impls, 1 clqs (round 2) 45 del vars, 62 del conss, 0 chg bounds, 47 chg sides, 75 chg coeffs, 11 upgd conss, 692 impls, 1 clqs (round 3) 53 del vars, 69 del conss, 0 chg bounds, 47 chg sides, 75 chg coeffs, 11 upgd conss, 692 impls, 1 clqs (round 4) 53 del vars, 84 del conss, 0 chg bounds, 47 chg sides, 75 chg coeffs, 11 upgd conss, 692 impls, 1 clqs presolving (5 rounds): 53 deleted vars, 84 deleted constraints, 0 tightened bounds, 0 added holes, 47 changed sides, 75 changed coefficients 692 implications, 1 cliques presolved problem has 111 variables (111 bin, 0 int, 0 impl, 0 cont) and 190 constraints 75 constraints of type 63 constraints of type 52 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.03 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 767 | 919k| 0 | 2.557783e+05 | 2.587230e+05 | 1.15% 1 | 0 | 788 | 938k| 0 | 2.563219e+05 | 2.587230e+05 | 0.94% 1 | 2 | 788 | 938k| 0 | 2.563219e+05 | 2.587230e+05 | 0.94% * 13 | 4 | 893 | 949k| 7 | 2.565748e+05 | 2.584110e+05 | 0.72% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.77 Solving Nodes : 17 (total of 19 nodes in 3 runs) Primal Bound : +2.58411000000000e+05 (8 solutions) Dual Bound : +2.58411000000000e+05 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.77 Original Problem : Problem name : gamsmodel Variables : 282 (282 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 241 initial, 241 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 111 (111 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 190 initial, 190 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 70 0 0 0 0 0 0 0 dualfix : 0.01 100 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 knapsack : 0.00 0 0 0 0 0 17 234 422 setppc : 0.00 0 0 0 0 0 40 0 0 linear : 0.00 0 1 0 0 0 89 8 95 logicor : 0.00 0 0 0 0 0 92 0 0 root node : - 81 - - 81 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 23 0 4 19 0 0 18 knapsack : 75 27 303 1 0 2 39 386 0 0 setppc : 63 27 301 1 0 0 133 0 0 0 logicor : 52 27 173 1 0 3 3 0 0 0 countsols : 0 0 0 1 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.13 0.00 0.00 0.13 0.00 knapsack : 0.01 0.01 0.00 0.00 0.00 setppc : 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 1 0 6 pseudoobj : 0.00 135 1 47 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 6 3 10 17.6 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 : - - - 5 15.2 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 0 - - 0 - (maximal pool size: 28) redcost : 0.00 60 0 121 0 0 impliedbounds : 0.00 27 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.16 27 0 0 110 0 strongcg : 0.08 22 0 0 49 0 cmir : 0.04 12 0 0 208 0 flowcover : 0.06 12 0 0 459 0 clique : 0.00 3 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.13 22 4 19 0 0 18 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 - 1 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 oneopt : 0.00 2 1 coefdiving : 0.00 1 1 simplerounding : 0.00 37 0 rounding : 0.00 51 0 shifting : 0.00 29 3 intshifting : 0.00 0 0 fixandinfer : 0.00 0 0 feaspump : 0.00 0 0 pscostdiving : 0.01 1 1 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.12 1 1 rins : 0.00 0 0 localbranching : 0.00 0 0 mutation : 0.00 0 0 crossover : 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.09 52 945 18.17 10500.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.01 16 37 2.31 - strong branching : 0.13 204 4377 21.46 33669.23 (at root node) : - 79 3215 40.70 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 3 nodes : 17 nodes (total) : 19 nodes left : 0 max depth : 7 max depth (total): 7 backtracks : 4 (23.5%) delayed cutoffs : 0 repropagations : 5 (23 domain reductions, 0 cutoffs) avg switch length: 2.59 switching time : 0.00 Solution : Solutions found : 8 (6 improvements) Primal Bound : +2.58411000000000e+05 (in run 3, after 13 nodes, 0.76 seconds, depth 7, found by ) Dual Bound : +2.58411000000000e+05 Gap : 0.00 % Root Dual Bound : +2.56321909172046e+05 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- p0282.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p0282.gms Stop 10/03/08 03:55:55 elapsed 0:00:00.874