--- Job khb05250 Start 10/01/08 18:26:53 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 --- khb05250.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/khb05250.gdx --- khb05250.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.046 --- khb05250.gms(123) 4 Mb --- Generating MIP model m --- khb05250.gms(124) 4 Mb --- 102 rows 1,351 columns 3,974 non-zeroes --- 24 discrete-columns --- khb05250.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.067 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) 51 del vars, 1 del conss, 2476 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 51 del vars, 1 del conss, 2476 chg bounds, 0 chg sides, 0 chg coeffs, 24 upgd conss, 0 impls, 0 clqs presolving (3 rounds): 51 deleted vars, 1 deleted constraints, 2476 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 1224 implications, 0 cliques presolved problem has 1299 variables (24 bin, 0 int, 0 impl, 1275 cont) and 100 constraints 24 constraints of type 76 constraints of type Presolving Time: 0.03 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 139 |2592k| 0 | 9.591946e+07 | -- | Inf r 1 | 0 | 139 |2609k| 0 | 9.591946e+07 | 1.267855e+08 | 32.18% 1 | 0 | 166 |2694k| 0 | 1.037261e+08 | 1.267855e+08 | 22.23% 1 | 0 | 192 |2751k| 0 | 1.047430e+08 | 1.267855e+08 | 21.04% 1 | 0 | 219 |2818k| 0 | 1.054264e+08 | 1.267855e+08 | 20.26% 1 | 0 | 247 |2886k| 0 | 1.063742e+08 | 1.267855e+08 | 19.19% r 1 | 0 | 247 |2902k| 0 | 1.063742e+08 | 1.263263e+08 | 18.76% 1 | 0 | 268 |2961k| 0 | 1.066035e+08 | 1.263263e+08 | 18.50% r 1 | 0 | 268 |2978k| 0 | 1.066035e+08 | 1.190690e+08 | 11.69% 1 | 0 | 292 |3035k| 0 | 1.067420e+08 | 1.190690e+08 | 11.55% r 1 | 0 | 292 |3052k| 0 | 1.067420e+08 | 1.166985e+08 | 9.33% 1 | 0 | 319 |3086k| 0 | 1.068102e+08 | 1.166985e+08 | 9.26% r 1 | 0 | 319 |3103k| 0 | 1.068102e+08 | 1.142682e+08 | 6.98% 1 | 0 | 338 |3143k| 0 | 1.068897e+08 | 1.142682e+08 | 6.90% 1 | 0 | 351 |3180k| 0 | 1.068947e+08 | 1.142682e+08 | 6.90% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 355 |3212k| 0 | 1.069260e+08 | 1.142682e+08 | 6.87% r 1 | 0 | 355 |3229k| 0 | 1.069260e+08 | 1.093840e+08 | 2.30% 1 | 0 | 373 |3229k| 0 | 1.069289e+08 | 1.093840e+08 | 2.30% 1 | 0 | 382 |3246k| 0 | 1.069293e+08 | 1.093840e+08 | 2.30% 1 | 0 | 385 |3263k| 0 | 1.069294e+08 | 1.093840e+08 | 2.30% 1 | 0 | 386 |3280k| 0 | 1.069294e+08 | 1.093840e+08 | 2.30% i 1 | 0 | 406 |3313k| 0 | 1.069294e+08 | 1.069402e+08 | 0.01% 1 | 0 | 406 |3329k| 0 | 1.069294e+08 | 1.069402e+08 | 0.01% 1 | 0 | 406 |3314k| 0 | 1.069294e+08 | 1.069402e+08 | 0.01% (run 1, node 1) restarting after 5 global fixings of integer variables (restart) converted 131 cuts from the global cut pool into linear constraints presolving: (round 1) 158 del vars, 25 del conss, 153 chg bounds, 0 chg sides, 2 chg coeffs, 0 upgd conss, 1224 impls, 0 clqs (round 2) 158 del vars, 25 del conss, 153 chg bounds, 0 chg sides, 2 chg coeffs, 70 upgd conss, 1224 impls, 0 clqs presolving (3 rounds): 158 deleted vars, 25 deleted constraints, 153 tightened bounds, 0 added holes, 0 changed sides, 2 changed coefficients 1224 implications, 0 cliques presolved problem has 1141 variables (19 bin, 0 int, 0 impl, 1122 cont) and 206 constraints 88 constraints of type 1 constraints of type 117 constraints of type Presolving Time: 0.04 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap E 1 | 0 | 652 |3075k| 0 | 1.069309e+08 | 1.069402e+08 | 0.01% 1 | 0 | 659 |3097k| 0 | 1.069333e+08 | 1.069402e+08 | 0.01% 1 | 2 | 659 |3114k| 0 | 1.069333e+08 | 1.069402e+08 | 0.01% (run 2, node 1) restarting after 1 global fixings of integer variables (restart) converted 2 cuts from the global cut pool into linear constraints presolving: (round 1) 52 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 1224 impls, 0 clqs presolving (2 rounds): 52 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 1224 implications, 0 cliques presolved problem has 1089 variables (18 bin, 0 int, 0 impl, 1071 cont) and 205 constraints 87 constraints of type 1 constraints of type 117 constraints of type Presolving Time: 0.04 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 896 |3090k| 0 | 1.069333e+08 | 1.069402e+08 | 0.01% 1 | 0 | 898 |3079k| 0 | 1.069333e+08 | 1.069402e+08 | 0.01% 1 | 0 | 909 |3066k| 0 | 1.069390e+08 | 1.069402e+08 | 0.00% 1 | 2 | 911 |3083k| 0 | 1.069390e+08 | 1.069402e+08 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.90 Solving Nodes : 3 (total of 5 nodes in 3 runs) Primal Bound : +1.06940226000000e+08 (23 solutions) Dual Bound : +1.06940226000000e+08 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.90 Original Problem : Problem name : gamsmodel Variables : 1350 (24 binary, 0 integer, 0 implicit integer, 1326 continuous) Constraints : 101 initial, 101 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 1089 (18 binary, 0 integer, 0 implicit integer, 1071 continuous) Constraints : 205 initial, 205 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 107 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.02 0 0 0 0 0 0 0 0 varbound : 0.00 0 0 0 3 0 5 0 0 knapsack : 0.00 0 0 0 0 0 0 0 0 linear : 0.02 154 0 0 2626 0 21 0 2 root node : - 13 - - 319 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 4 0 0 8 0 0 4 varbound : 87 18 84 0 0 0 46 0 0 0 knapsack : 1 2 11 0 0 0 0 0 0 0 linear : 117 18 84 0 0 0 311 1 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.02 0.00 0.00 0.02 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 knapsack : 0.00 0.00 0.00 0.00 0.00 linear : 0.01 0.00 0.01 0.00 0.00 countsols : 0.00 0.00 0.00 0.00 0.00 Propagators : Time Calls Cutoffs DomReds rootredcost : 0.00 0 0 0 pseudoobj : 0.01 33 0 0 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: 1) redcost : 0.00 18 0 4 0 0 impliedbounds : 0.00 18 0 0 215 0 intobj : 0.00 0 0 0 0 0 gomory : 0.04 18 0 0 11 0 strongcg : 0.01 18 0 0 0 0 cmir : 0.42 12 0 0 307 0 flowcover : 0.16 12 0 0 91 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.02 4 0 8 0 0 4 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 - 0 pseudo solutions : 0.00 - 0 coefdiving : 0.00 0 0 oneopt : 0.00 1 0 simplerounding : 0.00 21 21 rounding : 0.00 21 0 shifting : 0.01 21 0 intshifting : 0.00 2 1 fixandinfer : 0.00 0 0 feaspump : 0.00 0 0 pscostdiving : 0.00 0 0 fracdiving : 0.00 0 0 veclendiving : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 objpscostdiving : 0.00 0 0 rootsoldiving : 0.00 0 0 linesearchdiving : 0.00 0 0 guideddiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.05 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.02 0 0 0.00 0.00 dual LP : 0.10 22 916 41.64 9160.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.00 2 22 11.00 - strong branching : 0.02 8 203 25.38 10150.00 (at root node) : - 8 203 25.38 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 3 nodes : 3 nodes (total) : 5 nodes left : 0 max depth : 1 max depth (total): 1 backtracks : 0 (0.0%) delayed cutoffs : 0 repropagations : 0 (0 domain reductions, 0 cutoffs) avg switch length: 2.00 switching time : 0.00 Solution : Solutions found : 23 (7 improvements) Primal Bound : +1.06940226000000e+08 (in run 1, after 1 nodes, 0.69 seconds, depth 0, found by ) Dual Bound : +1.06940226000000e+08 Gap : 0.00 % Root Dual Bound : +1.06938989138400e+08 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- khb05250.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job khb05250.gms Stop 10/01/08 18:26:54 elapsed 0:00:01.039