--- Job gesa3 Start 10/01/08 17:24:41 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.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/gesa3.gdx --- gesa3.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.029 --- gesa3.gms(123) 4 Mb --- Generating MIP model m --- gesa3.gms(124) 4 Mb --- 1,369 rows 1,153 columns 5,737 non-zeroes --- 384 discrete-columns --- gesa3.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.068 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, 482 chg bounds, 0 chg sides, 40 chg coeffs, 0 upgd conss, 96 impls, 0 clqs (round 2) 72 del vars, 72 del conss, 483 chg bounds, 0 chg sides, 40 chg coeffs, 0 upgd conss, 96 impls, 0 clqs (round 3) 72 del vars, 72 del conss, 483 chg bounds, 0 chg sides, 40 chg coeffs, 768 upgd conss, 96 impls, 0 clqs (round 4) 72 del vars, 72 del conss, 503 chg bounds, 0 chg sides, 40 chg coeffs, 768 upgd conss, 821 impls, 0 clqs (round 5) 72 del vars, 72 del conss, 505 chg bounds, 0 chg sides, 56 chg coeffs, 768 upgd conss, 821 impls, 0 clqs presolving (6 rounds): 72 deleted vars, 72 deleted constraints, 505 tightened bounds, 0 added holes, 0 changed sides, 56 changed coefficients 821 implications, 0 cliques presolved problem has 1080 variables (219 bin, 165 int, 240 impl, 456 cont) and 1296 constraints 720 constraints of type 528 constraints of type 48 constraints of type Presolving Time: 0.08 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 578 |3360k| 0 | 2.784644e+07 | -- | Inf 1 | 0 | 1554 |3523k| 0 | 2.793154e+07 | -- | Inf s 1 | 0 | 1554 |3540k| 0 | 2.793154e+07 | 3.032837e+07 | 8.58% 1 | 0 | 1617 |3576k| 0 | 2.794847e+07 | 3.032837e+07 | 8.52% 1 | 0 | 1647 |3597k| 0 | 2.795116e+07 | 3.032837e+07 | 8.50% s 1 | 0 | 1647 |3613k| 0 | 2.795116e+07 | 2.966232e+07 | 6.12% 1 | 0 | 1657 |3619k| 0 | 2.795161e+07 | 2.966232e+07 | 6.12% 1 | 0 | 1667 |3626k| 0 | 2.795324e+07 | 2.966232e+07 | 6.11% 1 | 0 | 1698 |3649k| 0 | 2.795782e+07 | 2.966232e+07 | 6.10% 1 | 0 | 1715 |3651k| 0 | 2.795896e+07 | 2.966232e+07 | 6.09% 1 | 0 | 1741 |3674k| 0 | 2.796325e+07 | 2.966232e+07 | 6.08% 1 | 0 | 1749 |3675k| 0 | 2.796389e+07 | 2.966232e+07 | 6.07% k 1 | 0 | 1922 |3712k| 0 | 2.796389e+07 | 2.897661e+07 | 3.62% E 1 | 0 | 1922 |3712k| 0 | 2.796389e+07 | 2.799143e+07 | 0.10% 1 | 0 | 1922 |3712k| 0 | 2.796389e+07 | 2.799143e+07 | 0.10% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1922 |3427k| 0 | 2.796389e+07 | 2.799143e+07 | 0.10% 1 | 0 | 1922 |3427k| 0 | 2.796389e+07 | 2.799143e+07 | 0.10% (run 1, node 1) restarting after 205 global fixings of integer variables (restart) converted 89 cuts from the global cut pool into linear constraints presolving: (round 1) 518 del vars, 48 del conss, 9 chg bounds, 6 chg sides, 47 chg coeffs, 0 upgd conss, 3791 impls, 1 clqs (round 2) 519 del vars, 96 del conss, 9 chg bounds, 8 chg sides, 49 chg coeffs, 0 upgd conss, 3791 impls, 1 clqs (round 3) 519 del vars, 96 del conss, 23 chg bounds, 8 chg sides, 49 chg coeffs, 0 upgd conss, 3791 impls, 1 clqs (round 4) 519 del vars, 96 del conss, 23 chg bounds, 8 chg sides, 49 chg coeffs, 16 upgd conss, 3791 impls, 1 clqs presolving (5 rounds): 519 deleted vars, 96 deleted constraints, 23 tightened bounds, 0 added holes, 8 changed sides, 49 changed coefficients 3799 implications, 1 cliques presolved problem has 561 variables (69 bin, 112 int, 72 impl, 308 cont) and 865 constraints 453 constraints of type 1 constraints of type 379 constraints of type 32 constraints of type Presolving Time: 0.10 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 2430 |3154k| 0 | 2.796403e+07 | 2.799143e+07*| 0.10% 1 | 0 | 2432 |3156k| 0 | 2.796406e+07 | 2.799143e+07*| 0.10% 1 | 2 | 2432 |3157k| 0 | 2.796406e+07 | 2.799143e+07*| 0.10% * 7 | 2 | 2588 |3268k| 4 | 2.797436e+07 | 2.799104e+07 | 0.06% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 2.49 Solving Nodes : 15 (total of 16 nodes in 2 runs) Primal Bound : +2.79910426483827e+07 (7 solutions) Dual Bound : +2.79910426483827e+07 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 2.49 Original Problem : Problem name : gamsmodel Variables : 1152 (216 binary, 168 integer, 0 implicit integer, 768 continuous) Constraints : 1368 initial, 1368 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 561 (69 binary, 112 integer, 72 implicit integer, 308 continuous) Constraints : 865 initial, 865 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 341 0 0 0 0 0 0 0 dualfix : 0.00 145 0 0 0 0 0 0 0 boundshift : 0.00 0 0 0 0 0 0 0 0 inttobinary : 0.00 0 0 27 0 0 0 0 0 implics : 0.00 0 46 0 0 0 0 0 0 probing : 0.03 0 0 0 20 0 0 0 0 varbound : 0.01 0 0 0 5 0 10 6 22 setppc : 0.00 0 0 0 0 0 0 0 0 linear : 0.06 2 57 0 503 0 158 2 83 logicor : 0.00 0 0 0 0 0 0 0 0 root node : - 418 - - 1349 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 22 0 2 57 0 0 14 varbound : 453 12 847 1 0 0 1293 0 0 0 setppc : 1 1 28 0 0 0 0 0 0 0 linear : 379 12 847 1 0 0 1187 7 0 0 logicor : 32 12 254 0 0 0 142 0 0 0 countsols : 0 0 0 1 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.53 0.00 0.00 0.53 0.00 varbound : 0.01 0.00 0.01 0.00 0.00 setppc : 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 1 0 29 pseudoobj : 0.00 216 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: 3) redcost : 0.00 42 0 1032 0 0 impliedbounds : 0.00 12 0 0 7 0 intobj : 0.00 0 0 0 0 0 gomory : 0.07 12 0 0 20 0 strongcg : 0.01 12 0 0 13 0 cmir : 0.94 11 0 0 245 0 flowcover : 0.34 11 0 0 30 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.53 21 2 57 0 0 14 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 coefdiving : 0.00 0 0 pscostdiving : 0.00 0 0 fracdiving : 0.00 0 0 veclendiving : 0.00 0 0 objpscostdiving : 0.00 0 0 oneopt : 0.03 2 1 simplerounding : 0.00 0 0 rounding : 0.00 34 0 shifting : 0.01 13 4 intshifting : 0.00 1 0 fixandinfer : 0.00 0 0 feaspump : 0.09 1 0 intdiving : 0.00 0 0 actconsdiving : 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.17 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.18 39 1712 43.90 9511.11 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.11 21 1033 49.19 9390.91 strong branching : 0.53 164 5604 34.17 10573.58 (at root node) : - 52 2219 42.67 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 2 nodes : 15 nodes (total) : 16 nodes left : 0 max depth : 4 max depth (total): 4 backtracks : 3 (20.0%) delayed cutoffs : 0 repropagations : 5 (57 domain reductions, 0 cutoffs) avg switch length: 2.67 switching time : 0.01 Solution : Solutions found : 7 (5 improvements) Primal Bound : +2.79910426483827e+07 (in run 2, after 7 nodes, 2.31 seconds, depth 3, found by ) Dual Bound : +2.79910426483827e+07 Gap : 0.00 % Root Dual Bound : +2.79640628783214e+07 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- gesa3.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job gesa3.gms Stop 10/01/08 17:24:43 elapsed 0:00:02.684