--- Job gt2 Start 10/01/08 17:24:47 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 --- gt2.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/gt2.gdx --- gt2.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.013 --- gt2.gms(123) 4 Mb --- Generating MIP model m --- gt2.gms(124) 4 Mb --- 30 rows 189 columns 469 non-zeroes --- 188 discrete-columns --- Executing SCIP: elapsed 0:00:00.019 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, 1 del conss, 12 chg bounds, 1 chg sides, 11 chg coeffs, 0 upgd conss, 0 impls, 2 clqs (round 2) 15 del vars, 1 del conss, 99 chg bounds, 1 chg sides, 11 chg coeffs, 0 upgd conss, 0 impls, 2 clqs (round 3) 15 del vars, 1 del conss, 99 chg bounds, 1 chg sides, 11 chg coeffs, 3 upgd conss, 0 impls, 2 clqs presolving (4 rounds): 15 deleted vars, 1 deleted constraints, 99 tightened bounds, 0 added holes, 1 changed sides, 11 changed coefficients 0 implications, 2 cliques presolved problem has 173 variables (33 bin, 140 int, 0 impl, 0 cont) and 28 constraints 1 constraints of type 2 constraints of type 25 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 56 | 387k| 0 | 2.014676e+04 | -- | Inf 1 | 0 | 263 | 436k| 0 | 2.038234e+04 | -- | Inf s 1 | 0 | 263 | 439k| 0 | 2.038234e+04 | 1.999380e+05 | 880.94% 1 | 0 | 271 | 473k| 0 | 2.068542e+04 | 1.999380e+05 | 866.56% s 1 | 0 | 271 | 476k| 0 | 2.068542e+04 | 1.820190e+05 | 779.94% 1 | 0 | 283 | 498k| 0 | 2.069979e+04 | 1.820190e+05 | 779.33% 1 | 0 | 296 | 511k| 0 | 2.072547e+04 | 1.820190e+05 | 778.24% 1 | 0 | 305 | 521k| 0 | 2.073742e+04 | 1.820190e+05 | 777.73% 1 | 0 | 311 | 525k| 0 | 2.075076e+04 | 1.820190e+05 | 777.17% 1 | 0 | 320 | 531k| 0 | 2.076779e+04 | 1.820190e+05 | 776.45% 1 | 0 | 328 | 540k| 0 | 2.076903e+04 | 1.820190e+05 | 776.40% 1 | 0 | 331 | 540k| 0 | 2.082183e+04 | 1.820190e+05 | 774.17% 1 | 0 | 348 | 555k| 0 | 2.116600e+04 | 1.820190e+05 | 759.96% 1 | 0 | 352 | 562k| 0 | 2.116600e+04 | 1.820190e+05 | 759.96% 1 | 0 | 353 | 564k| 0 | 2.116600e+04 | 1.820190e+05 | 759.96% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 355 | 566k| 0 | 2.116600e+04 | 1.820190e+05 | 759.96% k 1 | 0 | 355 | 571k| 0 | 2.116600e+04 | 1.800390e+05 | 750.60% 1 | 0 | 355 | 569k| 0 | 2.116600e+04 | 1.800390e+05 | 750.60% 1 | 2 | 355 | 569k| 0 | 2.116600e+04 | 1.800390e+05 | 750.60% * 12 | 0 | 424 | 597k| 7 | 2.116600e+04 | 2.116600e+04 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.14 Solving Nodes : 12 Primal Bound : +2.11660000000000e+04 (5 solutions) Dual Bound : +2.11660000000000e+04 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.14 Original Problem : Problem name : gamsmodel Variables : 188 (24 binary, 164 integer, 0 implicit integer, 0 continuous) Constraints : 29 initial, 29 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 173 (33 binary, 140 integer, 0 implicit integer, 0 continuous) Constraints : 28 initial, 35 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 15 0 0 0 0 0 0 0 boundshift : 0.00 0 0 0 0 0 0 0 0 inttobinary : 0.00 0 0 11 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 knapsack : 0.00 0 0 0 0 0 0 0 0 setppc : 0.00 0 0 0 0 0 0 0 0 linear : 0.00 0 0 0 99 0 1 1 11 bounddisjunction : 0.00 0 0 0 0 0 0 0 0 root node : - 0 - - 0 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 12 0 0 0 0 0 22 knapsack : 1 14 132 1 0 0 0 0 0 0 setppc : 2 14 127 1 0 0 20 0 0 0 linear : 25 14 132 1 0 2 65 0 0 0 bounddisjunction : 0+ 0 3 0 0 0 0 0 0 0 countsols : 0 0 0 1 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.01 0.00 0.00 0.01 0.00 knapsack : 0.00 0.00 0.00 0.00 0.00 setppc : 0.00 0.00 0.00 0.00 0.00 linear : 0.00 0.00 0.00 0.00 0.00 bounddisjunction : 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 78 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 2 2 10 29.6 0 0.0 - infeasible LP : 0.00 1 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 : - - - 7 28.9 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 13 - - 39 - (maximal pool size: 140) redcost : 0.00 26 0 0 0 0 impliedbounds : 0.00 15 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 15 0 0 48 0 strongcg : 0.00 15 0 0 33 0 cmir : 0.02 10 0 0 68 0 flowcover : 0.04 10 0 0 40 0 clique : 0.00 15 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.01 11 0 0 0 0 22 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 - 1 pseudo solutions : 0.00 - 0 pscostdiving : 0.00 0 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 oneopt : 0.00 1 1 simplerounding : 0.00 0 0 rounding : 0.00 24 0 shifting : 0.00 14 3 intshifting : 0.00 0 0 fixandinfer : 0.00 0 0 feaspump : 0.01 1 0 coefdiving : 0.01 1 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.02 1 0 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 25 189 7.56 9450.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.00 66 235 3.56 - strong branching : 0.01 43 198 4.60 - (at root node) : - 3 10 3.33 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 12 nodes (total) : 12 nodes left : 0 max depth : 7 max depth (total): 7 backtracks : 1 (8.3%) delayed cutoffs : 0 repropagations : 0 (0 domain reductions, 0 cutoffs) avg switch length: 2.00 switching time : 0.00 Solution : Solutions found : 5 (4 improvements) Primal Bound : +2.11660000000000e+04 (in run 1, after 12 nodes, 0.14 seconds, depth 5, found by ) Dual Bound : +2.11660000000000e+04 Gap : 0.00 % Root Dual Bound : +2.11660000000000e+04 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- gt2.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job gt2.gms Stop 10/01/08 17:24:47 elapsed 0:00:00.196