--- Job l152lav Start 10/01/08 18:26: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 --- l152lav.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/l152lav.gdx --- l152lav.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.025 --- l152lav.gms(123) 4 Mb --- Generating MIP model m --- l152lav.gms(124) 4 Mb --- 98 rows 1,990 columns 11,912 non-zeroes --- 1,989 discrete-columns --- l152lav.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.066 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, 0 chg bounds, 0 chg sides, 0 chg coeffs, 96 upgd conss, 0 impls, 95 clqs (0.8s) probing: 814/1989 (40.9%) - 0 fixings, 0 aggregations, 529 implications, 0 bound changes (0.8s) probing aborted: 100/100 successive totally useless probings presolving (2 rounds): 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 1058 implications, 95 cliques presolved problem has 1989 variables (1989 bin, 0 int, 0 impl, 0 cont) and 97 constraints 1 constraints of type 95 constraints of type 1 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.78 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 436 |4464k| 0 | 4.656364e+03 | -- | Inf 1 | 0 | 1127 |4549k| 0 | 4.656505e+03 | -- | Inf 1 | 2 | 1127 |4549k| 0 | 4.656505e+03 | -- | Inf * 5 | 4 | 1437 |4613k| 4 | 4.663943e+03 | 4.880000e+03 | 4.63% * 7 | 4 | 1533 |4671k| 5 | 4.663943e+03 | 4.879000e+03 | 4.61% * 17 | 6 | 2110 |4679k| 11 | 4.663943e+03 | 4.768000e+03 | 2.23% R 25 | 8 | 2547 |4728k| 11 | 4.668198e+03 | 4.753000e+03 | 1.82% * 28 | 7 | 2622 |4756k| 11 | 4.668198e+03 | 4.746000e+03 | 1.67% * 40 | 6 | 3309 |4772k| 11 | 4.675179e+03 | 4.737000e+03 | 1.32% * 44 | 4 | 3590 |4800k| 11 | 4.675179e+03 | 4.734000e+03 | 1.26% * 77 | 3 | 5146 |4852k| 11 | 4.691786e+03 | 4.722000e+03 | 0.64% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 7.89 Solving Nodes : 80 Primal Bound : +4.72200000000000e+03 (10 solutions) Dual Bound : +4.72200000000000e+03 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 7.89 Original Problem : Problem name : gamsmodel Variables : 1989 (1989 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 97 initial, 97 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 1989 (1989 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 97 initial, 105 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 0 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.76 0 0 0 0 0 0 0 0 knapsack : 0.00 0 0 0 0 0 0 0 0 setppc : 0.00 0 0 0 0 0 0 0 0 linear : 0.01 0 0 0 0 0 0 0 0 logicor : 0.00 0 0 0 0 0 0 0 0 root node : - 1165 - - 1165 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 194 0 19 347 0 0 80 knapsack : 1 2 2246 6 0 0 0 0 0 0 setppc : 95 2 2246 7 0 2 4304 0 0 0 linear : 1 2 2244 7 0 0 0 0 0 0 logicor : 0+ 0 65 0 0 0 0 0 0 0 countsols : 0 0 0 7 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 5.76 0.00 0.00 5.76 0.00 knapsack : 0.00 0.00 0.00 0.00 0.00 setppc : 0.01 0.00 0.01 0.00 0.00 linear : 0.47 0.00 0.47 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 8 0 1106 pseudoobj : 0.01 519 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 2 2 7 72.4 1 89.0 - infeasible LP : 0.00 16 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 : - - - 8 74.5 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 1 - - 0 - (maximal pool size: 2) redcost : 0.02 195 0 12406 0 0 impliedbounds : 0.00 2 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 2 0 0 0 0 strongcg : 0.00 2 0 0 0 0 cmir : 0.02 2 0 0 0 0 flowcover : 0.02 2 0 0 0 0 clique : 0.00 2 0 0 2 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 : 5.76 187 19 347 0 0 80 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 - 7 pseudo solutions : 0.00 - 0 guideddiving : 0.00 0 0 crossover : 0.00 0 0 oneopt : 0.01 8 0 coefdiving : 0.01 1 0 pscostdiving : 0.00 1 0 fracdiving : 0.02 1 0 veclendiving : 0.01 1 0 linesearchdiving : 0.03 1 0 objpscostdiving : 0.01 1 1 rootsoldiving : 0.03 1 1 simplerounding : 0.00 0 0 rounding : 0.04 188 1 shifting : 0.00 9 0 intshifting : 0.00 0 0 fixandinfer : 0.00 0 0 feaspump : 0.09 1 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.03 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.00 0 0 0.00 - dual LP : 0.80 208 4349 20.91 5436.25 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.18 50 1006 20.12 5588.89 strong branching : 5.76 1333 50507 37.89 8768.58 (at root node) : - 38 1388 36.53 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 80 nodes (total) : 80 nodes left : 0 max depth : 11 max depth (total): 11 backtracks : 14 (17.5%) delayed cutoffs : 0 repropagations : 8 (0 domain reductions, 0 cutoffs) avg switch length: 3.12 switching time : 0.03 Solution : Solutions found : 10 (8 improvements) Primal Bound : +4.72200000000000e+03 (in run 1, after 77 nodes, 7.76 seconds, depth 8, found by ) Dual Bound : +4.72200000000000e+03 Gap : 0.00 % Root Dual Bound : +4.65650505050505e+03 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- l152lav.gms(124) 0 Mb --- Reading solution for model m --- l152lav.gms(124) 3 Mb *** Status: Normal completion --- Job l152lav.gms Stop 10/01/08 18:27:02 elapsed 0:00:08.069