--- Job bal8x12 Start 10/01/08 11:41: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 --- bal8x12.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/bal8x12.gdx --- bal8x12.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.034 --- bal8x12.gms(123) 4 Mb --- Generating MIP model m --- bal8x12.gms(124) 4 Mb --- 117 rows 193 columns 577 non-zeroes --- 96 discrete-columns --- Executing SCIP: elapsed 0:00:00.040 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, 0 del conss, 96 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 0 del vars, 0 del conss, 96 chg bounds, 0 chg sides, 0 chg coeffs, 96 upgd conss, 0 impls, 0 clqs presolving (3 rounds): 0 deleted vars, 0 deleted constraints, 96 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 96 implications, 0 cliques presolved problem has 192 variables (96 bin, 0 int, 0 impl, 96 cont) and 116 constraints 96 constraints of type 20 constraints of type Presolving Time: 0.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 81 | 505k| 0 | 4.511881e+02 | -- | Inf r 1 | 0 | 81 | 508k| 0 | 4.511881e+02 | 5.045500e+02 | 11.83% 1 | 0 | 95 | 579k| 0 | 4.615930e+02 | 5.045500e+02 | 9.31% 1 | 0 | 134 | 626k| 0 | 4.665874e+02 | 5.045500e+02 | 8.14% 1 | 0 | 162 | 654k| 0 | 4.682808e+02 | 5.045500e+02 | 7.75% 1 | 0 | 168 | 679k| 0 | 4.686370e+02 | 5.045500e+02 | 7.66% 1 | 0 | 195 | 695k| 0 | 4.697666e+02 | 5.045500e+02 | 7.40% 1 | 0 | 203 | 735k| 0 | 4.701005e+02 | 5.045500e+02 | 7.33% 1 | 0 | 232 | 788k| 0 | 4.704660e+02 | 5.045500e+02 | 7.24% 1 | 0 | 249 | 807k| 0 | 4.708946e+02 | 5.045500e+02 | 7.15% 1 | 0 | 256 | 821k| 0 | 4.709341e+02 | 5.045500e+02 | 7.14% 1 | 0 | 260 | 827k| 0 | 4.709408e+02 | 5.045500e+02 | 7.14% E 1 | 0 | 323 | 833k| 0 | 4.709408e+02 | 4.715500e+02 | 0.13% 1 | 0 | 323 | 833k| 0 | 4.709408e+02 | 4.715500e+02 | 0.13% 1 | 0 | 323 | 802k| 0 | 4.709408e+02 | 4.715500e+02 | 0.13% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 323 | 801k| 0 | 4.709408e+02 | 4.715500e+02 | 0.13% (run 1, node 1) restarting after 56 global fixings of integer variables (restart) converted 74 cuts from the global cut pool into linear constraints presolving: (round 1) 112 del vars, 13 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 103 impls, 0 clqs (round 2) 112 del vars, 23 del conss, 3 chg bounds, 8 chg sides, 0 chg coeffs, 0 upgd conss, 103 impls, 0 clqs (round 3) 112 del vars, 23 del conss, 3 chg bounds, 8 chg sides, 0 chg coeffs, 10 upgd conss, 103 impls, 0 clqs presolving (4 rounds): 112 deleted vars, 23 deleted constraints, 3 tightened bounds, 0 added holes, 8 changed sides, 0 changed coefficients 103 implications, 0 cliques presolved problem has 80 variables (40 bin, 0 int, 0 impl, 40 cont) and 116 constraints 40 constraints of type 3 constraints of type 66 constraints of type 7 constraints of type Presolving Time: 0.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 418 | 628k| 0 | 4.715500e+02 | 4.715500e+02*| 0.00% 1 | 0 | 418 | 628k| 0 | 4.715500e+02 | 4.715500e+02*| 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.55 Solving Nodes : 1 (total of 2 nodes in 2 runs) Primal Bound : +4.71549999999960e+02 (13 solutions) Dual Bound : +4.71549999999960e+02 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.55 Original Problem : Problem name : gamsmodel Variables : 192 (96 binary, 0 integer, 0 implicit integer, 96 continuous) Constraints : 116 initial, 116 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 80 (40 binary, 0 integer, 0 implicit integer, 40 continuous) Constraints : 116 initial, 116 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.01 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.00 3 2 0 96 0 18 8 0 logicor : 0.00 0 0 0 0 0 0 0 0 root node : - 56 - - 107 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 1 0 0 5 0 0 0 varbound : 40 12 196 0 0 0 51 0 0 0 knapsack : 3 0 1 0 0 0 0 0 0 0 linear : 66 12 196 0 0 0 0 18 0 0 logicor : 7 0 1 0 0 0 0 0 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.03 0.00 0.00 0.03 0.00 varbound : 0.01 0.00 0.01 0.00 0.00 knapsack : 0.00 0.00 0.00 0.00 0.00 linear : 0.01 0.01 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 0 0 0 pseudoobj : 0.00 16 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: 0) redcost : 0.00 12 0 51 0 0 impliedbounds : 0.00 12 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.02 12 0 0 46 0 strongcg : 0.03 12 0 0 0 0 cmir : 0.33 10 0 0 151 0 flowcover : 0.06 10 0 0 60 0 clique : 0.00 1 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.03 1 0 5 0 0 0 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 simplerounding : 0.00 12 11 rounding : 0.00 12 0 shifting : 0.00 12 1 intshifting : 0.00 1 0 oneopt : 0.00 1 0 fixandinfer : 0.00 0 0 feaspump : 0.00 0 0 coefdiving : 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.04 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.02 12 355 29.58 17750.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.00 1 63 63.00 - strong branching : 0.03 5 321 64.20 10700.00 (at root node) : - 5 321 64.20 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 2 nodes : 1 nodes (total) : 2 nodes left : 0 max depth : 0 max depth (total): 0 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 : 13 (2 improvements) Primal Bound : +4.71549999999960e+02 (in run 1, after 1 nodes, 0.51 seconds, depth 0, found by ) Dual Bound : +4.71549999999960e+02 Gap : 0.00 % Root Dual Bound : +4.71549999999960e+02 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- bal8x12.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job bal8x12.gms Stop 10/01/08 11:41:03 elapsed 0:00:00.658