--- Job mod010 Start 10/01/08 23:18:56 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 --- mod010.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mod010.gdx --- mod010.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.031 --- mod010.gms(123) 4 Mb --- Generating MIP model m --- mod010.gms(124) 5 Mb --- 147 rows 2,656 columns 13,859 non-zeroes --- 2,655 discrete-columns --- mod010.gms(124) 5 Mb --- Executing SCIP: elapsed 0:00:00.081 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, 145 upgd conss, 0 impls, 144 clqs (round 2) 83 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 145 upgd conss, 0 impls, 153 clqs (0.9s) probing: 1000/2572 (38.9%) - 36 fixings, 0 aggregations, 9447 implications, 0 bound changes (round 3) 133 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 145 upgd conss, 21146 impls, 152 clqs (round 4) 163 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 145 upgd conss, 21146 impls, 150 clqs (1.1s) probing: 1234/2572 (48.0%) - 51 fixings, 0 aggregations, 9860 implications, 0 bound changes (1.1s) probing aborted: 100/100 successive totally useless probings (round 5) 164 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 145 upgd conss, 21146 impls, 150 clqs (round 6) 192 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 145 upgd conss, 21146 impls, 149 clqs (1.1s) probing: 1244/2572 (48.4%) - 51 fixings, 0 aggregations, 9860 implications, 0 bound changes (1.1s) probing aborted: 100/100 successive totally useless probings presolving (7 rounds): 192 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 44 changed coefficients 21146 implications, 149 cliques presolved problem has 2463 variables (2463 bin, 0 int, 0 impl, 0 cont) and 141 constraints 1 constraints of type 139 constraints of type 1 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 1.12 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 638 |6056k| 0 | 6.532083e+03 | -- | Inf 1 | 0 | 2495 |6162k| 0 | 6.532500e+03 | -- | Inf 1 | 0 | 2497 |6169k| 0 | 6.532600e+03 | -- | Inf 1 | 0 | 2501 |6174k| 0 | 6.535000e+03 | -- | Inf 1 | 2 | 2501 |6174k| 0 | 6.535000e+03 | -- | Inf * 6 | 5 | 2583 |6241k| 5 | 6.539000e+03 | 6.573000e+03 | 0.52% * 10 | 2 | 2840 |5899k| 5 | 6.542000e+03 | 6.548000e+03 | 0.09% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 2.04 Solving Nodes : 12 Primal Bound : +6.54800000000000e+03 (2 solutions) Dual Bound : +6.54800000000000e+03 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 2.04 Original Problem : Problem name : gamsmodel Variables : 2655 (2655 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 146 initial, 146 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 2463 (2463 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 141 initial, 141 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 : 1.07 51 0 0 0 0 0 0 0 knapsack : 0.03 0 0 0 0 0 0 0 44 setppc : 0.00 141 0 0 0 0 5 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 : - 2018 - - 2018 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 15 0 2 15 0 0 16 knapsack : 1 4 2707 2 0 0 33 3 0 0 setppc : 139 4 2796 2 0 52 858 0 0 0 linear : 1 4 2744 2 0 0 0 0 0 0 logicor : 0+ 0 3 0 0 0 0 0 0 0 countsols : 0 0 0 2 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.34 0.00 0.00 0.34 0.00 knapsack : 0.01 0.00 0.01 0.00 0.00 setppc : 0.01 0.00 0.01 0.00 0.00 linear : 0.63 0.00 0.63 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.01 2 0 1928 pseudoobj : 0.01 83 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 1 1 2 25.0 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 : - - - 2 25.0 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 3 - - 5 - (maximal pool size: 7) redcost : 0.00 24 0 781 0 0 impliedbounds : 0.00 4 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 4 0 0 0 0 strongcg : 0.00 4 0 0 0 0 cmir : 0.04 4 0 0 3 0 flowcover : 0.02 4 0 0 6 0 clique : 0.01 4 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.34 13 2 15 0 0 16 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 fracdiving : 0.00 0 0 veclendiving : 0.00 0 0 objpscostdiving : 0.00 0 0 rootsoldiving : 0.00 0 0 oneopt : 0.00 2 0 simplerounding : 0.00 0 0 rounding : 0.02 16 0 shifting : 0.01 4 0 intshifting : 0.00 0 0 fixandinfer : 0.00 0 0 feaspump : 0.24 1 0 coefdiving : 0.04 1 0 pscostdiving : 0.01 1 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 linesearchdiving : 0.00 0 0 guideddiving : 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 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.10 18 821 45.61 8210.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.27 25 2060 82.40 7629.63 strong branching : 0.34 153 2026 13.24 5958.82 (at root node) : - 25 289 11.56 - 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 : 5 max depth (total): 5 backtracks : 4 (33.3%) delayed cutoffs : 0 repropagations : 6 (32 domain reductions, 0 cutoffs) avg switch length: 3.17 switching time : 0.01 Solution : Solutions found : 2 (2 improvements) Primal Bound : +6.54800000000000e+03 (in run 1, after 10 nodes, 1.94 seconds, depth 2, found by ) Dual Bound : +6.54800000000000e+03 Gap : 0.00 % Root Dual Bound : +6.53500000000000e+03 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- mod010.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job mod010.gms Stop 10/01/08 23:18:58 elapsed 0:00:02.211