--- Job p0548 Start 10/03/08 03:55:55 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 --- p0548.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p0548.gdx --- p0548.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.007 --- p0548.gms(123) 4 Mb --- Generating MIP model m --- p0548.gms(124) 4 Mb --- 177 rows 549 columns 2,128 non-zeroes --- 548 discrete-columns --- p0548.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.016 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) 22 del vars, 26 del conss, 16 chg bounds, 65 chg sides, 152 chg coeffs, 0 upgd conss, 80 impls, 22 clqs (round 2) 77 del vars, 35 del conss, 18 chg bounds, 71 chg sides, 166 chg coeffs, 0 upgd conss, 80 impls, 22 clqs (round 3) 96 del vars, 35 del conss, 18 chg bounds, 73 chg sides, 172 chg coeffs, 0 upgd conss, 80 impls, 22 clqs (round 4) 96 del vars, 35 del conss, 18 chg bounds, 73 chg sides, 172 chg coeffs, 101 upgd conss, 80 impls, 22 clqs (round 5) 98 del vars, 35 del conss, 20 chg bounds, 118 chg sides, 264 chg coeffs, 101 upgd conss, 178 impls, 24 clqs (round 6) 112 del vars, 44 del conss, 20 chg bounds, 122 chg sides, 275 chg coeffs, 101 upgd conss, 178 impls, 24 clqs (round 7) 113 del vars, 46 del conss, 20 chg bounds, 126 chg sides, 283 chg coeffs, 101 upgd conss, 178 impls, 24 clqs (round 8) 113 del vars, 46 del conss, 20 chg bounds, 126 chg sides, 283 chg coeffs, 138 upgd conss, 178 impls, 24 clqs (round 9) 113 del vars, 50 del conss, 20 chg bounds, 269 chg sides, 571 chg coeffs, 139 upgd conss, 442 impls, 35 clqs (round 10) 113 del vars, 58 del conss, 20 chg bounds, 274 chg sides, 592 chg coeffs, 139 upgd conss, 448 impls, 35 clqs (0.0s) probing: 186/435 (42.8%) - 2 fixings, 0 aggregations, 1 implications, 0 bound changes (0.0s) probing aborted: 100/100 successive totally useless probings (round 11) 115 del vars, 58 del conss, 20 chg bounds, 274 chg sides, 592 chg coeffs, 139 upgd conss, 450 impls, 35 clqs (round 12) 115 del vars, 65 del conss, 20 chg bounds, 274 chg sides, 592 chg coeffs, 139 upgd conss, 450 impls, 35 clqs (round 13) 128 del vars, 71 del conss, 20 chg bounds, 274 chg sides, 592 chg coeffs, 139 upgd conss, 450 impls, 35 clqs (0.0s) probing: 196/435 (45.1%) - 2 fixings, 0 aggregations, 1 implications, 0 bound changes (0.0s) probing aborted: 100/100 successive totally useless probings presolving (14 rounds): 128 deleted vars, 71 deleted constraints, 20 tightened bounds, 0 added holes, 274 changed sides, 592 changed coefficients 450 implications, 35 cliques presolved problem has 420 variables (420 bin, 0 int, 0 impl, 0 cont) and 276 constraints 68 constraints of type 175 constraints of type 33 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.03 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 216 |1476k| 0 | 7.740672e+03 | -- | Inf 1 | 0 | 465 |1558k| 0 | 8.187407e+03 | -- | Inf 1 | 0 | 494 |1613k| 0 | 8.312728e+03 | -- | Inf 1 | 0 | 515 |1659k| 0 | 8.396140e+03 | -- | Inf s 1 | 0 | 515 |1667k| 0 | 8.396140e+03 | 4.839500e+04 | 476.40% 1 | 0 | 538 |1716k| 0 | 8.442160e+03 | 4.839500e+04 | 473.25% 1 | 0 | 581 |1748k| 0 | 8.602605e+03 | 4.839500e+04 | 462.56% 1 | 0 | 600 |1770k| 0 | 8.665486e+03 | 4.839500e+04 | 458.48% 1 | 0 | 611 |1780k| 0 | 8.672668e+03 | 4.839500e+04 | 458.02% 1 | 0 | 614 |1782k| 0 | 8.673375e+03 | 4.839500e+04 | 457.97% 1 | 0 | 616 |1782k| 0 | 8.673487e+03 | 4.839500e+04 | 457.96% 1 | 0 | 619 |1784k| 0 | 8.673642e+03 | 4.839500e+04 | 457.95% 1 | 0 | 633 |1784k| 0 | 8.679011e+03 | 4.839500e+04 | 457.61% 1 | 0 | 642 |1785k| 0 | 8.680306e+03 | 4.839500e+04 | 457.53% s 1 | 0 | 642 |1793k| 0 | 8.680306e+03 | 3.764600e+04 | 333.69% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 648 |1793k| 0 | 8.681561e+03 | 3.764600e+04 | 333.63% k 1 | 0 | 648 |1809k| 0 | 8.681561e+03 | 3.636700e+04 | 318.90% E 1 | 0 | 648 |1809k| 0 | 8.681561e+03 | 8.761000e+03 | 0.92% 1 | 0 | 648 |1809k| 0 | 8.681561e+03 | 8.761000e+03 | 0.92% 1 | 0 | 648 |1756k| 0 | 8.681561e+03 | 8.761000e+03 | 0.92% 1 | 0 | 648 |1756k| 0 | 8.681561e+03 | 8.761000e+03 | 0.92% (run 1, node 1) restarting after 145 global fixings of integer variables (restart) converted 108 cuts from the global cut pool into linear constraints presolving: (round 1) 150 del vars, 48 del conss, 0 chg bounds, 123 chg sides, 166 chg coeffs, 0 upgd conss, 520 impls, 16 clqs (round 2) 159 del vars, 67 del conss, 0 chg bounds, 127 chg sides, 170 chg coeffs, 0 upgd conss, 520 impls, 16 clqs (round 3) 161 del vars, 77 del conss, 0 chg bounds, 134 chg sides, 170 chg coeffs, 0 upgd conss, 520 impls, 16 clqs (round 4) 162 del vars, 78 del conss, 0 chg bounds, 134 chg sides, 170 chg coeffs, 89 upgd conss, 520 impls, 16 clqs (round 5) 162 del vars, 107 del conss, 0 chg bounds, 146 chg sides, 197 chg coeffs, 89 upgd conss, 524 impls, 16 clqs (round 6) 162 del vars, 108 del conss, 0 chg bounds, 155 chg sides, 207 chg coeffs, 89 upgd conss, 524 impls, 16 clqs (round 7) 162 del vars, 108 del conss, 0 chg bounds, 158 chg sides, 217 chg coeffs, 89 upgd conss, 524 impls, 16 clqs (round 8) 162 del vars, 108 del conss, 0 chg bounds, 159 chg sides, 220 chg coeffs, 89 upgd conss, 524 impls, 16 clqs presolving (9 rounds): 162 deleted vars, 108 deleted constraints, 0 tightened bounds, 0 added holes, 159 changed sides, 220 changed coefficients 524 implications, 16 cliques presolved problem has 258 variables (258 bin, 0 int, 0 impl, 0 cont) and 254 constraints 75 constraints of type 97 constraints of type 4 constraints of type 78 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.04 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 842 |1466k| 0 | 8.681878e+03 | 8.761000e+03 | 0.91% 1 | 0 | 844 |1469k| 0 | 8.683090e+03 | 8.761000e+03 | 0.90% 1 | 0 | 845 |1469k| 0 | 8.683365e+03 | 8.761000e+03 | 0.89% 1 | 0 | 847 |1469k| 0 | 8.684561e+03 | 8.761000e+03 | 0.88% 1 | 0 | 848 |1459k| 0 | 8.685055e+03 | 8.761000e+03 | 0.87% 1 | 2 | 848 |1459k| 0 | 8.685055e+03 | 8.761000e+03 | 0.87% (run 2, node 1) restarting after 15 global fixings of integer variables (restart) converted 1 cuts from the global cut pool into linear constraints presolving: (round 1) 17 del vars, 20 del conss, 1 chg bounds, 5 chg sides, 7 chg coeffs, 0 upgd conss, 534 impls, 15 clqs (round 2) 25 del vars, 25 del conss, 1 chg bounds, 5 chg sides, 7 chg coeffs, 1 upgd conss, 534 impls, 15 clqs (round 3) 25 del vars, 27 del conss, 1 chg bounds, 5 chg sides, 7 chg coeffs, 1 upgd conss, 534 impls, 15 clqs presolving (4 rounds): 25 deleted vars, 27 deleted constraints, 1 tightened bounds, 0 added holes, 5 changed sides, 7 changed coefficients 534 implications, 15 cliques presolved problem has 233 variables (233 bin, 0 int, 0 impl, 0 cont) and 194 constraints 62 constraints of type 60 constraints of type 72 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.04 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1029 |1413k| 0 | 8.685055e+03 | 8.761000e+03 | 0.87% 1 | 0 | 1029 |1407k| 0 | 8.685055e+03 | 8.761000e+03 | 0.87% 1 | 2 | 1029 |1407k| 0 | 8.685055e+03 | 8.761000e+03 | 0.87% c 11 | 12 | 1070 |1433k| 9 | 8.685841e+03 | 8.760000e+03 | 0.85% p 12 | 11 | 1097 |1456k| 9 | 8.685841e+03 | 8.743000e+03 | 0.66% r 15 | 3 | 1108 |1455k| 9 | 8.685841e+03 | 8.698000e+03 | 0.14% r 17 | 1 | 1115 |1453k| 9 | 8.685841e+03 | 8.691000e+03 | 0.06% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.44 Solving Nodes : 18 (total of 20 nodes in 3 runs) Primal Bound : +8.69100000000000e+03 (11 solutions) Dual Bound : +8.69100000000000e+03 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.44 Original Problem : Problem name : gamsmodel Variables : 548 (548 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 176 initial, 176 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 233 (233 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 194 initial, 194 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 160 0 0 0 0 0 0 0 dualfix : 0.00 127 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 1 0 0 0 0 0 0 probing : 0.01 2 0 0 0 0 0 0 0 knapsack : 0.00 0 0 0 3 0 58 354 639 setppc : 0.02 0 0 0 0 0 84 0 0 linear : 0.00 21 4 0 18 0 56 84 180 logicor : 0.00 0 0 0 0 0 8 0 0 root node : - 308 - - 308 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 25 0 0 18 0 0 30 knapsack : 62 17 524 0 0 0 66 101 0 0 setppc : 60 17 524 0 0 0 80 0 0 0 logicor : 72 17 175 0 0 0 28 0 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.08 0.00 0.00 0.08 0.00 knapsack : 0.01 0.01 0.00 0.00 0.00 setppc : 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.01 4 0 81 pseudoobj : 0.00 157 1 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 1 1 4 19.8 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 : - - - 1 18.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 47 0 314 0 0 impliedbounds : 0.00 17 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 17 0 0 233 0 strongcg : 0.01 17 0 0 63 0 cmir : 0.04 12 0 0 116 0 flowcover : 0.07 12 0 0 241 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.08 25 0 18 0 0 30 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 - 0 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 linesearchdiving : 0.00 0 0 guideddiving : 0.00 0 0 simplerounding : 0.00 17 2 rounding : 0.01 42 0 shifting : 0.05 20 2 intshifting : 0.00 0 0 oneopt : 0.00 5 1 fixandinfer : 0.00 0 0 feaspump : 0.02 1 0 coefdiving : 0.00 1 2 pscostdiving : 0.01 1 3 intdiving : 0.00 0 0 actconsdiving : 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.00 0 0 0.00 - dual LP : 0.05 45 873 19.40 17460.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.02 41 247 6.02 12350.00 strong branching : 0.08 135 1004 7.44 12550.00 (at root node) : - 59 537 9.10 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 3 nodes : 18 nodes (total) : 20 nodes left : 0 max depth : 9 max depth (total): 9 backtracks : 5 (27.8%) delayed cutoffs : 0 repropagations : 17 (45 domain reductions, 0 cutoffs) avg switch length: 3.44 switching time : 0.00 Solution : Solutions found : 11 (8 improvements) Primal Bound : +8.69100000000000e+03 (in run 3, after 17 nodes, 0.44 seconds, depth 4, found by ) Dual Bound : +8.69100000000000e+03 Gap : 0.00 % Root Dual Bound : +8.68505467753468e+03 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- p0548.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p0548.gms Stop 10/03/08 03:55:55 elapsed 0:00:00.514