--- Job ran6x43 Start 10/03/08 05:35:28 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 --- ran6x43.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran6x43.gdx --- ran6x43.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.007 --- ran6x43.gms(123) 4 Mb --- Generating MIP model m --- ran6x43.gms(124) 4 Mb --- 308 rows 517 columns 1,549 non-zeroes --- 258 discrete-columns --- Executing SCIP: elapsed 0:00:00.016 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, 258 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 0 del vars, 0 del conss, 258 chg bounds, 0 chg sides, 0 chg coeffs, 258 upgd conss, 0 impls, 0 clqs (0.0s) probing: 101/258 (39.1%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes (0.0s) probing aborted: 100/100 successive totally useless probings presolving (3 rounds): 0 deleted vars, 0 deleted constraints, 258 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 258 implications, 0 cliques presolved problem has 516 variables (258 bin, 0 int, 0 impl, 258 cont) and 307 constraints 258 constraints of type 49 constraints of type Presolving Time: 0.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 332 |1177k| 0 | 6.244707e+03 | -- | Inf r 1 | 0 | 332 |1187k| 0 | 6.244707e+03 | 6.634000e+03 | 6.23% 1 | 0 | 368 |1376k| 0 | 6.264474e+03 | 6.634000e+03 | 5.90% 1 | 0 | 387 |1418k| 0 | 6.270348e+03 | 6.634000e+03 | 5.80% 1 | 0 | 419 |1447k| 0 | 6.273174e+03 | 6.634000e+03 | 5.75% 1 | 0 | 466 |1474k| 0 | 6.282859e+03 | 6.634000e+03 | 5.59% 1 | 0 | 512 |1506k| 0 | 6.290224e+03 | 6.634000e+03 | 5.47% 1 | 0 | 561 |1523k| 0 | 6.295622e+03 | 6.634000e+03 | 5.37% 1 | 0 | 601 |1548k| 0 | 6.300247e+03 | 6.634000e+03 | 5.30% 1 | 0 | 623 |1572k| 0 | 6.301817e+03 | 6.634000e+03 | 5.27% 1 | 0 | 652 |1597k| 0 | 6.302625e+03 | 6.634000e+03 | 5.26% 1 | 0 | 697 |1617k| 0 | 6.304007e+03 | 6.634000e+03 | 5.23% 1 | 0 | 738 |1625k| 0 | 6.305535e+03 | 6.634000e+03 | 5.21% 1 | 0 | 749 |1632k| 0 | 6.305671e+03 | 6.634000e+03 | 5.21% 1 | 0 | 751 |1640k| 0 | 6.305706e+03 | 6.634000e+03 | 5.21% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap E 1 | 0 | 873 |1656k| 0 | 6.305706e+03 | 6.381000e+03 | 1.19% 1 | 0 | 873 |1656k| 0 | 6.305706e+03 | 6.381000e+03 | 1.19% 1 | 0 | 873 |1614k| 0 | 6.305706e+03 | 6.381000e+03 | 1.19% 1 | 2 | 873 |1614k| 0 | 6.305706e+03 | 6.381000e+03 | 1.19% (run 1, node 1) restarting after 95 global fixings of integer variables (restart) converted 41 cuts from the global cut pool into linear constraints presolving: (round 1) 197 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 0 upgd conss, 279 impls, 0 clqs (round 2) 197 del vars, 8 del conss, 0 chg bounds, 1 chg sides, 4 chg coeffs, 0 upgd conss, 279 impls, 0 clqs (round 3) 197 del vars, 8 del conss, 0 chg bounds, 1 chg sides, 4 chg coeffs, 17 upgd conss, 279 impls, 0 clqs presolving (4 rounds): 197 deleted vars, 8 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 4 changed coefficients 279 implications, 0 cliques presolved problem has 319 variables (163 bin, 0 int, 0 impl, 156 cont) and 243 constraints 163 constraints of type 5 constraints of type 63 constraints of type 12 constraints of type Presolving Time: 0.02 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1169 |1395k| 0 | 6.305734e+03 | 6.381000e+03 | 1.19% 1 | 0 | 1183 |1403k| 0 | 6.306096e+03 | 6.381000e+03 | 1.19% 1 | 0 | 1192 |1409k| 0 | 6.306626e+03 | 6.381000e+03 | 1.18% 1 | 2 | 1192 |1416k| 0 | 6.306626e+03 | 6.381000e+03 | 1.18% (run 2, node 1) restarting after 9 global fixings of integer variables (restart) converted 3 cuts from the global cut pool into linear constraints presolving: (round 1) 19 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 0 upgd conss, 282 impls, 0 clqs presolving (2 rounds): 19 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 2 changed coefficients 282 implications, 0 cliques presolved problem has 300 variables (154 bin, 0 int, 0 impl, 146 cont) and 235 constraints 154 constraints of type 5 constraints of type 64 constraints of type 12 constraints of type Presolving Time: 0.03 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1481 |1406k| 0 | 6.306680e+03 | 6.381000e+03 | 1.18% 1 | 0 | 1504 |1421k| 0 | 6.307634e+03 | 6.381000e+03 | 1.16% 1 | 0 | 1517 |1427k| 0 | 6.309216e+03 | 6.381000e+03 | 1.14% 1 | 0 | 1518 |1433k| 0 | 6.309217e+03 | 6.381000e+03 | 1.14% 1 | 2 | 1518 |1439k| 0 | 6.309217e+03 | 6.381000e+03 | 1.14% * 36 | 5 | 2157 |1994k| 19 | 6.309241e+03 | 6.333000e+03 | 0.38% * 39 | 4 | 2258 |1981k| 19 | 6.310771e+03 | 6.330000e+03 | 0.30% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 3.03 Solving Nodes : 45 (total of 47 nodes in 3 runs) Primal Bound : +6.32999999999999e+03 (110 solutions) Dual Bound : +6.32999999999999e+03 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 3.03 Original Problem : Problem name : gamsmodel Variables : 516 (258 binary, 0 integer, 0 implicit integer, 258 continuous) Constraints : 307 initial, 307 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 300 (154 binary, 0 integer, 0 implicit integer, 146 continuous) Constraints : 235 initial, 235 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 207 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.01 0 0 0 0 0 0 0 0 varbound : 0.01 0 0 0 0 0 0 0 0 knapsack : 0.00 0 0 0 0 0 0 0 0 linear : 0.00 0 9 0 258 0 10 1 6 logicor : 0.00 0 0 0 0 0 0 0 0 root node : - 170 - - 350 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 92 0 6 117 0 0 58 varbound : 154 17 563 2 0 0 589 0 0 0 knapsack : 5 2 359 0 0 0 0 0 0 0 linear : 64 17 563 2 0 0 250 23 0 0 logicor : 12 2 40 0 0 0 5 0 0 0 countsols : 0 0 0 2 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 1.15 0.00 0.00 1.15 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 knapsack : 0.00 0.00 0.00 0.00 0.00 linear : 0.04 0.03 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 2 0 63 pseudoobj : 0.00 386 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 0 0 0 0.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 : - - - 0 0.0 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 0 - - 0 - (maximal pool size: 11) redcost : 0.00 111 0 351 0 0 impliedbounds : 0.00 17 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.05 17 0 0 11 0 strongcg : 0.06 17 0 0 0 0 cmir : 0.61 12 0 0 276 0 flowcover : 0.12 12 0 0 55 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 : 1.15 90 6 117 0 0 58 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 linesearchdiving : 0.00 0 0 guideddiving : 0.00 0 0 crossover : 0.00 0 0 oneopt : 0.00 3 0 coefdiving : 0.00 1 0 pscostdiving : 0.01 1 0 simplerounding : 0.00 108 107 rounding : 0.00 104 0 shifting : 0.00 31 0 intshifting : 0.01 1 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.71 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.22 119 2213 18.60 10059.09 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.02 5 161 32.20 8050.00 strong branching : 1.15 511 17667 34.57 15362.61 (at root node) : - 106 7615 71.84 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 3 nodes : 45 nodes (total) : 47 nodes left : 0 max depth : 19 max depth (total): 19 backtracks : 8 (17.8%) delayed cutoffs : 0 repropagations : 16 (73 domain reductions, 0 cutoffs) avg switch length: 2.89 switching time : 0.00 Solution : Solutions found : 110 (4 improvements) Primal Bound : +6.32999999999999e+03 (in run 3, after 39 nodes, 3.01 seconds, depth 2, found by ) Dual Bound : +6.32999999999999e+03 Gap : 0.00 % Root Dual Bound : +6.30921722872756e+03 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- ran6x43.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran6x43.gms Stop 10/03/08 05:35:31 elapsed 0:00:03.112