--- Job qnet1_o Start 10/03/08 04:05:00 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 --- qnet1_o.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/qnet1_o.gdx --- qnet1_o.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.011 --- qnet1_o.gms(123) 4 Mb --- Generating MIP model m --- qnet1_o.gms(124) 4 Mb --- 457 rows 1,542 columns 4,339 non-zeroes --- 1,417 discrete-columns --- qnet1_o.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.031 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) 124 del vars, 124 del conss, 124 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 64 impls, 48 clqs (round 2) 211 del vars, 211 del conss, 124 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 64 impls, 48 clqs (round 3) 211 del vars, 211 del conss, 133 chg bounds, 0 chg sides, 1 chg coeffs, 48 upgd conss, 64 impls, 48 clqs (round 4) 211 del vars, 211 del conss, 133 chg bounds, 0 chg sides, 1 chg coeffs, 48 upgd conss, 64 impls, 48 clqs (0.1s) probing: 342/1257 (27.2%) - 0 fixings, 0 aggregations, 55 implications, 0 bound changes (0.1s) probing aborted: 100/100 successive totally useless probings presolving (5 rounds): 211 deleted vars, 211 deleted constraints, 133 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients 119 implications, 48 cliques presolved problem has 1330 variables (1257 bin, 73 int, 0 impl, 0 cont) and 245 constraints 48 constraints of type 197 constraints of type Presolving Time: 0.05 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 142 |2849k| 0 | 1.255725e+04 | -- | Inf r 1 | 0 | 142 |2871k| 0 | 1.255725e+04 | 2.846214e+04 | 126.66% s 1 | 0 | 142 |2912k| 0 | 1.255725e+04 | 2.555019e+04 | 103.47% 1 | 0 | 245 |3052k| 0 | 1.429853e+04 | 2.555019e+04 | 78.69% 1 | 0 | 308 |3187k| 0 | 1.477794e+04 | 2.555019e+04 | 72.89% 1 | 0 | 370 |3247k| 0 | 1.495964e+04 | 2.555019e+04 | 70.79% 1 | 0 | 452 |3300k| 0 | 1.515722e+04 | 2.555019e+04 | 68.57% 1 | 0 | 552 |3350k| 0 | 1.545664e+04 | 2.555019e+04 | 65.30% 1 | 0 | 673 |3378k| 0 | 1.563760e+04 | 2.555019e+04 | 63.39% 1 | 0 | 741 |3407k| 0 | 1.578935e+04 | 2.555019e+04 | 61.82% 1 | 0 | 771 |3418k| 0 | 1.580242e+04 | 2.555019e+04 | 61.69% 1 | 0 | 799 |3423k| 0 | 1.581200e+04 | 2.555019e+04 | 61.59% 1 | 0 | 819 |3427k| 0 | 1.581697e+04 | 2.555019e+04 | 61.54% E 1 | 0 | 819 |3446k| 0 | 1.581697e+04 | 2.067301e+04 | 30.70% 1 | 0 | 819 |3446k| 0 | 1.581697e+04 | 2.067301e+04 | 30.70% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 819 |3443k| 0 | 1.581697e+04 | 2.067301e+04 | 30.70% 1 | 2 | 819 |3443k| 0 | 1.581697e+04 | 2.067301e+04 | 30.70% * 14 | 8 | 2195 |3700k| 6 | 1.589519e+04 | 2.020748e+04 | 27.13% * 15 | 6 | 2372 |3715k| 6 | 1.589519e+04 | 1.910264e+04 | 20.18% * 20 | 6 | 2954 |3729k| 6 | 1.597842e+04 | 1.819849e+04 | 13.89% * 27 | 9 | 3591 |3807k| 9 | 1.597893e+04 | 1.815921e+04 | 13.64% * 38 | 1 | 4835 |3787k| 10 | 1.598135e+04 | 1.602969e+04 | 0.30% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 3.68 Solving Nodes : 39 Primal Bound : +1.60296926810000e+04 (13 solutions) Dual Bound : +1.60296926810000e+04 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 3.68 Original Problem : Problem name : gamsmodel Variables : 1541 (1288 binary, 129 integer, 0 implicit integer, 124 continuous) Constraints : 456 initial, 456 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 1330 (1257 binary, 73 integer, 0 implicit integer, 0 continuous) Constraints : 245 initial, 245 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 1 0 0 0 0 0 implics : 0.00 0 0 0 0 0 0 0 0 probing : 0.04 0 0 0 0 0 0 0 0 setppc : 0.00 0 0 0 0 0 0 0 0 linear : 0.01 0 211 0 133 0 211 0 1 logicor : 0.00 0 0 0 0 0 0 0 0 bounddisjunction : 0.00 0 0 0 0 0 0 0 0 root node : - 348 - - 383 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 55 0 3 52 0 0 48 setppc : 48 12 991 5 0 0 163 0 0 0 linear : 197 12 991 5 0 1 758 3 0 0 logicor : 0+ 0 10 0 0 0 0 0 0 0 bounddisjunction : 0+ 0 10 0 0 0 0 0 0 0 countsols : 0 0 0 5 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 2.35 0.00 0.00 2.35 0.00 setppc : 0.00 0.00 0.00 0.00 0.00 linear : 0.06 0.06 0.00 0.00 0.00 logicor : 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 5 0 346 pseudoobj : 0.00 268 0 137 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 1 1 2 15.5 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 : - - - 2 15.5 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 10 - - 17 - (maximal pool size: 241) redcost : 0.02 89 0 3032 0 0 impliedbounds : 0.00 12 0 0 3 0 intobj : 0.00 0 0 0 0 0 gomory : 0.23 12 0 0 26 0 strongcg : 0.20 12 0 0 6 0 cmir : 0.09 10 0 0 129 0 flowcover : 0.12 10 0 0 103 0 clique : 0.00 12 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 : 2.35 50 3 52 0 0 48 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 - 5 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 crossover : 0.00 0 0 coefdiving : 0.01 1 1 simplerounding : 0.00 54 4 rounding : 0.00 60 0 shifting : 0.00 11 2 intshifting : 0.00 0 0 oneopt : 0.00 6 0 fixandinfer : 0.00 0 0 feaspump : 0.00 0 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.01 0 0 0.00 - dual LP : 0.48 72 4846 67.31 10095.83 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.00 7 40 5.71 - strong branching : 2.33 504 26482 52.54 11365.67 (at root node) : - 32 1971 61.59 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 39 nodes (total) : 39 nodes left : 0 max depth : 10 max depth (total): 10 backtracks : 5 (12.8%) delayed cutoffs : 0 repropagations : 12 (43 domain reductions, 0 cutoffs) avg switch length: 2.46 switching time : 0.02 Solution : Solutions found : 13 (8 improvements) Primal Bound : +1.60296926810000e+04 (in run 1, after 38 nodes, 3.66 seconds, depth 10, found by ) Dual Bound : +1.60296926810000e+04 Gap : 0.00 % Root Dual Bound : +1.58169701487306e+04 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- qnet1_o.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job qnet1_o.gms Stop 10/03/08 04:05:04 elapsed 0:00:03.796