--- Job set1ch Start 10/03/08 05:38:06 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 --- set1ch.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/set1ch.gdx --- set1ch.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.054 --- set1ch.gms(123) 4 Mb --- Generating MIP model m --- set1ch.gms(124) 4 Mb --- 493 rows 713 columns 1,885 non-zeroes --- 240 discrete-columns --- set1ch.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.067 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) 60 del vars, 60 del conss, 485 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 65 del vars, 66 del conss, 510 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 3) 66 del vars, 66 del conss, 544 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 4) 66 del vars, 66 del conss, 570 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 5) 66 del vars, 66 del conss, 590 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 6) 66 del vars, 66 del conss, 610 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 7) 66 del vars, 66 del conss, 628 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 8) 66 del vars, 66 del conss, 641 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 9) 66 del vars, 66 del conss, 661 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 414 impls, 0 clqs (round 10) 66 del vars, 66 del conss, 661 chg bounds, 0 chg sides, 0 chg coeffs, 235 upgd conss, 414 impls, 0 clqs presolving (11 rounds): 66 deleted vars, 66 deleted constraints, 661 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 414 implications, 0 cliques presolved problem has 646 variables (235 bin, 0 int, 0 impl, 411 cont) and 426 constraints 235 constraints of type 191 constraints of type Presolving Time: 0.04 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 490 |1688k| 0 | 3.511811e+04 | -- | Inf r 1 | 0 | 490 |1700k| 0 | 3.511811e+04 | 1.076915e+05 | 206.66% 1 | 0 | 674 |2023k| 0 | 4.605207e+04 | 1.076915e+05 | 133.85% r 1 | 0 | 674 |2032k| 0 | 4.605207e+04 | 1.050449e+05 | 128.10% 1 | 0 | 778 |2058k| 0 | 5.134439e+04 | 1.050449e+05 | 104.59% r 1 | 0 | 778 |2068k| 0 | 5.134439e+04 | 9.053871e+04 | 76.34% s 1 | 0 | 778 |2078k| 0 | 5.134439e+04 | 8.941627e+04 | 74.15% 1 | 0 | 844 |2130k| 0 | 5.249217e+04 | 8.941627e+04 | 70.34% r 1 | 0 | 844 |2140k| 0 | 5.249217e+04 | 8.843084e+04 | 68.46% s 1 | 0 | 844 |2151k| 0 | 5.249217e+04 | 8.722622e+04 | 66.17% 1 | 0 | 893 |2208k| 0 | 5.327436e+04 | 8.722622e+04 | 63.73% r 1 | 0 | 893 |2217k| 0 | 5.327436e+04 | 8.700204e+04 | 63.31% 1 | 0 | 943 |2266k| 0 | 5.396537e+04 | 8.700204e+04 | 61.22% r 1 | 0 | 943 |2276k| 0 | 5.396537e+04 | 8.451813e+04 | 56.62% 1 | 0 | 977 |2315k| 0 | 5.413594e+04 | 8.451813e+04 | 56.12% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap r 1 | 0 | 977 |2325k| 0 | 5.413594e+04 | 7.342646e+04 | 35.63% 1 | 0 | 997 |2349k| 0 | 5.433393e+04 | 7.342646e+04 | 35.14% r 1 | 0 | 997 |2358k| 0 | 5.433393e+04 | 6.631225e+04 | 22.05% s 1 | 0 | 997 |2368k| 0 | 5.433393e+04 | 6.546723e+04 | 20.49% 1 | 0 | 1013 |2382k| 0 | 5.442839e+04 | 6.546723e+04 | 20.28% r 1 | 0 | 1013 |2391k| 0 | 5.442839e+04 | 6.010305e+04 | 10.43% 1 | 0 | 1018 |2396k| 0 | 5.445096e+04 | 6.010305e+04 | 10.38% 1 | 0 | 1023 |2421k| 0 | 5.446291e+04 | 6.010305e+04 | 10.36% 1 | 0 | 1025 |2431k| 0 | 5.448204e+04 | 6.010305e+04 | 10.32% 1 | 0 | 1028 |2441k| 0 | 5.451427e+04 | 6.010305e+04 | 10.25% s 1 | 0 | 1028 |2460k| 0 | 5.451427e+04 | 5.951741e+04 | 9.18% 1 | 0 | 1029 |2460k| 0 | 5.451545e+04 | 5.951741e+04 | 9.18% r 1 | 0 | 1029 |2469k| 0 | 5.451545e+04 | 5.837809e+04 | 7.09% i 1 | 0 | 1051 |2481k| 0 | 5.451545e+04 | 5.593075e+04 | 2.60% E 1 | 0 | 1051 |2490k| 0 | 5.451545e+04 | 5.463800e+04 | 0.22% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1051 |2490k| 0 | 5.451545e+04 | 5.463800e+04 | 0.22% 1 | 0 | 1051 |2479k| 0 | 5.451545e+04 | 5.463800e+04 | 0.22% 1 | 0 | 1056 |2479k| 0 | 5.451699e+04 | 5.463800e+04 | 0.22% 1 | 0 | 1058 |2488k| 0 | 5.451750e+04 | 5.463800e+04 | 0.22% 1 | 2 | 1058 |2498k| 0 | 5.451750e+04 | 5.463800e+04 | 0.22% (run 1, node 1) restarting after 26 global fixings of integer variables (restart) converted 155 cuts from the global cut pool into linear constraints presolving: (round 1) 75 del vars, 21 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 417 impls, 0 clqs (round 2) 75 del vars, 21 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 23 upgd conss, 417 impls, 0 clqs presolving (3 rounds): 75 deleted vars, 21 deleted constraints, 4 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 417 implications, 0 cliques presolved problem has 571 variables (209 bin, 0 int, 0 impl, 362 cont) and 532 constraints 219 constraints of type 300 constraints of type 13 constraints of type Presolving Time: 0.05 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1562 |2134k| 0 | 5.451750e+04 | 5.463800e+04 | 0.22% 1 | 0 | 1567 |2129k| 0 | 5.451818e+04 | 5.463800e+04 | 0.22% 1 | 2 | 1567 |2139k| 0 | 5.451818e+04 | 5.463800e+04 | 0.22% (run 2, node 1) restarting after 29 global fixings of integer variables (restart) converted 2 cuts from the global cut pool into linear constraints presolving: (round 1) 84 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 418 impls, 0 clqs (round 2) 84 del vars, 27 del conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 418 impls, 0 clqs (round 3) 84 del vars, 27 del conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 3 upgd conss, 418 impls, 0 clqs presolving (4 rounds): 84 deleted vars, 27 deleted constraints, 7 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 418 implications, 0 cliques presolved problem has 487 variables (180 bin, 0 int, 0 impl, 307 cont) and 477 constraints 192 constraints of type 271 constraints of type 14 constraints of type Presolving Time: 0.05 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 2007 |2087k| 0 | 5.451818e+04 | 5.463800e+04 | 0.22% 1 | 0 | 2013 |2100k| 0 | 5.451964e+04 | 5.463800e+04 | 0.22% 1 | 2 | 2060 |2119k| 0 | 5.451964e+04 | 5.463800e+04 | 0.22% c 6 | 6 | 2119 |2275k| 5 | 5.452085e+04 | 5.455850e+04 | 0.07% * 9 | 2 | 2168 |2345k| 5 | 5.453601e+04 | 5.454125e+04 | 0.01% * 10 | 1 | 2177 |2371k| 5 | 5.453601e+04 | 5.453775e+04 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.89 Solving Nodes : 11 (total of 13 nodes in 3 runs) Primal Bound : +5.45377500000000e+04 (57 solutions) Dual Bound : +5.45377500000000e+04 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.89 Original Problem : Problem name : gamsmodel Variables : 712 (240 binary, 0 integer, 0 implicit integer, 472 continuous) Constraints : 492 initial, 492 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 487 (180 binary, 0 integer, 0 implicit integer, 307 continuous) Constraints : 477 initial, 477 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 113 0 0 0 0 0 0 0 dualfix : 0.00 1 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 varbound : 0.00 0 0 0 0 0 0 0 0 linear : 0.02 5 106 0 672 0 114 0 0 logicor : 0.00 0 0 0 0 0 0 0 0 root node : - 123 - - 443 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 22 0 0 23 0 0 20 varbound : 192 18 112 2 0 0 240 0 0 0 linear : 271 18 829 2 0 0 241 17 0 0 logicor : 14 2 11 0 0 0 11 0 0 0 countsols : 0 0 0 2 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.10 0.00 0.00 0.10 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 linear : 0.03 0.02 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 3 0 164 pseudoobj : 0.00 137 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: 8) redcost : 0.00 41 0 106 0 0 impliedbounds : 0.00 18 0 0 129 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 18 0 0 142 0 strongcg : 0.02 18 0 0 1 0 cmir : 0.22 12 0 0 997 0 flowcover : 0.23 12 0 0 338 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.10 20 0 23 0 0 20 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 coefdiving : 0.01 1 8 simplerounding : 0.00 37 36 rounding : 0.00 37 0 shifting : 0.01 21 7 intshifting : 0.02 2 1 fixandinfer : 0.00 0 0 feaspump : 0.00 0 0 pscostdiving : 0.00 1 2 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.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.02 0 0 0.00 0.00 dual LP : 0.14 39 2073 53.15 14807.14 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.02 14 114 8.14 5700.00 strong branching : 0.10 91 1076 11.82 10760.00 (at root node) : - 31 308 9.94 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 3 nodes : 11 nodes (total) : 13 nodes left : 0 max depth : 5 max depth (total): 5 backtracks : 4 (36.4%) delayed cutoffs : 0 repropagations : 8 (185 domain reductions, 0 cutoffs) avg switch length: 3.09 switching time : 0.00 Solution : Solutions found : 57 (19 improvements) Primal Bound : +5.45377500000000e+04 (in run 3, after 10 nodes, 0.89 seconds, depth 3, found by ) Dual Bound : +5.45377500000000e+04 Gap : 0.00 % Root Dual Bound : +5.45196396937574e+04 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- set1ch.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job set1ch.gms Stop 10/03/08 05:38:07 elapsed 0:00:01.040