--- Job ran10x12 Start 10/03/08 04:05:10 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 --- ran10x12.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x12.gdx --- ran10x12.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- ran10x12.gms(123) 4 Mb --- Generating MIP model m --- ran10x12.gms(124) 4 Mb --- 143 rows 241 columns 721 non-zeroes --- 120 discrete-columns --- Executing SCIP: elapsed 0:00:00.012 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, 120 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 0 del vars, 0 del conss, 120 chg bounds, 0 chg sides, 0 chg coeffs, 120 upgd conss, 0 impls, 0 clqs (0.0s) probing: 101/120 (84.2%) - 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, 120 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 120 implications, 0 cliques presolved problem has 240 variables (120 bin, 0 int, 0 impl, 120 cont) and 142 constraints 120 constraints of type 22 constraints of type Presolving Time: 0.00 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 159 | 605k| 0 | 2.426225e+03 | -- | Inf r 1 | 0 | 159 | 610k| 0 | 2.426225e+03 | 3.260000e+03 | 34.37% 1 | 0 | 187 | 712k| 0 | 2.587128e+03 | 3.260000e+03 | 26.01% 1 | 0 | 216 | 752k| 0 | 2.623689e+03 | 3.260000e+03 | 24.25% 1 | 0 | 239 | 782k| 0 | 2.643166e+03 | 3.260000e+03 | 23.34% 1 | 0 | 271 | 814k| 0 | 2.655821e+03 | 3.260000e+03 | 22.75% 1 | 0 | 306 | 837k| 0 | 2.667940e+03 | 3.260000e+03 | 22.19% 1 | 0 | 348 | 856k| 0 | 2.673840e+03 | 3.260000e+03 | 21.92% 1 | 0 | 385 | 878k| 0 | 2.677029e+03 | 3.260000e+03 | 21.78% 1 | 0 | 411 | 898k| 0 | 2.678946e+03 | 3.260000e+03 | 21.69% 1 | 0 | 449 | 910k| 0 | 2.681011e+03 | 3.260000e+03 | 21.60% 1 | 0 | 518 | 921k| 0 | 2.686400e+03 | 3.260000e+03 | 21.35% E 1 | 0 | 518 | 928k| 0 | 2.686400e+03 | 2.714000e+03 | 1.03% 1 | 0 | 518 | 928k| 0 | 2.686400e+03 | 2.714000e+03 | 1.03% 1 | 0 | 518 | 911k| 0 | 2.686400e+03 | 2.714000e+03 | 1.03% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 518 | 910k| 0 | 2.686400e+03 | 2.714000e+03 | 1.03% (run 1, node 1) restarting after 49 global fixings of integer variables (restart) converted 120 cuts from the global cut pool into linear constraints presolving: (round 1) 96 del vars, 7 del conss, 3 chg bounds, 0 chg sides, 10 chg coeffs, 0 upgd conss, 122 impls, 0 clqs (round 2) 96 del vars, 17 del conss, 3 chg bounds, 8 chg sides, 10 chg coeffs, 0 upgd conss, 122 impls, 0 clqs (round 3) 96 del vars, 17 del conss, 3 chg bounds, 8 chg sides, 10 chg coeffs, 28 upgd conss, 122 impls, 0 clqs presolving (4 rounds): 96 deleted vars, 17 deleted constraints, 3 tightened bounds, 0 added holes, 8 changed sides, 10 changed coefficients 122 implications, 0 cliques presolved problem has 144 variables (71 bin, 0 int, 0 impl, 73 cont) and 201 constraints 71 constraints of type 6 constraints of type 102 constraints of type 22 constraints of type Presolving Time: 0.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 689 | 845k| 0 | 2.705023e+03 | 2.714000e+03 | 0.33% 1 | 0 | 719 | 845k| 0 | 2.714000e+03 | 2.714000e+03 | 0.00% 1 | 0 | 719 | 845k| 0 | 2.714000e+03 | 2.714000e+03 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.81 Solving Nodes : 1 (total of 2 nodes in 2 runs) Primal Bound : +2.71400000000381e+03 (13 solutions) Dual Bound : +2.71400000000381e+03 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.81 Original Problem : Problem name : gamsmodel Variables : 240 (120 binary, 0 integer, 0 implicit integer, 120 continuous) Constraints : 142 initial, 142 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 144 (71 binary, 0 integer, 0 implicit integer, 73 continuous) Constraints : 201 initial, 201 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 93 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.00 0 0 0 0 0 0 0 0 varbound : 0.00 0 0 0 3 0 5 0 0 knapsack : 0.00 0 0 0 0 0 0 0 0 linear : 0.00 3 0 0 120 0 12 8 10 logicor : 0.00 0 0 0 0 0 0 0 0 root node : - 75 - - 147 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 1 0 0 5 0 0 0 varbound : 71 13 206 0 0 0 69 0 0 0 knapsack : 6 1 3 0 0 0 0 0 0 0 linear : 102 13 206 0 0 0 3 20 0 0 logicor : 22 1 1 0 0 0 1 0 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.13 0.00 0.00 0.13 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.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 19 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: 16) redcost : 0.00 13 0 69 0 0 impliedbounds : 0.00 13 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.04 13 0 0 22 0 strongcg : 0.01 13 0 0 1 0 cmir : 0.43 11 0 0 232 0 flowcover : 0.09 11 0 0 97 0 clique : 0.00 2 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.13 1 0 5 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 12 12 rounding : 0.01 12 0 shifting : 0.00 12 0 intshifting : 0.00 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.02 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.00 0 0 0.00 - dual LP : 0.04 13 719 55.31 17975.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.00 0 0 0.00 - strong branching : 0.13 19 1997 105.11 15361.54 (at root node) : - 19 1997 105.11 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 2 nodes : 1 nodes (total) : 2 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 : 13 (2 improvements) Primal Bound : +2.71400000000381e+03 (in run 1, after 1 nodes, 0.59 seconds, depth 0, found by ) Dual Bound : +2.71400000000381e+03 Gap : 0.00 % Root Dual Bound : +2.71400000000381e+03 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- ran10x12.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x12.gms Stop 10/03/08 04:05:11 elapsed 0:00:00.880