--- Job lseu Start 10/01/08 18:27: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 --- lseu.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/lseu.gdx --- lseu.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.035 --- lseu.gms(123) 4 Mb --- Generating MIP model m --- lseu.gms(124) 4 Mb --- 29 rows 90 columns 395 non-zeroes --- 89 discrete-columns --- Executing SCIP: elapsed 0:00:00.038 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) 1 del vars, 0 del conss, 0 chg bounds, 2 chg sides, 25 chg coeffs, 0 upgd conss, 4 impls, 15 clqs (round 2) 2 del vars, 1 del conss, 0 chg bounds, 2 chg sides, 25 chg coeffs, 22 upgd conss, 4 impls, 15 clqs (round 3) 2 del vars, 1 del conss, 0 chg bounds, 2 chg sides, 25 chg coeffs, 26 upgd conss, 4 impls, 15 clqs presolving (4 rounds): 2 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 25 changed coefficients 4 implications, 15 cliques presolved problem has 87 variables (87 bin, 0 int, 0 impl, 0 cont) and 27 constraints 6 constraints of type 15 constraints of type 1 constraints of type 5 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 | 27 | 303k| 0 | 9.479572e+02 | -- | Inf 1 | 0 | 191 | 340k| 0 | 1.001879e+03 | -- | Inf s 1 | 0 | 191 | 341k| 0 | 1.001879e+03 | 2.616000e+03 | 161.11% 1 | 0 | 200 | 357k| 0 | 1.004226e+03 | 2.616000e+03 | 160.50% 1 | 0 | 216 | 370k| 0 | 1.023308e+03 | 2.616000e+03 | 155.64% 1 | 0 | 221 | 379k| 0 | 1.027436e+03 | 2.616000e+03 | 154.61% 1 | 0 | 223 | 382k| 0 | 1.029837e+03 | 2.616000e+03 | 154.02% 1 | 0 | 225 | 389k| 0 | 1.030769e+03 | 2.616000e+03 | 153.79% 1 | 0 | 228 | 393k| 0 | 1.030899e+03 | 2.616000e+03 | 153.76% 1 | 0 | 230 | 399k| 0 | 1.031415e+03 | 2.616000e+03 | 153.63% s 1 | 0 | 230 | 400k| 0 | 1.031415e+03 | 2.254000e+03 | 118.53% 1 | 0 | 233 | 404k| 0 | 1.033101e+03 | 2.254000e+03 | 118.18% s 1 | 0 | 233 | 405k| 0 | 1.033101e+03 | 1.148000e+03 | 11.12% 1 | 0 | 236 | 407k| 0 | 1.033913e+03 | 1.148000e+03 | 11.03% 1 | 0 | 236 | 408k| 0 | 1.033913e+03 | 1.148000e+03 | 11.03% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 2 | 236 | 410k| 0 | 1.033913e+03 | 1.148000e+03 | 11.03% (run 1, node 1) restarting after 15 global fixings of integer variables (restart) converted 19 cuts from the global cut pool into linear constraints presolving: (round 1) 15 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 10 impls, 12 clqs (round 2) 15 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 19 upgd conss, 10 impls, 12 clqs presolving (3 rounds): 15 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients 10 implications, 12 cliques presolved problem has 72 variables (72 bin, 0 int, 0 impl, 0 cont) and 44 constraints 22 constraints of type 14 constraints of type 1 constraints of type 7 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 | 289 | 359k| 0 | 1.034380e+03 | 1.148000e+03 | 10.98% 1 | 2 | 289 | 360k| 0 | 1.034380e+03 | 1.148000e+03 | 10.98% R 7 | 3 | 328 | 364k| 5 | 1.045642e+03 | 1.145000e+03 | 9.50% 100 | 18 | 796 | 381k| 12 | 1.051649e+03 | 1.145000e+03 | 8.88% * 112 | 19 | 863 | 383k| 12 | 1.066198e+03 | 1.136000e+03 | 6.55% * 167 | 23 | 1123 | 394k| 14 | 1.082041e+03 | 1.120000e+03 | 3.51% 200 | 16 | 1279 | 393k| 14 | 1.090551e+03 | 1.120000e+03 | 2.70% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.44 Solving Nodes : 250 (total of 251 nodes in 2 runs) Primal Bound : +1.12000000000000e+03 (22 solutions) Dual Bound : +1.12000000000000e+03 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.44 Original Problem : Problem name : gamsmodel Variables : 89 (89 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 28 initial, 28 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 72 (72 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 44 initial, 60 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 15 0 0 0 0 0 0 0 dualfix : 0.00 2 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 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 0 0 1 2 26 logicor : 0.00 0 0 0 0 0 1 0 0 root node : - 44 - - 44 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 219 0 12 109 0 0 268 knapsack : 22 12 876 2 0 6 147 10 0 0 setppc : 14 12 868 2 0 4 345 0 0 0 linear : 1 12 857 2 0 33 132 4 0 0 logicor : 7+ 12 284 2 0 5 62 0 0 0 countsols : 0 0 0 2 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.13 0.00 0.00 0.13 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.01 0.00 0.01 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 3 0 10 pseudoobj : 0.00 732 3 3 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 51 27 65 33.5 0 0.0 - infeasible LP : 0.00 31 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 : - - - 17 19.8 - - - applied locally : - - - 19 36.4 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 0 - - 0 - (maximal pool size: 0) redcost : 0.00 345 0 820 0 0 impliedbounds : 0.00 13 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.03 13 0 0 9 0 strongcg : 0.02 13 0 0 6 0 cmir : 0.03 11 0 0 27 0 flowcover : 0.03 11 0 0 37 0 clique : 0.01 13 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.13 217 12 109 0 0 268 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 - 2 pseudo solutions : 0.00 - 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.00 4 0 coefdiving : 0.00 1 0 pscostdiving : 0.00 1 0 fracdiving : 0.00 1 0 simplerounding : 0.00 124 0 rounding : 0.00 242 1 shifting : 0.01 29 18 intshifting : 0.00 0 0 fixandinfer : 0.00 0 0 feaspump : 0.01 1 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.03 1 1 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.10 300 1364 4.55 13640.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.01 33 146 4.42 - strong branching : 0.12 417 3667 8.79 30558.33 (at root node) : - 34 612 18.00 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 2 nodes : 250 nodes (total) : 251 nodes left : 0 max depth : 14 max depth (total): 14 backtracks : 51 (20.4%) delayed cutoffs : 5 repropagations : 15 (41 domain reductions, 5 cutoffs) avg switch length: 3.19 switching time : 0.00 Solution : Solutions found : 22 (6 improvements) Primal Bound : +1.12000000000000e+03 (in run 2, after 167 nodes, 0.36 seconds, depth 14, found by ) Dual Bound : +1.12000000000000e+03 Gap : 0.00 % Root Dual Bound : +1.03437955117009e+03 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- lseu.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job lseu.gms Stop 10/01/08 18:27:03 elapsed 0:00:00.557