--- Job cap6000 Start 10/01/08 13:32:45 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 --- cap6000.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/cap6000.gdx --- cap6000.gms(148) 5 Mb --- Starting execution: elapsed 0:00:00.092 --- cap6000.gms(123) 5 Mb --- Generating MIP model m --- cap6000.gms(124) 7 Mb --- 2,177 rows 6,001 columns 54,239 non-zeroes --- 6,000 discrete-columns --- cap6000.gms(124) 7 Mb --- Executing SCIP: elapsed 0:00:00.279 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) 76 del vars, 81 del conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 603 impls, 1871 clqs (round 2) 88 del vars, 95 del conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 613 impls, 1866 clqs (round 3) 96 del vars, 95 del conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 2080 upgd conss, 613 impls, 1866 clqs (round 4) 96 del vars, 95 del conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 2081 upgd conss, 613 impls, 1866 clqs (0.3s) probing: 240/5904 (4.1%) - 39 fixings, 0 aggregations, 0 implications, 0 bound changes (0.3s) probing aborted: 100/100 successive totally useless probings (round 5) 135 del vars, 95 del conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 2081 upgd conss, 613 impls, 1866 clqs (round 6) 135 del vars, 222 del conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 2081 upgd conss, 613 impls, 1866 clqs (0.4s) probing: 250/5904 (4.2%) - 39 fixings, 0 aggregations, 0 implications, 0 bound changes (0.4s) probing aborted: 100/100 successive totally useless probings presolving (7 rounds): 135 deleted vars, 222 deleted constraints, 7 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 613 implications, 1866 cliques presolved problem has 5865 variables (5865 bin, 0 int, 0 impl, 0 cont) and 1954 constraints 2 constraints of type 1866 constraints of type 86 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.36 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 192 | 12M| 0 |-2.451537e+06 | -- | Inf r 1 | 0 | 192 | 12M| 0 |-2.451537e+06 |-2.442801e+06 | 0.36% 1 | 0 | 193 | 12M| 0 |-2.451532e+06 |-2.442801e+06 | 0.36% R 1 | 0 | 193 | 12M| 0 |-2.451532e+06 |-2.443726e+06 | 0.32% 1 | 0 | 197 | 12M| 0 |-2.451512e+06 |-2.443726e+06 | 0.32% 1 | 0 | 198 | 12M| 0 |-2.451512e+06 |-2.443726e+06 | 0.32% 1 | 0 | 204 | 12M| 0 |-2.451508e+06 |-2.443726e+06 | 0.32% 1 | 0 | 208 | 12M| 0 |-2.451495e+06 |-2.443726e+06 | 0.32% 1 | 0 | 211 | 12M| 0 |-2.451494e+06 |-2.443726e+06 | 0.32% k 1 | 0 | 211 | 13M| 0 |-2.451494e+06 |-2.450764e+06 | 0.03% (run 1, node 1) restarting after 1822 global fixings of integer variables (restart) converted 9 cuts from the global cut pool into linear constraints presolving: (round 1) 1824 del vars, 17 del conss, 0 chg bounds, 6 chg sides, 0 chg coeffs, 0 upgd conss, 863 impls, 1123 clqs (round 2) 1824 del vars, 17 del conss, 0 chg bounds, 6 chg sides, 0 chg coeffs, 7 upgd conss, 863 impls, 1123 clqs presolving (3 rounds): 1824 deleted vars, 17 deleted constraints, 0 tightened bounds, 0 added holes, 6 changed sides, 0 changed coefficients 863 implications, 1123 cliques presolved problem has 4041 variables (4041 bin, 0 int, 0 impl, 0 cont) and 1329 constraints 8 constraints of type 1248 constraints of type 2 constraints of type 71 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.47 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 404 | 12M| 0 |-2.451494e+06 |-2.450764e+06 | 0.03% 1 | 0 | 408 | 12M| 0 |-2.451493e+06 |-2.450764e+06 | 0.03% 1 | 2 | 408 | 12M| 0 |-2.451493e+06 |-2.450764e+06 | 0.03% (run 2, node 1) restarting after 3358 global fixings of integer variables (restart) converted 1 cuts from the global cut pool into linear constraints presolving: (round 1) 3376 del vars, 86 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 1049 impls, 14 clqs (round 2) 3376 del vars, 86 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 1 upgd conss, 1049 impls, 14 clqs (round 3) 3377 del vars, 86 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 1 upgd conss, 1049 impls, 14 clqs presolving (4 rounds): 3377 deleted vars, 86 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients 1049 implications, 14 cliques presolved problem has 664 variables (664 bin, 0 int, 0 impl, 0 cont) and 121 constraints 9 constraints of type 108 constraints of type 2 constraints of type 2 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.61 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 469 | 10M| 0 |-2.451493e+06 |-2.450764e+06 | 0.03% 1 | 0 | 473 | 10M| 0 |-2.451492e+06 |-2.450764e+06 | 0.03% 1 | 2 | 473 | 10M| 0 |-2.451492e+06 |-2.450764e+06 | 0.03% c 6 | 7 | 579 | 14M| 5 |-2.451468e+06 |-2.450777e+06 | 0.03% c 6 | 7 | 584 | 15M| 5 |-2.451468e+06 |-2.450848e+06 | 0.03% c 6 | 7 | 608 | 16M| 5 |-2.451468e+06 |-2.450860e+06 | 0.02% c 6 | 6 | 620 | 16M| 5 |-2.451468e+06 |-2.450986e+06 | 0.02% p 10 | 10 | 711 | 17M| 5 |-2.451452e+06 |-2.450995e+06 | 0.02% p 10 | 10 | 816 | 17M| 5 |-2.451452e+06 |-2.451156e+06 | 0.01% k 10 | 10 | 835 | 17M| 5 |-2.451452e+06 |-2.451241e+06 | 0.01% r 24 | 22 | 915 | 17M| 7 |-2.451431e+06 |-2.451248e+06 | 0.01% k 24 | 24 | 916 | 17M| 7 |-2.451431e+06 |-2.451289e+06 | 0.01% 100 | 100 | 1977 | 17M| 17 |-2.451428e+06 |-2.451289e+06 | 0.01% 200 | 198 | 2743 | 17M| 33 |-2.451428e+06 |-2.451289e+06 | 0.01% C 224 | 202 | 2828 | 17M| 33 |-2.451428e+06 |-2.451317e+06 | 0.00% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap p 270 | 160 | 3179 | 17M| 33 |-2.451425e+06 |-2.451355e+06 | 0.00% 300 | 178 | 3388 | 17M| 33 |-2.451425e+06 |-2.451355e+06 | 0.00% 400 | 235 | 3991 | 17M| 33 |-2.451425e+06 |-2.451355e+06 | 0.00% R 454 | 241 | 4317 | 17M| 33 |-2.451424e+06 |-2.451361e+06 | 0.00% 500 | 266 | 4511 | 17M| 33 |-2.451424e+06 |-2.451361e+06 | 0.00% 600 | 294 | 5045 | 17M| 36 |-2.451423e+06 |-2.451361e+06 | 0.00% * 650 | 294 | 5273 | 17M| 36 |-2.451423e+06 |-2.451365e+06 | 0.00% 700 | 317 | 5493 | 17M| 36 |-2.451423e+06 |-2.451365e+06 | 0.00% 800 | 363 | 5945 | 17M| 36 |-2.451421e+06 |-2.451365e+06 | 0.00% R 885 | 378 | 6378 | 17M| 36 |-2.451418e+06 |-2.451371e+06 | 0.00% 900 | 387 | 6441 | 17M| 36 |-2.451418e+06 |-2.451371e+06 | 0.00% 1000 | 413 | 6896 | 17M| 36 |-2.451417e+06 |-2.451371e+06 | 0.00% r 1018 | 399 | 6955 | 17M| 36 |-2.451417e+06 |-2.451373e+06 | 0.00% 1100 | 401 | 7363 | 17M| 36 |-2.451415e+06 |-2.451373e+06 | 0.00% r 1166 | 391 | 7614 | 17M| 36 |-2.451415e+06 |-2.451377e+06 | 0.00% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1200 | 404 | 7728 | 17M| 36 |-2.451415e+06 |-2.451377e+06 | 0.00% 1300 | 429 | 8035 | 17M| 36 |-2.451415e+06 |-2.451377e+06 | 0.00% 1400 | 435 | 8391 | 17M| 36 |-2.451414e+06 |-2.451377e+06 | 0.00% 1500 | 427 | 8840 | 17M| 36 |-2.451413e+06 |-2.451377e+06 | 0.00% 1600 | 410 | 9187 | 17M| 36 |-2.451412e+06 |-2.451377e+06 | 0.00% 1700 | 405 | 9705 | 17M| 36 |-2.451411e+06 |-2.451377e+06 | 0.00% 1800 | 381 | 10085 | 17M| 36 |-2.451411e+06 |-2.451377e+06 | 0.00% 1900 | 374 | 10417 | 17M| 36 |-2.451410e+06 |-2.451377e+06 | 0.00% 2000 | 347 | 10870 | 17M| 36 |-2.451409e+06 |-2.451377e+06 | 0.00% 2100 | 328 | 11225 | 17M| 36 |-2.451409e+06 |-2.451377e+06 | 0.00% 2200 | 316 | 11642 | 17M| 36 |-2.451405e+06 |-2.451377e+06 | 0.00% 2300 | 284 | 11997 | 17M| 36 |-2.451404e+06 |-2.451377e+06 | 0.00% 2400 | 236 | 12405 | 17M| 36 |-2.451403e+06 |-2.451377e+06 | 0.00% 2500 | 201 | 12838 | 17M| 36 |-2.451401e+06 |-2.451377e+06 | 0.00% 2600 | 151 | 13271 | 17M| 36 |-2.451400e+06 |-2.451377e+06 | 0.00% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 2700 | 99 | 13710 | 17M| 36 |-2.451397e+06 |-2.451377e+06 | 0.00% 2800 | 10 | 14174 | 17M| 36 |-2.451391e+06 |-2.451377e+06 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 8.07 Solving Nodes : 2810 (total of 2812 nodes in 3 runs) Primal Bound : -2.45137700000000e+06 (482 solutions) Dual Bound : -2.45137700000000e+06 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 8.07 Original Problem : Problem name : gamsmodel Variables : 6000 (6000 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 2176 initial, 2176 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 664 (664 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 121 initial, 408 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.02 5187 0 0 0 0 0 0 0 dualfix : 0.00 14 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 0 0 0 0 0 0 0 probing : 0.12 39 0 0 0 0 0 0 0 knapsack : 0.27 0 0 0 0 0 0 0 0 setppc : 0.05 0 20 0 0 0 20 0 0 linear : 0.08 0 76 0 7 0 95 7 0 logicor : 0.02 0 0 0 0 0 210 0 0 root node : - 5725 - - 5725 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 1826 0 39 311 0 0 3068 knapsack : 9 8 10718 1 0 66 392 9 0 0 setppc : 108 8 8471 0 0 23 2111 0 0 0 linear : 2 2 49 0 0 0 0 2 0 0 logicor : 2+ 8 2224 1 0 34 69 0 0 0 countsols : 0 0 0 1 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.67 0.00 0.00 0.67 0.00 knapsack : 0.13 0.05 0.08 0.00 0.00 setppc : 0.05 0.00 0.05 0.00 0.00 linear : 0.00 0.00 0.00 0.00 0.00 logicor : 0.05 0.00 0.05 0.00 0.00 countsols : 0.00 0.00 0.00 0.00 0.00 Propagators : Time Calls Cutoffs DomReds rootredcost : 0.00 16 0 126 pseudoobj : 0.34 10608 306 3920 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.13 429 177 991 94.2 0 0.0 - infeasible LP : 0.00 7 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 52 52 179 55.9 0 0.0 - applied globally : - - - 391 57.8 - - - applied locally : - - - 114 95.3 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 0 - - 0 - (maximal pool size: 20) redcost : 0.08 3019 0 17299 0 0 impliedbounds : 0.00 8 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 8 0 0 0 0 strongcg : 0.01 8 0 0 0 0 cmir : 0.05 8 0 0 0 0 flowcover : 0.90 8 0 0 55 0 clique : 0.07 8 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.67 1825 39 311 0 0 3068 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 feaspump : 0.00 0 0 oneopt : 0.03 11 3 coefdiving : 0.20 27 113 pscostdiving : 0.25 27 115 linesearchdiving : 0.10 27 9 fracdiving : 0.11 27 21 guideddiving : 0.11 27 15 veclendiving : 0.11 27 7 rootsoldiving : 0.34 14 5 objpscostdiving : 0.19 14 13 simplerounding : 0.04 1930 161 rounding : 0.11 1930 3 shifting : 0.44 206 14 intshifting : 0.00 0 0 fixandinfer : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.07 1 0 rins : 0.00 0 0 localbranching : 0.00 0 0 mutation : 0.00 0 0 crossover : 0.21 2 2 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 : 2.54 2857 9759 3.42 3842.13 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 1.08 1370 4515 3.30 4180.56 strong branching : 0.65 777 4381 5.64 6740.00 (at root node) : - 20 214 10.70 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 3 nodes : 2810 nodes (total) : 2812 nodes left : 0 max depth : 36 max depth (total): 36 backtracks : 913 (32.5%) delayed cutoffs : 42 repropagations : 887 (417 domain reductions, 37 cutoffs) avg switch length: 8.52 switching time : 0.08 Solution : Solutions found : 482 (19 improvements) Primal Bound : -2.45137700000000e+06 (in run 3, after 1166 nodes, 6.15 seconds, depth 10, found by ) Dual Bound : -2.45137700000000e+06 Gap : 0.00 % Root Dual Bound : -2.45149223077095e+06 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- cap6000.gms(124) 0 Mb --- Reading solution for model m --- cap6000.gms(124) 4 Mb *** Status: Normal completion --- Job cap6000.gms Stop 10/01/08 13:32:54 elapsed 0:00:08.749