--- Job air05 Start 10/01/08 10:39:10 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 --- air05.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/air05.gdx --- air05.gms(148) 5 Mb --- Starting execution: elapsed 0:00:00.076 --- air05.gms(123) 5 Mb --- Generating MIP model m --- air05.gms(124) 8 Mb --- 427 rows 7,196 columns 59,317 non-zeroes --- 7,195 discrete-columns --- air05.gms(124) 8 Mb --- Executing SCIP: elapsed 0:00:00.258 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, 18 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 406 upgd conss, 0 impls, 408 clqs (round 2) 711 del vars, 68 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 406 upgd conss, 0 impls, 355 clqs (round 3) 997 del vars, 82 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 406 upgd conss, 0 impls, 343 clqs (round 4) 997 del vars, 83 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 408 upgd conss, 0 impls, 343 clqs (1.8s) probing: 1000/6198 (16.1%) - 23 fixings, 0 aggregations, 28177 implications, 0 bound changes (3.3s) probing: 2000/6198 (32.3%) - 40 fixings, 0 aggregations, 47924 implications, 0 bound changes (round 5) 1047 del vars, 83 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 408 upgd conss, 126966 impls, 343 clqs (4.8s) probing: 3000/6198 (48.4%) - 61 fixings, 0 aggregations, 68270 implications, 0 bound changes (6.1s) probing: 4000/6198 (64.5%) - 70 fixings, 0 aggregations, 80379 implications, 0 bound changes (7.3s) probing: 5000/6198 (80.7%) - 78 fixings, 0 aggregations, 100306 implications, 0 bound changes (8.4s) probing: 6000/6198 (96.8%) - 82 fixings, 1 aggregations, 123277 implications, 0 bound changes (round 6) 1080 del vars, 83 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 408 upgd conss, 253788 impls, 342 clqs (round 7) 1080 del vars, 84 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 408 upgd conss, 253788 impls, 342 clqs presolving (8 rounds): 1080 deleted vars, 84 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients 253788 implications, 342 cliques presolved problem has 6115 variables (6115 bin, 0 int, 0 impl, 0 cont) and 342 constraints 342 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 8.55 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1207 | 22M| 0 | 2.587761e+04 | -- | Inf F 1 | 0 | 3178 | 23M| 0 | 2.587761e+04 | 2.673100e+04 | 3.30% 1 | 0 | 3310 | 23M| 0 | 2.591934e+04 | 2.673100e+04 | 3.13% 1 | 0 | 3387 | 23M| 0 | 2.592790e+04 | 2.673100e+04 | 3.10% 1 | 0 | 3488 | 23M| 0 | 2.594495e+04 | 2.673100e+04 | 3.03% 1 | 0 | 3624 | 22M| 0 | 2.596983e+04 | 2.673100e+04 | 2.93% 1 | 0 | 3693 | 22M| 0 | 2.597255e+04 | 2.673100e+04 | 2.92% 1 | 0 | 3727 | 22M| 0 | 2.597396e+04 | 2.673100e+04 | 2.91% 1 | 0 | 3754 | 22M| 0 | 2.597452e+04 | 2.673100e+04 | 2.91% 1 | 0 | 3760 | 22M| 0 | 2.597454e+04 | 2.673100e+04 | 2.91% 1 | 2 | 3760 | 22M| 0 | 2.597454e+04 | 2.673100e+04 | 2.91% (run 1, node 1) restarting after 375 global fixings of integer variables (restart) converted 30 cuts from the global cut pool into linear constraints presolving: (round 1) 408 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 30 upgd conss, 253788 impls, 371 clqs presolving (2 rounds): 408 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 253788 implications, 371 cliques presolved problem has 5707 variables (5707 bin, 0 int, 0 impl, 0 cont) and 371 constraints 371 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 8.57 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 5169 | 22M| 0 | 2.597454e+04 | 2.673100e+04 | 2.91% 1 | 0 | 5169 | 22M| 0 | 2.597454e+04 | 2.673100e+04 | 2.91% 1 | 2 | 5169 | 22M| 0 | 2.597454e+04 | 2.673100e+04 | 2.91% * 8 | 5 | 7923 | 22M| 6 | 2.601430e+04 | 2.662600e+04 | 2.35% * 27 | 7 | 15273 | 22M| 8 | 2.609581e+04 | 2.649000e+04 | 1.51% * 97 | 11 | 29800 | 22M| 25 | 2.609581e+04 | 2.644300e+04 | 1.33% * 98 | 9 | 29892 | 22M| 25 | 2.609581e+04 | 2.640600e+04 | 1.19% 100 | 11 | 29972 | 21M| 25 | 2.609581e+04 | 2.640600e+04 | 1.19% * 107 | 8 | 30629 | 21M| 25 | 2.609581e+04 | 2.637400e+04 | 1.07% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 84.84 Solving Nodes : 189 (total of 190 nodes in 2 runs) Primal Bound : +2.63740000000000e+04 (6 solutions) Dual Bound : +2.63740000000000e+04 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 84.84 Original Problem : Problem name : gamsmodel Variables : 7195 (7195 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 426 initial, 426 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 5707 (5707 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 371 initial, 381 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.02 375 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 : 8.41 82 1 0 0 0 0 0 0 setppc : 0.03 1028 0 0 0 0 67 0 0 linear : 0.05 0 2 0 0 0 18 2 0 logicor : 0.00 0 0 0 0 0 0 0 0 root node : - 2152 - - 2152 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 138 0 7 114 0 0 192 setppc : 371 10 13720 5 0 87 12178 0 0 0 logicor : 0+ 0 83 0 0 0 9 0 0 0 countsols : 0 0 0 5 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 50.28 0.00 0.00 50.28 0.00 setppc : 0.32 0.00 0.32 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.05 5 0 1673 pseudoobj : 0.27 710 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 5 3 9 268.2 1 99.0 - infeasible LP : 0.06 40 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 : - - - 10 251.3 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 0 - - 0 - (maximal pool size: 0) redcost : 0.18 261 0 55628 0 0 impliedbounds : 0.02 10 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.03 10 0 0 0 0 strongcg : 0.06 10 0 0 0 0 cmir : 0.34 10 0 0 0 0 flowcover : 0.31 10 0 0 0 0 clique : 0.51 10 0 0 43 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 : 50.28 133 7 114 0 0 192 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 - 5 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 oneopt : 0.02 6 0 coefdiving : 0.12 1 0 pscostdiving : 0.13 1 0 feaspump : 0.90 1 1 simplerounding : 0.00 0 0 rounding : 0.24 131 0 shifting : 0.07 20 0 intshifting : 0.00 0 0 fixandinfer : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.11 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.32 0 0 0.00 0.00 dual LP : 21.62 228 58230 255.39 2693.34 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 1.13 17 2540 149.41 2247.79 strong branching : 50.28 1048 136684 130.42 2718.46 (at root node) : - 50 7977 159.54 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 2 nodes : 189 nodes (total) : 190 nodes left : 0 max depth : 25 max depth (total): 25 backtracks : 35 (18.5%) delayed cutoffs : 0 repropagations : 28 (540 domain reductions, 0 cutoffs) avg switch length: 2.61 switching time : 0.29 Solution : Solutions found : 6 (6 improvements) Primal Bound : +2.63740000000000e+04 (in run 2, after 107 nodes, 68.45 seconds, depth 20, found by ) Dual Bound : +2.63740000000000e+04 Gap : 0.00 % Root Dual Bound : +2.59745448928442e+04 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- air05.gms(124) 0 Mb --- Reading solution for model m --- air05.gms(124) 4 Mb *** Status: Normal completion --- Job air05.gms Stop 10/01/08 10:40:35 elapsed 0:01:25.619