--- Job gesa3_o Start 10/01/08 17:24:43 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 --- gesa3_o.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/gesa3_o.gdx --- gesa3_o.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.128 --- gesa3_o.gms(123) 4 Mb --- Generating MIP model m --- gesa3_o.gms(124) 4 Mb --- 1,225 rows 1,153 columns 4,417 non-zeroes --- 672 discrete-columns --- gesa3_o.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.209 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) 72 del vars, 72 del conss, 528 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 96 impls, 0 clqs (round 2) 72 del vars, 72 del conss, 528 chg bounds, 0 chg sides, 0 chg coeffs, 888 upgd conss, 96 impls, 0 clqs (0.1s) probing: 317/336 (94.3%) - 0 fixings, 0 aggregations, 400 implications, 30 bound changes (0.1s) probing aborted: 100/100 successive totally useless probings (round 3) 72 del vars, 72 del conss, 558 chg bounds, 0 chg sides, 0 chg coeffs, 888 upgd conss, 900 impls, 0 clqs (round 4) 72 del vars, 72 del conss, 561 chg bounds, 0 chg sides, 24 chg coeffs, 888 upgd conss, 900 impls, 0 clqs (round 5) 72 del vars, 72 del conss, 561 chg bounds, 0 chg sides, 24 chg coeffs, 890 upgd conss, 900 impls, 0 clqs (0.1s) probing: 327/336 (97.3%) - 0 fixings, 0 aggregations, 400 implications, 30 bound changes (0.1s) probing aborted: 100/100 successive totally useless probings presolving (6 rounds): 72 deleted vars, 72 deleted constraints, 561 tightened bounds, 0 added holes, 0 changed sides, 24 changed coefficients 900 implications, 0 cliques presolved problem has 1080 variables (342 bin, 306 int, 0 impl, 432 cont) and 1152 constraints 720 constraints of type 262 constraints of type 170 constraints of type Presolving Time: 0.10 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 502 |3217k| 0 | 2.784460e+07 | -- | Inf 1 | 0 | 1371 |3292k| 0 | 2.791544e+07 | -- | Inf 1 | 0 | 1456 |3350k| 0 | 2.795310e+07 | -- | Inf 1 | 0 | 1518 |3372k| 0 | 2.795895e+07 | -- | Inf 1 | 0 | 1555 |3395k| 0 | 2.796211e+07 | -- | Inf 1 | 0 | 1577 |3403k| 0 | 2.796318e+07 | -- | Inf s 1 | 0 | 1577 |3425k| 0 | 2.796318e+07 | 2.964430e+07 | 6.01% 1 | 0 | 1590 |3430k| 0 | 2.796696e+07 | 2.964430e+07 | 6.00% 1 | 0 | 1605 |3435k| 0 | 2.796829e+07 | 2.964430e+07 | 5.99% 1 | 0 | 1607 |3437k| 0 | 2.796845e+07 | 2.964430e+07 | 5.99% 1 | 0 | 1610 |3438k| 0 | 2.796898e+07 | 2.964430e+07 | 5.99% 1 | 0 | 1615 |3438k| 0 | 2.796955e+07 | 2.964430e+07 | 5.99% k 1 | 0 | 1812 |3485k| 0 | 2.796955e+07 | 2.913251e+07 | 4.16% E 1 | 0 | 1812 |3485k| 0 | 2.796955e+07 | 2.799143e+07 | 0.08% 1 | 0 | 1812 |3485k| 0 | 2.796955e+07 | 2.799143e+07 | 0.08% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1812 |3252k| 0 | 2.796955e+07 | 2.799143e+07 | 0.08% 1 | 2 | 1812 |3253k| 0 | 2.796955e+07 | 2.799143e+07 | 0.08% (run 1, node 1) restarting after 201 global fixings of integer variables (restart) converted 86 cuts from the global cut pool into linear constraints presolving: (round 1) 471 del vars, 31 del conss, 0 chg bounds, 4 chg sides, 12 chg coeffs, 0 upgd conss, 2655 impls, 0 clqs (round 2) 499 del vars, 32 del conss, 0 chg bounds, 4 chg sides, 12 chg coeffs, 0 upgd conss, 2957 impls, 0 clqs (round 3) 499 del vars, 53 del conss, 0 chg bounds, 4 chg sides, 12 chg coeffs, 0 upgd conss, 2957 impls, 0 clqs (round 4) 499 del vars, 54 del conss, 8 chg bounds, 4 chg sides, 12 chg coeffs, 0 upgd conss, 2957 impls, 0 clqs (round 5) 499 del vars, 54 del conss, 8 chg bounds, 4 chg sides, 12 chg coeffs, 29 upgd conss, 2957 impls, 0 clqs presolving (6 rounds): 499 deleted vars, 54 deleted constraints, 8 tightened bounds, 0 added holes, 4 changed sides, 12 changed coefficients 2957 implications, 0 cliques presolved problem has 581 variables (84 bin, 201 int, 0 impl, 296 cont) and 804 constraints 488 constraints of type 250 constraints of type 66 constraints of type Presolving Time: 0.12 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 2340 |2993k| 0 | 2.796955e+07 | 2.799143e+07*| 0.08% 1 | 0 | 2343 |2930k| 0 | 2.796982e+07 | 2.799143e+07*| 0.08% 1 | 2 | 2343 |2931k| 0 | 2.796982e+07 | 2.799143e+07*| 0.08% * 4 | 3 | 2425 |3043k| 3 | 2.797957e+07 | 2.799104e+07 | 0.04% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 3.22 Solving Nodes : 9 (total of 10 nodes in 2 runs) Primal Bound : +2.79910426483827e+07 (4 solutions) Dual Bound : +2.79910426483827e+07 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 3.22 Original Problem : Problem name : gamsmodel Variables : 1152 (336 binary, 336 integer, 0 implicit integer, 480 continuous) Constraints : 1224 initial, 1224 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 581 (84 binary, 201 integer, 0 implicit integer, 296 continuous) Constraints : 804 initial, 804 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 331 0 0 0 0 0 0 0 dualfix : 0.00 140 0 0 0 0 0 0 0 boundshift : 0.00 0 0 0 0 0 0 0 0 inttobinary : 0.00 0 0 32 0 0 0 0 0 implics : 0.00 0 46 0 0 0 0 0 0 probing : 0.05 0 0 0 30 0 0 0 0 varbound : 0.00 0 0 0 0 0 0 4 36 linear : 0.05 0 54 0 539 0 117 0 0 logicor : 0.02 0 0 0 0 0 9 0 0 root node : - 392 - - 1390 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 21 0 3 51 0 0 10 varbound : 488 13 1106 1 0 0 1033 0 0 0 linear : 250 13 1106 1 0 0 1006 16 0 0 logicor : 66 13 581 1 0 0 79 0 0 0 countsols : 0 0 0 1 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.48 0.00 0.00 0.48 0.00 varbound : 0.02 0.00 0.02 0.00 0.00 linear : 0.05 0.02 0.03 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 1 0 19 pseudoobj : 0.00 193 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: 9) redcost : 0.00 38 0 894 0 0 impliedbounds : 0.00 13 0 0 11 0 intobj : 0.00 0 0 0 0 0 gomory : 0.08 13 0 0 27 0 strongcg : 0.04 13 0 0 1 0 cmir : 1.48 11 0 0 345 0 flowcover : 0.37 11 0 0 19 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.48 20 3 51 0 0 10 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 fracdiving : 0.00 0 0 oneopt : 0.03 2 1 coefdiving : 0.00 1 0 pscostdiving : 0.00 1 0 simplerounding : 0.01 33 0 rounding : 0.00 33 0 shifting : 0.03 14 1 intshifting : 0.00 1 0 fixandinfer : 0.00 0 0 feaspump : 0.14 1 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.14 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.21 34 1597 46.97 7604.76 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.15 33 1010 30.61 6733.33 strong branching : 0.48 159 5891 37.05 12272.92 (at root node) : - 51 2817 55.24 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 2 nodes : 9 nodes (total) : 10 nodes left : 0 max depth : 3 max depth (total): 3 backtracks : 2 (22.2%) delayed cutoffs : 0 repropagations : 3 (11 domain reductions, 0 cutoffs) avg switch length: 2.44 switching time : 0.01 Solution : Solutions found : 4 (4 improvements) Primal Bound : +2.79910426483827e+07 (in run 2, after 4 nodes, 3.08 seconds, depth 3, found by ) Dual Bound : +2.79910426483827e+07 Gap : 0.00 % Root Dual Bound : +2.79698162357993e+07 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- gesa3_o.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job gesa3_o.gms Stop 10/01/08 17:24:47 elapsed 0:00:03.597