--- Job mod008 Start 10/01/08 23:18:55 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 --- mod008.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mod008.gdx --- mod008.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.031 --- mod008.gms(123) 4 Mb --- Generating MIP model m --- mod008.gms(124) 4 Mb --- 7 rows 320 columns 1,563 non-zeroes --- 319 discrete-columns --- Executing SCIP: elapsed 0:00:00.039 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: (0.0s) probing: 101/319 (31.7%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes (0.0s) probing aborted: 100/100 successive totally useless probings presolving (1 rounds): 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 0 implications, 0 cliques presolved problem has 319 variables (319 bin, 0 int, 0 impl, 0 cont) and 6 constraints 6 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.02 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 15 | 650k| 0 | 2.909311e+02 | -- | Inf r 1 | 0 | 15 | 654k| 0 | 2.909311e+02 | 5.100000e+02 | 75.30% R 1 | 0 | 15 | 657k| 0 | 2.909311e+02 | 4.460000e+02 | 53.30% s 1 | 0 | 15 | 660k| 0 | 2.909311e+02 | 4.340000e+02 | 49.18% 1 | 0 | 17 | 899k| 0 | 2.910214e+02 | 4.340000e+02 | 49.13% R 1 | 0 | 17 | 903k| 0 | 2.910214e+02 | 4.330000e+02 | 48.79% s 1 | 0 | 17 | 905k| 0 | 2.910214e+02 | 3.710000e+02 | 27.48% 1 | 0 | 18 | 935k| 0 | 2.911333e+02 | 3.710000e+02 | 27.43% R 1 | 0 | 18 | 938k| 0 | 2.911333e+02 | 3.700000e+02 | 27.09% s 1 | 0 | 18 | 940k| 0 | 2.911333e+02 | 3.650000e+02 | 25.37% 1 | 0 | 19 | 962k| 0 | 2.912451e+02 | 3.650000e+02 | 25.32% 1 | 0 | 20 | 984k| 0 | 2.913543e+02 | 3.650000e+02 | 25.28% 1 | 0 | 27 | 993k| 0 | 2.935785e+02 | 3.650000e+02 | 24.33% 1 | 0 | 31 |1042k| 0 | 2.940827e+02 | 3.650000e+02 | 24.11% 1 | 0 | 36 |1075k| 0 | 2.947045e+02 | 3.650000e+02 | 23.85% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap R 1 | 0 | 36 |1078k| 0 | 2.947045e+02 | 3.120000e+02 | 5.87% 1 | 0 | 39 |1103k| 0 | 2.947448e+02 | 3.120000e+02 | 5.85% 1 | 0 | 42 |1126k| 0 | 2.947961e+02 | 3.120000e+02 | 5.84% 1 | 0 | 43 |1140k| 0 | 2.948680e+02 | 3.120000e+02 | 5.81% 1 | 0 | 46 |1155k| 0 | 2.949476e+02 | 3.120000e+02 | 5.78% 1 | 0 | 62 |1163k| 0 | 2.962629e+02 | 3.120000e+02 | 5.31% 1 | 0 | 78 |1180k| 0 | 2.965373e+02 | 3.120000e+02 | 5.21% 1 | 0 | 85 |1185k| 0 | 2.968700e+02 | 3.120000e+02 | 5.10% 1 | 0 | 88 |1190k| 0 | 2.969310e+02 | 3.120000e+02 | 5.07% E 1 | 0 | 88 |1196k| 0 | 2.969310e+02 | 3.100000e+02 | 4.40% (run 1, node 1) restarting after 153 global fixings of integer variables (restart) converted 16 cuts from the global cut pool into linear constraints presolving: (round 1) 153 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 7 upgd conss, 0 impls, 0 clqs presolving (2 rounds): 153 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 0 implications, 0 cliques presolved problem has 166 variables (166 bin, 0 int, 0 impl, 0 cont) and 22 constraints 3 constraints of type 15 constraints of type 4 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.03 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 170 |1007k| 0 | 2.969310e+02 | 3.100000e+02 | 4.40% 1 | 0 | 182 |1054k| 0 | 2.977183e+02 | 3.100000e+02 | 4.13% 1 | 0 | 193 |1057k| 0 | 2.980857e+02 | 3.100000e+02 | 4.00% 1 | 0 | 194 |1060k| 0 | 2.980930e+02 | 3.100000e+02 | 3.99% 1 | 2 | 194 |1062k| 0 | 2.980930e+02 | 3.100000e+02 | 3.99% (run 2, node 1) restarting after 10 global fixings of integer variables (restart) converted 2 cuts from the global cut pool into linear constraints presolving: (round 1) 10 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs presolving (2 rounds): 10 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 0 implications, 0 cliques presolved problem has 156 variables (156 bin, 0 int, 0 impl, 0 cont) and 23 constraints 4 constraints of type 16 constraints of type 3 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.03 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 236 |1022k| 0 | 2.980930e+02 | 3.100000e+02 | 3.99% 1 | 0 | 242 |1042k| 0 | 2.983387e+02 | 3.100000e+02 | 3.91% 1 | 0 | 246 |1045k| 0 | 2.985188e+02 | 3.100000e+02 | 3.85% 1 | 2 | 246 |1048k| 0 | 2.985188e+02 | 3.100000e+02 | 3.85% * 24 | 5 | 605 |1313k| 10 | 2.987455e+02 | 3.090000e+02 | 3.43% R 29 | 4 | 670 |1326k| 10 | 2.991742e+02 | 3.080000e+02 | 2.95% * 57 | 8 | 1004 |1344k| 14 | 2.991940e+02 | 3.070000e+02 | 2.61% 100 | 9 | 1537 |1338k| 16 | 2.994121e+02 | 3.070000e+02 | 2.53% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.76 Solving Nodes : 171 (total of 173 nodes in 3 runs) Primal Bound : +3.07000000000000e+02 (230 solutions) Dual Bound : +3.07000000000000e+02 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.76 Original Problem : Problem name : gamsmodel Variables : 319 (319 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 6 initial, 6 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 156 (156 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 23 initial, 23 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 163 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.02 0 0 0 0 0 0 0 0 knapsack : 0.01 0 0 0 0 0 0 0 0 linear : 0.00 0 0 0 0 0 0 0 0 logicor : 0.00 0 0 0 0 0 1 0 0 root node : - 288 - - 288 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 270 0 16 301 0 0 172 knapsack : 4 2 547 0 0 3 1 0 0 0 linear : 16 18 752 2 0 7 35 53 0 0 logicor : 3+ 2 125 0 0 0 1 0 0 0 countsols : 0 0 0 2 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.28 0.00 0.00 0.28 0.00 knapsack : 0.00 0.00 0.00 0.00 0.00 linear : 0.05 0.03 0.02 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 38 pseudoobj : 0.00 593 3 41 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 9 7 7 47.9 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 : - - - 0 0.0 - - - applied locally : - - - 7 47.9 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 0 - - 0 - (maximal pool size: 6) redcost : 0.01 338 0 1686 0 0 impliedbounds : 0.00 18 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.02 18 0 0 0 0 strongcg : 0.02 18 0 0 4 0 cmir : 0.01 12 0 0 7 0 flowcover : 0.12 12 0 0 77 0 clique : 0.00 3 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.28 268 16 301 0 0 172 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 crossover : 0.00 0 0 oneopt : 0.00 4 0 coefdiving : 0.00 1 2 pscostdiving : 0.00 1 1 fracdiving : 0.00 1 0 veclendiving : 0.00 1 0 linesearchdiving : 0.00 1 1 guideddiving : 0.01 1 1 rootsoldiving : 0.00 1 2 objpscostdiving : 0.01 1 11 simplerounding : 0.01 298 192 rounding : 0.01 298 5 shifting : 0.00 41 12 intshifting : 0.00 0 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.05 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.12 358 1910 5.34 15916.67 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.02 34 121 3.56 6050.00 strong branching : 0.28 580 7663 13.21 27367.86 (at root node) : - 35 841 24.03 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 3 nodes : 171 nodes (total) : 173 nodes left : 0 max depth : 16 max depth (total): 16 backtracks : 25 (14.6%) delayed cutoffs : 0 repropagations : 4 (1 domain reductions, 0 cutoffs) avg switch length: 2.95 switching time : 0.00 Solution : Solutions found : 230 (12 improvements) Primal Bound : +3.07000000000000e+02 (in run 3, after 57 nodes, 0.55 seconds, depth 14, found by ) Dual Bound : +3.07000000000000e+02 Gap : 0.00 % Root Dual Bound : +2.98518820531191e+02 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- mod008.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job mod008.gms Stop 10/01/08 23:18:55 elapsed 0:00:00.874