--- Job gesa2_o Start 10/01/08 17:24:39 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 --- gesa2_o.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/gesa2_o.gdx --- gesa2_o.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.017 --- gesa2_o.gms(123) 4 Mb --- Generating MIP model m --- gesa2_o.gms(124) 4 Mb --- 1,249 rows 1,225 columns 4,609 non-zeroes --- 720 discrete-columns --- gesa2_o.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.051 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) 48 del vars, 48 del conss, 557 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 96 impls, 0 clqs (round 2) 48 del vars, 48 del conss, 567 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 96 impls, 0 clqs (round 3) 48 del vars, 48 del conss, 569 chg bounds, 3 chg sides, 3 chg coeffs, 0 upgd conss, 96 impls, 0 clqs (round 4) 48 del vars, 48 del conss, 574 chg bounds, 3 chg sides, 3 chg coeffs, 960 upgd conss, 96 impls, 0 clqs (round 5) 48 del vars, 48 del conss, 574 chg bounds, 3 chg sides, 3 chg coeffs, 964 upgd conss, 538 impls, 0 clqs (0.1s) probing: 346/394 (87.8%) - 0 fixings, 0 aggregations, 388 implications, 39 bound changes (0.1s) probing aborted: 100/100 successive totally useless probings (round 6) 48 del vars, 48 del conss, 613 chg bounds, 3 chg sides, 3 chg coeffs, 964 upgd conss, 944 impls, 0 clqs (round 7) 48 del vars, 48 del conss, 614 chg bounds, 6 chg sides, 37 chg coeffs, 964 upgd conss, 944 impls, 0 clqs (round 8) 48 del vars, 48 del conss, 614 chg bounds, 6 chg sides, 37 chg coeffs, 964 upgd conss, 944 impls, 0 clqs (0.1s) probing: 356/394 (90.4%) - 0 fixings, 0 aggregations, 388 implications, 39 bound changes (0.1s) probing aborted: 100/100 successive totally useless probings presolving (9 rounds): 48 deleted vars, 48 deleted constraints, 614 tightened bounds, 0 added holes, 6 changed sides, 37 changed coefficients 944 implications, 0 cliques presolved problem has 1176 variables (396 bin, 324 int, 0 impl, 456 cont) and 1200 constraints 768 constraints of type 236 constraints of type 196 constraints of type Presolving Time: 0.09 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 446 |3402k| 0 | 2.548976e+07 | -- | Inf 1 | 0 | 1583 |3485k| 0 | 2.555846e+07 | -- | Inf s 1 | 0 | 1583 |3508k| 0 | 2.555846e+07 | 2.858222e+07 | 11.83% 1 | 0 | 1677 |3553k| 0 | 2.565077e+07 | 2.858222e+07 | 11.43% 1 | 0 | 1741 |3599k| 0 | 2.567386e+07 | 2.858222e+07 | 11.33% 1 | 0 | 1808 |3641k| 0 | 2.570060e+07 | 2.858222e+07 | 11.21% s 1 | 0 | 1808 |3661k| 0 | 2.570060e+07 | 2.768049e+07 | 7.70% 1 | 0 | 1851 |3690k| 0 | 2.570946e+07 | 2.768049e+07 | 7.67% s 1 | 0 | 1851 |3710k| 0 | 2.570946e+07 | 2.700893e+07 | 5.05% 1 | 0 | 1886 |3740k| 0 | 2.573246e+07 | 2.700893e+07 | 4.96% 1 | 0 | 1958 |3773k| 0 | 2.576180e+07 | 2.700893e+07 | 4.84% 1 | 0 | 1987 |3800k| 0 | 2.577089e+07 | 2.700893e+07 | 4.80% 1 | 0 | 1999 |3819k| 0 | 2.577257e+07 | 2.700893e+07 | 4.80% 1 | 0 | 2030 |3834k| 0 | 2.577606e+07 | 2.700893e+07 | 4.78% 1 | 0 | 2036 |3834k| 0 | 2.577637e+07 | 2.700893e+07 | 4.78% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap k 1 | 0 | 2216 |3886k| 0 | 2.577637e+07 | 2.657429e+07 | 3.10% E 1 | 0 | 2216 |3885k| 0 | 2.577637e+07 | 2.578003e+07 | 0.01% 1 | 0 | 2216 |3885k| 0 | 2.577637e+07 | 2.578003e+07 | 0.01% 1 | 0 | 2216 |3472k| 0 | 2.577637e+07 | 2.578003e+07 | 0.01% 1 | 0 | 2216 |3472k| 0 | 2.577637e+07 | 2.578003e+07 | 0.01% (run 1, node 1) restarting after 541 global fixings of integer variables (restart) converted 215 cuts from the global cut pool into linear constraints presolving: (round 1) 800 del vars, 60 del conss, 19 chg bounds, 0 chg sides, 25 chg coeffs, 0 upgd conss, 1085 impls, 0 clqs (round 2) 806 del vars, 67 del conss, 38 chg bounds, 19 chg sides, 28 chg coeffs, 0 upgd conss, 1087 impls, 1 clqs (round 3) 814 del vars, 67 del conss, 40 chg bounds, 19 chg sides, 29 chg coeffs, 0 upgd conss, 1091 impls, 2 clqs (round 4) 814 del vars, 82 del conss, 40 chg bounds, 28 chg sides, 29 chg coeffs, 0 upgd conss, 1091 impls, 2 clqs (round 5) 814 del vars, 82 del conss, 47 chg bounds, 30 chg sides, 29 chg coeffs, 0 upgd conss, 1091 impls, 2 clqs (round 6) 814 del vars, 82 del conss, 47 chg bounds, 30 chg sides, 29 chg coeffs, 54 upgd conss, 1091 impls, 2 clqs (round 7) 822 del vars, 88 del conss, 47 chg bounds, 30 chg sides, 34 chg coeffs, 54 upgd conss, 1101 impls, 3 clqs (round 8) 830 del vars, 108 del conss, 63 chg bounds, 30 chg sides, 34 chg coeffs, 54 upgd conss, 1111 impls, 3 clqs (round 9) 830 del vars, 110 del conss, 63 chg bounds, 31 chg sides, 34 chg coeffs, 54 upgd conss, 1111 impls, 3 clqs (round 10) 830 del vars, 110 del conss, 63 chg bounds, 31 chg sides, 34 chg coeffs, 60 upgd conss, 1111 impls, 3 clqs (round 11) 830 del vars, 112 del conss, 63 chg bounds, 31 chg sides, 34 chg coeffs, 60 upgd conss, 1111 impls, 3 clqs presolving (12 rounds): 830 deleted vars, 112 deleted constraints, 63 tightened bounds, 0 added holes, 31 changed sides, 34 changed coefficients 1111 implications, 3 cliques presolved problem has 346 variables (103 bin, 54 int, 0 impl, 189 cont) and 561 constraints 272 constraints of type 3 constraints of type 227 constraints of type 59 constraints of type Presolving Time: 0.11 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 2537 |3021k| 0 | 2.577830e+07 | 2.578003e+07 | 0.01% 1 | 0 | 2547 |2975k| 0 | 2.577869e+07 | 2.578003e+07 | 0.01% 1 | 0 | 2547 |2974k| 0 | 2.577869e+07 | 2.578003e+07 | 0.01% (run 2, node 1) restarting after 49 global fixings of integer variables (restart) converted 6 cuts from the global cut pool into linear constraints presolving: (round 1) 92 del vars, 39 del conss, 10 chg bounds, 6 chg sides, 31 chg coeffs, 0 upgd conss, 1128 impls, 0 clqs (round 2) 101 del vars, 51 del conss, 17 chg bounds, 7 chg sides, 40 chg coeffs, 0 upgd conss, 1128 impls, 0 clqs (round 3) 101 del vars, 53 del conss, 17 chg bounds, 8 chg sides, 40 chg coeffs, 0 upgd conss, 1128 impls, 0 clqs (round 4) 101 del vars, 53 del conss, 17 chg bounds, 8 chg sides, 40 chg coeffs, 14 upgd conss, 1128 impls, 0 clqs (round 5) 107 del vars, 56 del conss, 17 chg bounds, 8 chg sides, 40 chg coeffs, 14 upgd conss, 1132 impls, 0 clqs (round 6) 116 del vars, 77 del conss, 29 chg bounds, 8 chg sides, 40 chg coeffs, 14 upgd conss, 1132 impls, 0 clqs (round 7) 120 del vars, 77 del conss, 29 chg bounds, 8 chg sides, 40 chg coeffs, 14 upgd conss, 1132 impls, 0 clqs presolving (8 rounds): 120 deleted vars, 77 deleted constraints, 29 tightened bounds, 0 added holes, 8 changed sides, 40 changed coefficients 1132 implications, 0 cliques presolved problem has 226 variables (51 bin, 45 int, 0 impl, 130 cont) and 389 constraints 178 constraints of type 3 constraints of type 183 constraints of type 25 constraints of type Presolving Time: 0.12 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 2718 |2859k| 0 | 2.577902e+07 | 2.578003e+07 | 0.00% 1 | 0 | 2723 |2801k| 0 | 2.577946e+07 | 2.578003e+07 | 0.00% 1 | 0 | 2723 |2801k| 0 | 2.577946e+07 | 2.578003e+07 | 0.00% (run 3, node 1) restarting after 30 global fixings of integer variables (restart) converted 2 cuts from the global cut pool into linear constraints presolving: (round 1) 51 del vars, 17 del conss, 10 chg bounds, 14 chg sides, 15 chg coeffs, 0 upgd conss, 1153 impls, 0 clqs (round 2) 51 del vars, 17 del conss, 10 chg bounds, 16 chg sides, 20 chg coeffs, 0 upgd conss, 1153 impls, 0 clqs (round 3) 51 del vars, 24 del conss, 10 chg bounds, 17 chg sides, 20 chg coeffs, 0 upgd conss, 1153 impls, 0 clqs (round 4) 51 del vars, 24 del conss, 11 chg bounds, 17 chg sides, 20 chg coeffs, 7 upgd conss, 1153 impls, 0 clqs (round 5) 53 del vars, 31 del conss, 11 chg bounds, 17 chg sides, 20 chg coeffs, 7 upgd conss, 1153 impls, 0 clqs (round 6) 55 del vars, 36 del conss, 13 chg bounds, 17 chg sides, 20 chg coeffs, 7 upgd conss, 1153 impls, 0 clqs presolving (7 rounds): 55 deleted vars, 36 deleted constraints, 13 tightened bounds, 0 added holes, 17 changed sides, 20 changed coefficients 1153 implications, 0 cliques presolved problem has 171 variables (36 bin, 26 int, 0 impl, 109 cont) and 264 constraints 125 constraints of type 3 constraints of type 120 constraints of type 16 constraints of type Presolving Time: 0.13 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 2877 |2737k| 0 | 2.577984e+07 | 2.578003e+07 | 0.00% 1 | 0 | 2879 |2708k| 0 | 2.577986e+07 | 2.578003e+07 | 0.00% (run 4, node 1) restarting after 24 global fixings of integer variables (restart) converted 1 cuts from the global cut pool into linear constraints presolving: (round 1) 29 del vars, 4 del conss, 0 chg bounds, 4 chg sides, 6 chg coeffs, 0 upgd conss, 1158 impls, 0 clqs (round 2) 29 del vars, 4 del conss, 1 chg bounds, 4 chg sides, 6 chg coeffs, 6 upgd conss, 1158 impls, 0 clqs presolving (3 rounds): 29 deleted vars, 4 deleted constraints, 1 tightened bounds, 0 added holes, 4 changed sides, 6 changed coefficients 1161 implications, 0 cliques presolved problem has 142 variables (28 bin, 9 int, 0 impl, 105 cont) and 186 constraints 82 constraints of type 95 constraints of type 9 constraints of type Presolving Time: 0.14 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 2966 |2689k| 0 | 2.577986e+07 | 2.578003e+07 | 0.00% 1 | 0 | 2966 |2661k| 0 | 2.577986e+07 | 2.578003e+07 | 0.00% (run 5, node 1) restarting after 17 global fixings of integer variables presolving: (round 1) 33 del vars, 3 del conss, 0 chg bounds, 4 chg sides, 11 chg coeffs, 0 upgd conss, 1161 impls, 0 clqs (round 2) 35 del vars, 5 del conss, 0 chg bounds, 5 chg sides, 11 chg coeffs, 0 upgd conss, 1161 impls, 0 clqs (round 3) 35 del vars, 5 del conss, 0 chg bounds, 5 chg sides, 11 chg coeffs, 10 upgd conss, 1161 impls, 0 clqs (round 4) 37 del vars, 7 del conss, 0 chg bounds, 5 chg sides, 11 chg coeffs, 10 upgd conss, 1164 impls, 0 clqs (round 5) 37 del vars, 13 del conss, 0 chg bounds, 5 chg sides, 11 chg coeffs, 10 upgd conss, 1164 impls, 0 clqs presolving (6 rounds): 37 deleted vars, 13 deleted constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 11 changed coefficients 1164 implications, 0 cliques presolved problem has 105 variables (13 bin, 4 int, 0 impl, 88 cont) and 121 constraints 44 constraints of type 74 constraints of type 3 constraints of type Presolving Time: 0.15 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 3025 |2630k| 0 | 2.577986e+07 | 2.578003e+07 | 0.00% 1 | 0 | 3025 |2625k| 0 | 2.577986e+07 | 2.578003e+07 | 0.00% (run 6, node 1) restarting after 3 global fixings of integer variables presolving: (round 1) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1164 impls, 0 clqs presolving (2 rounds): 5 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 1164 implications, 0 cliques presolved problem has 100 variables (10 bin, 4 int, 0 impl, 86 cont) and 112 constraints 37 constraints of type 73 constraints of type 2 constraints of type Presolving Time: 0.15 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 3082 |2622k| 0 | 2.577986e+07 | 2.578003e+07 | 0.00% * 1 | 0 | 3082 |2633k| 0 | 2.577986e+07 | 2.577986e+07 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 1.79 Solving Nodes : 1 (total of 7 nodes in 7 runs) Primal Bound : +2.57798563716979e+07 (6 solutions) Dual Bound : +2.57798563716979e+07 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 1.79 Original Problem : Problem name : gamsmodel Variables : 1224 (384 binary, 336 integer, 0 implicit integer, 504 continuous) Constraints : 1248 initial, 1248 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 100 (10 binary, 4 integer, 0 implicit integer, 86 continuous) Constraints : 112 initial, 112 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 924 0 0 0 0 0 0 0 dualfix : 0.00 23 0 0 0 0 0 0 0 boundshift : 0.00 0 0 0 0 0 0 0 0 inttobinary : 0.00 0 0 51 0 0 0 0 0 implics : 0.00 0 0 0 0 0 0 0 0 probing : 0.06 0 0 0 39 0 0 0 0 varbound : 0.00 0 0 0 51 0 86 4 56 setppc : 0.00 0 0 0 0 0 2 0 0 linear : 0.04 46 120 0 630 0 159 67 92 logicor : 0.00 11 0 0 0 0 43 0 0 root node : - 664 - - 1364 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 7 0 0 14 0 0 0 varbound : 37 19 1079 4 0 0 450 0 0 0 linear : 73 19 1079 4 0 0 296 19 0 0 logicor : 2 19 617 4 0 0 29 0 0 0 countsols : 0 0 0 4 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.05 0.00 0.00 0.05 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 linear : 0.05 0.04 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 0 0 0 pseudoobj : 0.02 88 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: 0) redcost : 0.01 19 0 573 0 0 impliedbounds : 0.00 16 0 0 14 0 intobj : 0.00 0 0 0 0 0 gomory : 0.03 19 0 0 27 0 strongcg : 0.06 19 0 0 37 0 cmir : 0.79 16 0 0 600 0 flowcover : 0.35 16 0 0 93 0 clique : 0.00 7 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.05 3 0 14 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 - 1 pseudo solutions : 0.00 - 0 simplerounding : 0.00 18 0 rounding : 0.00 18 0 shifting : 0.02 18 3 intshifting : 0.00 1 0 oneopt : 0.02 1 1 fixandinfer : 0.00 0 0 feaspump : 0.09 1 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.05 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.11 21 1840 87.62 16727.27 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.10 24 1242 51.75 12420.00 strong branching : 0.05 36 726 20.17 14520.00 (at root node) : - 36 726 20.17 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 7 nodes : 1 nodes (total) : 7 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 : 6 (6 improvements) Primal Bound : +2.57798563716979e+07 (in run 7, after 1 nodes, 1.79 seconds, depth 0, found by ) Dual Bound : +2.57798563716979e+07 Gap : 0.00 % Root Dual Bound : +2.57798563716979e+07 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- gesa2_o.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job gesa2_o.gms Stop 10/01/08 17:24:41 elapsed 0:00:01.947