--- Job ran4x64 Start 10/03/08 05:35:26 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 --- ran4x64.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran4x64.gdx --- ran4x64.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.008 --- ran4x64.gms(123) 4 Mb --- Generating MIP model m --- ran4x64.gms(124) 4 Mb --- 325 rows 513 columns 1,537 non-zeroes --- 256 discrete-columns --- ran4x64.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.017 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, 256 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 0 del vars, 0 del conss, 256 chg bounds, 0 chg sides, 0 chg coeffs, 256 upgd conss, 0 impls, 0 clqs (0.0s) probing: 101/256 (39.5%) - 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, 256 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 256 implications, 0 cliques presolved problem has 512 variables (256 bin, 0 int, 0 impl, 256 cont) and 324 constraints 256 constraints of type 68 constraints of type Presolving Time: 0.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 348 |1183k| 0 | 9.637933e+03 | -- | Inf r 1 | 0 | 348 |1192k| 0 | 9.637933e+03 | 1.001200e+04 | 3.88% 1 | 0 | 378 |1387k| 0 | 9.672479e+03 | 1.001200e+04 | 3.51% 1 | 0 | 394 |1469k| 0 | 9.675613e+03 | 1.001200e+04 | 3.48% 1 | 0 | 424 |1541k| 0 | 9.681239e+03 | 1.001200e+04 | 3.42% 1 | 0 | 457 |1639k| 0 | 9.684080e+03 | 1.001200e+04 | 3.39% 1 | 0 | 473 |1669k| 0 | 9.684963e+03 | 1.001200e+04 | 3.38% 1 | 0 | 495 |1693k| 0 | 9.685746e+03 | 1.001200e+04 | 3.37% 1 | 0 | 520 |1733k| 0 | 9.686466e+03 | 1.001200e+04 | 3.36% 1 | 0 | 544 |1757k| 0 | 9.687537e+03 | 1.001200e+04 | 3.35% 1 | 0 | 568 |1771k| 0 | 9.688618e+03 | 1.001200e+04 | 3.34% 1 | 0 | 587 |1804k| 0 | 9.688828e+03 | 1.001200e+04 | 3.34% 1 | 0 | 603 |1812k| 0 | 9.689112e+03 | 1.001200e+04 | 3.33% E 1 | 0 | 731 |1828k| 0 | 9.689112e+03 | 9.711000e+03 | 0.23% 1 | 0 | 731 |1828k| 0 | 9.689112e+03 | 9.711000e+03 | 0.23% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 731 |1762k| 0 | 9.689112e+03 | 9.711000e+03 | 0.23% 1 | 0 | 731 |1761k| 0 | 9.689112e+03 | 9.711000e+03 | 0.23% (run 1, node 1) restarting after 153 global fixings of integer variables (restart) converted 68 cuts from the global cut pool into linear constraints presolving: (round 1) 321 del vars, 33 del conss, 2 chg bounds, 0 chg sides, 5 chg coeffs, 0 upgd conss, 323 impls, 0 clqs (round 2) 321 del vars, 37 del conss, 2 chg bounds, 3 chg sides, 5 chg coeffs, 0 upgd conss, 323 impls, 0 clqs (round 3) 321 del vars, 37 del conss, 2 chg bounds, 3 chg sides, 5 chg coeffs, 16 upgd conss, 323 impls, 0 clqs presolving (4 rounds): 321 deleted vars, 37 deleted constraints, 2 tightened bounds, 0 added holes, 3 changed sides, 5 changed coefficients 323 implications, 0 cliques presolved problem has 191 variables (103 bin, 0 int, 0 impl, 88 cont) and 186 constraints 103 constraints of type 8 constraints of type 67 constraints of type 8 constraints of type Presolving Time: 0.02 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 923 |1409k| 0 | 9.690431e+03 | 9.711000e+03 | 0.21% 1 | 0 | 944 |1423k| 0 | 9.692458e+03 | 9.711000e+03 | 0.19% 1 | 0 | 944 |1429k| 0 | 9.692458e+03 | 9.711000e+03 | 0.19% (run 2, node 1) restarting after 24 global fixings of integer variables (restart) converted 6 cuts from the global cut pool into linear constraints presolving: (round 1) 52 del vars, 16 del conss, 2 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 332 impls, 0 clqs (round 2) 52 del vars, 16 del conss, 2 chg bounds, 2 chg sides, 2 chg coeffs, 1 upgd conss, 332 impls, 0 clqs presolving (3 rounds): 52 deleted vars, 16 deleted constraints, 2 tightened bounds, 0 added holes, 2 changed sides, 2 changed coefficients 332 implications, 0 cliques presolved problem has 139 variables (79 bin, 0 int, 0 impl, 60 cont) and 152 constraints 79 constraints of type 5 constraints of type 62 constraints of type 6 constraints of type Presolving Time: 0.03 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1087 |1370k| 0 | 9.694543e+03 | 9.711000e+03 | 0.17% 1 | 0 | 1112 |1408k| 0 | 9.697916e+03 | 9.711000e+03 | 0.13% 1 | 0 | 1112 |1414k| 0 | 9.697916e+03 | 9.711000e+03 | 0.13% (run 3, node 1) restarting after 20 global fixings of integer variables (restart) converted 12 cuts from the global cut pool into linear constraints presolving: (round 1) 36 del vars, 9 del conss, 3 chg bounds, 3 chg sides, 3 chg coeffs, 0 upgd conss, 339 impls, 0 clqs (round 2) 37 del vars, 10 del conss, 4 chg bounds, 3 chg sides, 3 chg coeffs, 0 upgd conss, 339 impls, 0 clqs (round 3) 37 del vars, 11 del conss, 4 chg bounds, 4 chg sides, 3 chg coeffs, 0 upgd conss, 339 impls, 0 clqs presolving (4 rounds): 37 deleted vars, 11 deleted constraints, 4 tightened bounds, 0 added holes, 4 changed sides, 3 changed coefficients 339 implications, 0 cliques presolved problem has 102 variables (58 bin, 0 int, 0 impl, 44 cont) and 138 constraints 58 constraints of type 5 constraints of type 70 constraints of type 5 constraints of type Presolving Time: 0.03 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1241 |1359k| 0 | 9.700422e+03 | 9.711000e+03 | 0.11% 1 | 0 | 1260 |1379k| 0 | 9.702383e+03 | 9.711000e+03 | 0.09% 1 | 0 | 1260 |1384k| 0 | 9.702383e+03 | 9.711000e+03 | 0.09% (run 4, node 1) restarting after 14 global fixings of integer variables (restart) converted 8 cuts from the global cut pool into linear constraints presolving: (round 1) 29 del vars, 12 del conss, 5 chg bounds, 0 chg sides, 4 chg coeffs, 0 upgd conss, 345 impls, 0 clqs (round 2) 30 del vars, 14 del conss, 6 chg bounds, 0 chg sides, 6 chg coeffs, 0 upgd conss, 345 impls, 0 clqs (round 3) 30 del vars, 15 del conss, 6 chg bounds, 1 chg sides, 6 chg coeffs, 0 upgd conss, 345 impls, 0 clqs (round 4) 30 del vars, 15 del conss, 6 chg bounds, 1 chg sides, 6 chg coeffs, 2 upgd conss, 345 impls, 0 clqs presolving (5 rounds): 30 deleted vars, 15 deleted constraints, 6 tightened bounds, 0 added holes, 1 changed sides, 6 changed coefficients 345 implications, 0 cliques presolved problem has 72 variables (43 bin, 0 int, 0 impl, 29 cont) and 121 constraints 43 constraints of type 4 constraints of type 70 constraints of type 4 constraints of type Presolving Time: 0.03 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1356 |1343k| 0 | 9.709025e+03 | 9.711000e+03 | 0.02% 1 | 0 | 1377 |1360k| 0 | 9.710838e+03 | 9.711000e+03 | 0.00% 1 | 0 | 1377 |1367k| 0 | 9.711000e+03 | 9.711000e+03 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 1.32 Solving Nodes : 1 (total of 5 nodes in 5 runs) Primal Bound : +9.71100000000000e+03 (21 solutions) Dual Bound : +9.71100000000000e+03 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 1.32 Original Problem : Problem name : gamsmodel Variables : 512 (256 binary, 0 integer, 0 implicit integer, 256 continuous) Constraints : 324 initial, 324 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 72 (43 binary, 0 integer, 0 implicit integer, 29 continuous) Constraints : 121 initial, 121 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.01 391 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.00 0 0 0 12 0 18 0 0 knapsack : 0.00 0 0 0 0 0 5 5 5 linear : 0.01 14 35 0 258 0 50 5 11 logicor : 0.00 0 0 0 0 0 6 0 0 root node : - 223 - - 411 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 5 0 1 16 0 0 0 varbound : 43 17 219 0 0 0 192 0 0 0 knapsack : 4 4 15 0 0 0 0 2 0 0 linear : 70 17 219 0 0 0 25 27 0 0 logicor : 4 4 4 0 0 0 0 0 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.32 0.00 0.00 0.32 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 knapsack : 0.01 0.01 0.00 0.00 0.00 linear : 0.01 0.01 0.00 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 0 0 0 pseudoobj : 0.00 40 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 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 : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 0 - - 0 - (maximal pool size: 29) redcost : 0.00 17 0 178 0 0 impliedbounds : 0.00 17 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.07 17 0 0 31 0 strongcg : 0.05 17 0 0 0 0 cmir : 0.44 14 0 0 299 0 flowcover : 0.16 14 0 0 98 0 clique : 0.00 5 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.32 5 1 16 0 0 0 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 - 0 pseudo solutions : 0.00 - 0 simplerounding : 0.00 21 20 rounding : 0.01 21 0 shifting : 0.00 21 0 intshifting : 0.01 1 0 oneopt : 0.00 1 0 fixandinfer : 0.00 0 0 feaspump : 0.00 0 0 coefdiving : 0.00 0 0 pscostdiving : 0.00 0 0 fracdiving : 0.00 0 0 veclendiving : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 objpscostdiving : 0.00 0 0 rootsoldiving : 0.00 0 0 linesearchdiving : 0.00 0 0 guideddiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.07 1 1 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.01 0 0 0.00 - dual LP : 0.10 20 1249 62.45 12490.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.01 1 128 128.00 - strong branching : 0.32 97 4414 45.51 13793.75 (at root node) : - 97 4414 45.51 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 5 nodes : 1 nodes (total) : 5 nodes left : 0 max depth : 0 max depth (total): 0 backtracks : 0 (0.0%) delayed cutoffs : 0 repropagations : 0 (0 domain reductions, 0 cutoffs) avg switch length: 2.00 switching time : 0.00 Solution : Solutions found : 21 (2 improvements) Primal Bound : +9.71100000000000e+03 (in run 1, after 1 nodes, 0.71 seconds, depth 0, found by ) Dual Bound : +9.71100000000000e+03 Gap : 0.00 % Root Dual Bound : +9.71100000000000e+03 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- ran4x64.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran4x64.gms Stop 10/03/08 05:35:28 elapsed 0:00:01.398