--- Job air04 Start 10/01/08 10:36:02 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 --- air04.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/air04.gdx --- air04.gms(148) 5 Mb --- Starting execution: elapsed 0:00:00.096 --- air04.gms(123) 6 Mb --- Generating MIP model m --- air04.gms(124) 10 Mb --- 824 rows 8,905 columns 81,870 non-zeroes --- 8,904 discrete-columns --- air04.gms(124) 10 Mb --- Executing SCIP: elapsed 0:00:00.303 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) 30 del vars, 3 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4 impls, 778 clqs (round 2) 31 del vars, 4 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4 impls, 777 clqs (round 3) 31 del vars, 46 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 772 upgd conss, 4 impls, 777 clqs (round 4) 967 del vars, 161 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 772 upgd conss, 8 impls, 643 clqs (round 5) 969 del vars, 164 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 772 upgd conss, 8 impls, 643 clqs (round 6) 997 del vars, 165 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 777 upgd conss, 8 impls, 642 clqs (round 7) 1213 del vars, 203 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 777 upgd conss, 8 impls, 620 clqs (round 8) 1226 del vars, 208 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 777 upgd conss, 8 impls, 615 clqs (round 9) 1276 del vars, 208 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 777 upgd conss, 46646 impls, 615 clqs (2.0s) probing: 1000/7678 (13.0%) - 60 fixings, 0 aggregations, 41536 implications, 0 bound changes (round 10) 1326 del vars, 208 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 777 upgd conss, 135464 impls, 615 clqs (round 11) 1328 del vars, 209 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 777 upgd conss, 135464 impls, 614 clqs (3.5s) probing: 2000/7678 (26.0%) - 114 fixings, 0 aggregations, 68561 implications, 0 bound changes (4.9s) probing: 3000/7678 (39.1%) - 140 fixings, 0 aggregations, 90031 implications, 0 bound changes (round 12) 1378 del vars, 209 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 777 upgd conss, 202484 impls, 614 clqs (round 13) 1440 del vars, 210 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 777 upgd conss, 202484 impls, 613 clqs (round 14) 1447 del vars, 211 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 777 upgd conss, 202484 impls, 612 clqs (6.3s) probing: 4000/7678 (52.1%) - 170 fixings, 0 aggregations, 117321 implications, 0 bound changes (7.5s) probing: 5000/7678 (65.1%) - 191 fixings, 1 aggregations, 143552 implications, 0 bound changes (round 15) 1497 del vars, 211 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 777 upgd conss, 314252 impls, 608 clqs (round 16) 1498 del vars, 217 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 777 upgd conss, 314252 impls, 606 clqs (8.8s) probing: 6000/7678 (78.1%) - 211 fixings, 2 aggregations, 170076 implications, 0 bound changes (9.8s) probing: 7000/7678 (91.2%) - 224 fixings, 3 aggregations, 191593 implications, 0 bound changes (round 17) 1531 del vars, 217 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 777 upgd conss, 411690 impls, 602 clqs (round 18) 1534 del vars, 222 del conss, 4 chg bounds, 5 chg sides, 0 chg coeffs, 777 upgd conss, 411690 impls, 601 clqs presolving (19 rounds): 1534 deleted vars, 222 deleted constraints, 4 tightened bounds, 0 added holes, 5 changed sides, 0 changed coefficients 411690 implications, 601 cliques presolved problem has 7370 variables (7370 bin, 0 int, 0 impl, 0 cont) and 601 constraints 601 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 10.45 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 3139 | 30M| 0 | 5.553544e+04 | -- | Inf 1 | 0 | 22122 | 30M| 0 | 5.557669e+04 | -- | Inf 1 | 0 | 22284 | 30M| 0 | 5.560320e+04 | -- | Inf 1 | 0 | 22342 | 30M| 0 | 5.560561e+04 | -- | Inf 1 | 0 | 22450 | 30M| 0 | 5.561525e+04 | -- | Inf 1 | 0 | 22606 | 30M| 0 | 5.564011e+04 | -- | Inf 1 | 0 | 22656 | 30M| 0 | 5.564325e+04 | -- | Inf 1 | 0 | 22698 | 31M| 0 | 5.564490e+04 | -- | Inf 1 | 0 | 22763 | 31M| 0 | 5.564688e+04 | -- | Inf 1 | 0 | 22802 | 31M| 0 | 5.564766e+04 | -- | Inf 1 | 0 | 22842 | 31M| 0 | 5.564859e+04 | -- | Inf 1 | 0 | 22847 | 31M| 0 | 5.564862e+04 | -- | Inf 1 | 0 | 22859 | 31M| 0 | 5.564870e+04 | -- | Inf 1 | 0 | 22863 | 31M| 0 | 5.564870e+04 | -- | Inf 1 | 2 | 22863 | 31M| 0 | 5.564870e+04 | -- | Inf node | left |LP iter| mem |mdpt | dualbound | primalbound | gap * 15 | 14 | 66212 | 31M| 6 | 5.575647e+04 | 5.837200e+04 | 4.69% * 18 | 12 | 67191 | 31M| 7 | 5.575647e+04 | 5.701100e+04 | 2.25% * 20 | 9 | 67324 | 30M| 9 | 5.575647e+04 | 5.687200e+04 | 2.00% * 28 | 6 | 81873 | 30M| 9 | 5.581571e+04 | 5.621200e+04 | 0.71% * 36 | 10 |100971 | 27M| 12 | 5.581808e+04 | 5.616700e+04 | 0.63% * 51 | 7 |117993 | 27M| 15 | 5.587289e+04 | 5.613800e+04 | 0.47% 100 | 4 |152878 | 26M| 15 | 5.591310e+04 | 5.613800e+04 | 0.40% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 186.37 Solving Nodes : 106 Primal Bound : +5.61380000000000e+04 (6 solutions) Dual Bound : +5.61380000000000e+04 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 186.37 Original Problem : Problem name : gamsmodel Variables : 8904 (8904 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 823 initial, 823 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 7370 (7370 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 601 initial, 605 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.02 29 0 0 0 0 0 0 0 dualfix : 0.02 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 : 10.09 229 4 0 0 0 0 0 0 setppc : 0.14 1235 2 0 0 0 176 0 0 linear : 0.11 28 7 0 4 0 46 5 0 logicor : 0.00 0 0 0 0 0 0 0 0 root node : - 2930 - - 2930 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 82 0 3 43 0 0 120 setppc : 601 13 18326 6 0 227 7625 0 0 0 logicor : 0+ 0 25 0 0 0 2 0 0 0 countsols : 0 0 0 6 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 80.78 0.00 0.00 80.78 0.00 setppc : 0.62 0.00 0.62 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.09 6 0 2929 pseudoobj : 0.60 1299 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 2 2 3 69.7 1 38.0 - infeasible LP : 0.03 23 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 : - - - 4 61.8 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 12 - - 4 - (maximal pool size: 71) redcost : 0.11 149 0 32270 0 0 impliedbounds : 0.00 13 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.12 13 0 0 0 0 strongcg : 0.10 13 0 0 0 0 cmir : 0.35 10 0 0 0 0 flowcover : 0.37 10 0 0 0 0 clique : 0.53 13 0 0 73 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 : 80.78 76 3 43 0 0 120 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 - 6 pseudo solutions : 0.00 - 0 crossover : 0.00 0 0 oneopt : 0.02 6 0 coefdiving : 8.15 1 0 pscostdiving : 9.65 1 0 fracdiving : 6.71 1 0 veclendiving : 0.87 1 0 linesearchdiving : 2.33 1 0 guideddiving : 0.01 1 0 objpscostdiving : 0.52 1 0 rootsoldiving : 7.28 1 0 simplerounding : 0.00 0 0 rounding : 0.14 89 0 shifting : 0.16 21 0 intshifting : 0.00 0 0 fixandinfer : 0.00 0 0 feaspump : 11.92 1 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.14 1 0 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.30 0 0 0.00 0.00 dual LP : 44.63 131 86757 662.27 1943.92 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 45.59 899 70380 78.29 1543.76 strong branching : 80.77 1017 153921 151.35 1905.67 (at root node) : - 17 2798 164.59 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 106 nodes (total) : 106 nodes left : 0 max depth : 15 max depth (total): 15 backtracks : 28 (26.4%) delayed cutoffs : 0 repropagations : 9 (2 domain reductions, 0 cutoffs) avg switch length: 4.00 switching time : 0.43 Solution : Solutions found : 6 (6 improvements) Primal Bound : +5.61380000000000e+04 (in run 1, after 51 nodes, 144.69 seconds, depth 9, found by ) Dual Bound : +5.61380000000000e+04 Gap : 0.00 % Root Dual Bound : +5.56486978336661e+04 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- air04.gms(124) 0 Mb --- Reading solution for model m --- air04.gms(124) 5 Mb *** Status: Normal completion --- Job air04.gms Stop 10/01/08 10:39:10 elapsed 0:03:07.385