--- Job gesa2 Start 10/01/08 17:24:37 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.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/gesa2.gdx --- gesa2.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.020 --- gesa2.gms(123) 4 Mb --- Generating MIP model m --- gesa2.gms(124) 4 Mb --- 1,393 rows 1,225 columns 6,001 non-zeroes --- 408 discrete-columns --- gesa2.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.058 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, 520 chg bounds, 0 chg sides, 45 chg coeffs, 0 upgd conss, 96 impls, 0 clqs (round 2) 48 del vars, 48 del conss, 521 chg bounds, 1 chg sides, 46 chg coeffs, 0 upgd conss, 96 impls, 0 clqs (round 3) 48 del vars, 48 del conss, 529 chg bounds, 1 chg sides, 46 chg coeffs, 816 upgd conss, 96 impls, 0 clqs (round 4) 48 del vars, 48 del conss, 547 chg bounds, 1 chg sides, 46 chg coeffs, 816 upgd conss, 908 impls, 0 clqs (round 5) 48 del vars, 48 del conss, 547 chg bounds, 4 chg sides, 61 chg coeffs, 816 upgd conss, 908 impls, 0 clqs presolving (6 rounds): 48 deleted vars, 48 deleted constraints, 547 tightened bounds, 0 added holes, 4 changed sides, 61 changed coefficients 908 implications, 0 cliques presolved problem has 1176 variables (248 bin, 160 int, 312 impl, 456 cont) and 1344 constraints 768 constraints of type 528 constraints of type 48 constraints of type Presolving Time: 0.09 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 466 |3545k| 0 | 2.549251e+07 | -- | Inf s 1 | 0 | 466 |3575k| 0 | 2.549251e+07 | 2.773151e+07 | 8.78% 1 | 0 | 543 |3760k| 0 | 2.558381e+07 | 2.773151e+07 | 8.39% 1 | 0 | 646 |3814k| 0 | 2.568503e+07 | 2.773151e+07 | 7.97% s 1 | 0 | 646 |3831k| 0 | 2.568503e+07 | 2.732794e+07 | 6.40% 1 | 0 | 719 |3880k| 0 | 2.570913e+07 | 2.732794e+07 | 6.30% 1 | 0 | 768 |3921k| 0 | 2.576525e+07 | 2.732794e+07 | 6.07% s 1 | 0 | 768 |3938k| 0 | 2.576525e+07 | 2.702197e+07 | 4.88% 1 | 0 | 807 |3961k| 0 | 2.577073e+07 | 2.702197e+07 | 4.86% s 1 | 0 | 807 |3977k| 0 | 2.577073e+07 | 2.676661e+07 | 3.86% 1 | 0 | 822 |3994k| 0 | 2.577129e+07 | 2.676661e+07 | 3.86% 1 | 0 | 844 |4008k| 0 | 2.577607e+07 | 2.676661e+07 | 3.84% 1 | 0 | 849 |4019k| 0 | 2.577631e+07 | 2.676661e+07 | 3.84% 1 | 0 | 855 |4024k| 0 | 2.577700e+07 | 2.676661e+07 | 3.84% 1 | 0 | 858 |4024k| 0 | 2.577712e+07 | 2.676661e+07 | 3.84% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap s 1 | 0 | 858 |4040k| 0 | 2.577712e+07 | 2.650897e+07 | 2.84% E 1 | 0 | 858 |4061k| 0 | 2.577712e+07 | 2.578003e+07 | 0.01% 1 | 0 | 858 |4061k| 0 | 2.577712e+07 | 2.578003e+07 | 0.01% 1 | 0 | 858 |3513k| 0 | 2.577712e+07 | 2.578003e+07 | 0.01% 1 | 0 | 858 |3513k| 0 | 2.577712e+07 | 2.578003e+07 | 0.01% (run 1, node 1) restarting after 554 global fixings of integer variables (restart) converted 170 cuts from the global cut pool into linear constraints presolving: (round 1) 803 del vars, 40 del conss, 3 chg bounds, 7 chg sides, 47 chg coeffs, 0 upgd conss, 1001 impls, 0 clqs (round 2) 805 del vars, 40 del conss, 9 chg bounds, 7 chg sides, 47 chg coeffs, 0 upgd conss, 1001 impls, 0 clqs (round 3) 805 del vars, 57 del conss, 16 chg bounds, 11 chg sides, 47 chg coeffs, 0 upgd conss, 1001 impls, 0 clqs (round 4) 805 del vars, 57 del conss, 42 chg bounds, 11 chg sides, 47 chg coeffs, 0 upgd conss, 1001 impls, 0 clqs (round 5) 806 del vars, 58 del conss, 42 chg bounds, 11 chg sides, 49 chg coeffs, 0 upgd conss, 1001 impls, 0 clqs (round 6) 807 del vars, 58 del conss, 46 chg bounds, 11 chg sides, 49 chg coeffs, 0 upgd conss, 1001 impls, 0 clqs (round 7) 807 del vars, 58 del conss, 46 chg bounds, 11 chg sides, 49 chg coeffs, 81 upgd conss, 1001 impls, 0 clqs presolving (8 rounds): 807 deleted vars, 58 deleted constraints, 46 tightened bounds, 0 added holes, 11 changed sides, 49 changed coefficients 1011 implications, 0 cliques presolved problem has 369 variables (58 bin, 67 int, 26 impl, 218 cont) and 593 constraints 304 constraints of type 257 constraints of type 32 constraints of type Presolving Time: 0.10 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1175 |3030k| 0 | 2.577930e+07 | 2.578003e+07*| 0.00% 1 | 0 | 1187 |2942k| 0 | 2.577953e+07 | 2.578003e+07*| 0.00% 1 | 0 | 1187 |2940k| 0 | 2.577953e+07 | 2.578003e+07*| 0.00% (run 2, node 1) restarting after 73 global fixings of integer variables (restart) converted 6 cuts from the global cut pool into linear constraints presolving: (round 1) 113 del vars, 46 del conss, 8 chg bounds, 10 chg sides, 75 chg coeffs, 0 upgd conss, 1046 impls, 0 clqs (round 2) 115 del vars, 57 del conss, 18 chg bounds, 11 chg sides, 83 chg coeffs, 0 upgd conss, 1046 impls, 0 clqs (round 3) 119 del vars, 60 del conss, 19 chg bounds, 11 chg sides, 83 chg coeffs, 0 upgd conss, 1046 impls, 0 clqs (round 4) 121 del vars, 65 del conss, 19 chg bounds, 13 chg sides, 83 chg coeffs, 0 upgd conss, 1046 impls, 0 clqs (round 5) 121 del vars, 65 del conss, 20 chg bounds, 13 chg sides, 83 chg coeffs, 25 upgd conss, 1046 impls, 0 clqs (round 6) 121 del vars, 65 del conss, 20 chg bounds, 13 chg sides, 84 chg coeffs, 25 upgd conss, 1052 impls, 0 clqs presolving (7 rounds): 121 deleted vars, 65 deleted constraints, 20 tightened bounds, 0 added holes, 13 changed sides, 84 changed coefficients 1052 implications, 0 cliques presolved problem has 248 variables (35 bin, 26 int, 9 impl, 178 cont) and 351 constraints 167 constraints of type 171 constraints of type 13 constraints of type Presolving Time: 0.11 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1350 |2814k| 0 | 2.577957e+07 | 2.578003e+07*| 0.00% 1 | 0 | 1351 |2768k| 0 | 2.577957e+07 | 2.578003e+07*| 0.00% 1 | 0 | 1351 |2768k| 0 | 2.577957e+07 | 2.578003e+07*| 0.00% (run 3, node 1) restarting after 26 global fixings of integer variables (restart) converted 2 cuts from the global cut pool into linear constraints presolving: (round 1) 54 del vars, 39 del conss, 15 chg bounds, 2 chg sides, 9 chg coeffs, 0 upgd conss, 1060 impls, 0 clqs (round 2) 63 del vars, 65 del conss, 31 chg bounds, 5 chg sides, 12 chg coeffs, 0 upgd conss, 1060 impls, 0 clqs (round 3) 63 del vars, 67 del conss, 36 chg bounds, 6 chg sides, 13 chg coeffs, 0 upgd conss, 1060 impls, 0 clqs (round 4) 63 del vars, 70 del conss, 36 chg bounds, 8 chg sides, 13 chg coeffs, 0 upgd conss, 1060 impls, 0 clqs (round 5) 63 del vars, 70 del conss, 37 chg bounds, 8 chg sides, 13 chg coeffs, 8 upgd conss, 1060 impls, 0 clqs presolving (6 rounds): 63 deleted vars, 70 deleted constraints, 37 tightened bounds, 0 added holes, 8 changed sides, 13 changed coefficients 1063 implications, 0 cliques presolved problem has 185 variables (19 bin, 10 int, 4 impl, 152 cont) and 198 constraints 82 constraints of type 109 constraints of type 7 constraints of type Presolving Time: 0.11 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1449 |2683k| 0 | 2.577985e+07 | 2.578003e+07*| 0.00% 1 | 0 | 1449 |2674k| 0 | 2.577985e+07 | 2.578003e+07*| 0.00% 1 | 2 | 1449 |2674k| 0 | 2.577985e+07 | 2.578003e+07*| 0.00% (run 4, node 1) restarting after 14 global fixings of integer variables presolving: (round 1) 22 del vars, 4 del conss, 0 chg bounds, 13 chg sides, 29 chg coeffs, 0 upgd conss, 1063 impls, 0 clqs (round 2) 22 del vars, 6 del conss, 1 chg bounds, 13 chg sides, 29 chg coeffs, 0 upgd conss, 1063 impls, 0 clqs (round 3) 22 del vars, 6 del conss, 1 chg bounds, 13 chg sides, 30 chg coeffs, 5 upgd conss, 1063 impls, 0 clqs (round 4) 22 del vars, 6 del conss, 1 chg bounds, 13 chg sides, 31 chg coeffs, 5 upgd conss, 1063 impls, 0 clqs (round 5) 22 del vars, 6 del conss, 1 chg bounds, 13 chg sides, 32 chg coeffs, 5 upgd conss, 1063 impls, 0 clqs presolving (6 rounds): 22 deleted vars, 6 deleted constraints, 1 tightened bounds, 0 added holes, 13 changed sides, 32 changed coefficients 1063 implications, 0 cliques presolved problem has 163 variables (9 bin, 8 int, 2 impl, 144 cont) and 139 constraints 45 constraints of type 93 constraints of type 1 constraints of type Presolving Time: 0.11 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1536 |2656k| 0 | 2.577985e+07 | 2.578003e+07 | 0.00% 1 | 0 | 1536 |2645k| 0 | 2.577985e+07 | 2.578003e+07 | 0.00% 1 | 2 | 1536 |2646k| 0 | 2.577985e+07 | 2.578003e+07 | 0.00% (run 5, node 1) restarting after 9 global fixings of integer variables presolving: (round 1) 16 del vars, 2 del conss, 0 chg bounds, 1 chg sides, 5 chg coeffs, 0 upgd conss, 1065 impls, 0 clqs (round 2) 16 del vars, 3 del conss, 0 chg bounds, 1 chg sides, 5 chg coeffs, 0 upgd conss, 1065 impls, 0 clqs (round 3) 16 del vars, 4 del conss, 0 chg bounds, 1 chg sides, 5 chg coeffs, 1 upgd conss, 1065 impls, 0 clqs presolving (4 rounds): 16 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 5 changed coefficients 1065 implications, 0 cliques presolved problem has 147 variables (6 bin, 2 int, 1 impl, 138 cont) and 98 constraints 24 constraints of type 72 constraints of type 2 constraints of type Presolving Time: 0.12 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1607 |2638k| 0 | 2.577985e+07 | 2.578003e+07*| 0.00% 1 | 0 | 1607 |2651k| 0 | 2.577985e+07 | 2.578003e+07*| 0.00% 1 | 2 | 1607 |2651k| 0 | 2.577985e+07 | 2.578003e+07*| 0.00% * 2 | 1 | 1608 |2669k| 1 | 2.577985e+07 | 2.577986e+07 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 1.76 Solving Nodes : 3 (total of 8 nodes in 6 runs) Primal Bound : +2.57798563716980e+07 (10 solutions) Dual Bound : +2.57798563716980e+07 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 1.76 Original Problem : Problem name : gamsmodel Variables : 1224 (240 binary, 168 integer, 0 implicit integer, 816 continuous) Constraints : 1392 initial, 1392 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 147 (6 binary, 2 integer, 1 implicit integer, 138 continuous) Constraints : 98 initial, 98 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 949 0 0 0 0 0 0 0 dualfix : 0.00 22 0 0 0 0 0 0 0 boundshift : 0.00 0 0 0 0 0 0 0 0 inttobinary : 0.00 0 0 36 0 0 0 0 0 implics : 0.01 0 0 0 0 0 0 0 0 probing : 0.04 0 0 0 18 0 0 0 0 varbound : 0.00 0 0 0 35 0 55 5 29 linear : 0.05 20 83 0 598 0 176 45 215 logicor : 0.01 3 0 0 0 0 20 0 0 root node : - 681 - - 1600 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 7 0 0 11 0 0 6 varbound : 24 17 774 1 0 0 478 0 0 0 linear : 72 17 774 1 0 1 425 22 0 0 logicor : 2 17 217 1 0 0 21 0 0 0 countsols : 0 0 0 1 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.06 0.00 0.00 0.06 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 linear : 0.00 0.00 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 92 pseudoobj : 0.00 74 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 1 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.00 18 0 573 0 0 impliedbounds : 0.00 17 0 0 22 0 intobj : 0.00 0 0 0 0 0 gomory : 0.07 17 0 0 13 0 strongcg : 0.06 17 0 0 41 0 cmir : 0.85 15 0 0 474 0 flowcover : 0.40 15 0 0 148 0 clique : 0.00 17 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.06 6 0 11 0 0 6 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 simplerounding : 0.00 0 0 rounding : 0.01 18 0 shifting : 0.03 18 8 intshifting : 0.00 1 0 oneopt : 0.00 2 0 fixandinfer : 0.00 0 0 feaspump : 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.06 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.10 19 1608 84.63 16080.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.00 0 0 0.00 - strong branching : 0.06 35 607 17.34 10116.67 (at root node) : - 35 607 17.34 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 6 nodes : 3 nodes (total) : 8 nodes left : 0 max depth : 1 max depth (total): 1 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 : 10 (7 improvements) Primal Bound : +2.57798563716980e+07 (in run 6, after 2 nodes, 1.76 seconds, depth 1, found by ) Dual Bound : +2.57798563716980e+07 Gap : 0.00 % Root Dual Bound : +2.57798452258107e+07 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- gesa2.gms(124) 0 Mb --- Reading solution for model m --- gesa2.gms(124) 3 Mb *** Status: Normal completion --- Job gesa2.gms Stop 10/01/08 17:24:39 elapsed 0:00:01.914