--- Job fixnet6 Start 10/01/08 17:24:31 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 --- fixnet6.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/fixnet6.gdx --- fixnet6.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.023 --- fixnet6.gms(123) 4 Mb --- Generating MIP model m --- fixnet6.gms(124) 4 Mb --- 479 rows 879 columns 2,551 non-zeroes --- 378 discrete-columns --- fixnet6.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.043 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) 1 del vars, 1 del conss, 791 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 1 del vars, 1 del conss, 791 chg bounds, 0 chg sides, 308 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 3) 1 del vars, 1 del conss, 791 chg bounds, 0 chg sides, 308 chg coeffs, 378 upgd conss, 0 impls, 0 clqs (0.1s) probing: 101/378 (26.7%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes (0.1s) probing aborted: 100/100 successive totally useless probings presolving (4 rounds): 1 deleted vars, 1 deleted constraints, 791 tightened bounds, 0 added holes, 0 changed sides, 308 changed coefficients 380 implications, 0 cliques presolved problem has 877 variables (378 bin, 0 int, 0 impl, 499 cont) and 477 constraints 378 constraints of type 99 constraints of type Presolving Time: 0.05 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 304 |1886k| 0 | 3.192042e+03 | -- | Inf r 1 | 0 | 304 |1901k| 0 | 3.192042e+03 | 4.536000e+03 | 42.10% 1 | 0 | 378 |2179k| 0 | 3.364386e+03 | 4.536000e+03 | 34.82% 1 | 0 | 465 |2281k| 0 | 3.508078e+03 | 4.536000e+03 | 29.30% 1 | 0 | 572 |2374k| 0 | 3.582021e+03 | 4.536000e+03 | 26.63% 1 | 0 | 680 |2485k| 0 | 3.646048e+03 | 4.536000e+03 | 24.41% 1 | 0 | 775 |2624k| 0 | 3.677394e+03 | 4.536000e+03 | 23.35% 1 | 0 | 898 |2788k| 0 | 3.704559e+03 | 4.536000e+03 | 22.44% 1 | 0 | 1020 |2938k| 0 | 3.720882e+03 | 4.536000e+03 | 21.91% 1 | 0 | 1146 |3135k| 0 | 3.740687e+03 | 4.536000e+03 | 21.26% 1 | 0 | 1268 |3302k| 0 | 3.753094e+03 | 4.536000e+03 | 20.86% 1 | 0 | 1400 |3505k| 0 | 3.776018e+03 | 4.536000e+03 | 20.13% 1 | 0 | 1521 |3526k| 0 | 3.806277e+03 | 4.536000e+03 | 19.17% 1 | 0 | 1556 |3541k| 0 | 3.809050e+03 | 4.536000e+03 | 19.08% 1 | 0 | 1598 |3559k| 0 | 3.810729e+03 | 4.536000e+03 | 19.03% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1636 |3572k| 0 | 3.811644e+03 | 4.536000e+03 | 19.00% 1 | 0 | 1645 |3584k| 0 | 3.811736e+03 | 4.536000e+03 | 19.00% 1 | 0 | 1654 |3598k| 0 | 3.812041e+03 | 4.536000e+03 | 18.99% E 1 | 0 | 2013 |3625k| 0 | 3.812041e+03 | 3.985000e+03 | 4.54% 1 | 0 | 2013 |3625k| 0 | 3.812041e+03 | 3.985000e+03 | 4.54% 1 | 0 | 2013 |3547k| 0 | 3.812041e+03 | 3.985000e+03 | 4.54% 1 | 0 | 2013 |3547k| 0 | 3.812041e+03 | 3.985000e+03 | 4.54% (run 1, node 1) restarting after 155 global fixings of integer variables (restart) converted 251 cuts from the global cut pool into linear constraints presolving: (round 1) 326 del vars, 16 del conss, 1 chg bounds, 0 chg sides, 65 chg coeffs, 0 upgd conss, 395 impls, 0 clqs (round 2) 326 del vars, 18 del conss, 1 chg bounds, 1 chg sides, 65 chg coeffs, 0 upgd conss, 395 impls, 0 clqs presolving (3 rounds): 326 deleted vars, 18 deleted constraints, 1 tightened bounds, 0 added holes, 1 changed sides, 65 changed coefficients 395 implications, 0 cliques presolved problem has 551 variables (223 bin, 0 int, 0 impl, 328 cont) and 555 constraints 223 constraints of type 332 constraints of type Presolving Time: 0.06 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 2568 |2976k| 0 | 3.822299e+03 | 3.985000e+03 | 4.26% 1 | 0 | 2730 |3077k| 0 | 3.835144e+03 | 3.985000e+03 | 3.91% 1 | 2 | 2730 |3089k| 0 | 3.835144e+03 | 3.985000e+03 | 3.91% (run 2, node 1) restarting after 32 global fixings of integer variables (restart) converted 9 cuts from the global cut pool into linear constraints presolving: (round 1) 69 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 17 chg coeffs, 0 upgd conss, 398 impls, 0 clqs (round 2) 69 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 17 chg coeffs, 0 upgd conss, 398 impls, 0 clqs presolving (3 rounds): 69 deleted vars, 10 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 17 changed coefficients 398 implications, 0 cliques presolved problem has 482 variables (191 bin, 0 int, 0 impl, 291 cont) and 522 constraints 191 constraints of type 331 constraints of type Presolving Time: 0.07 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 3236 |2933k| 0 | 3.835144e+03 | 3.985000e+03 | 3.91% 1 | 0 | 3352 |3043k| 0 | 3.841343e+03 | 3.985000e+03 | 3.74% 1 | 0 | 3448 |3054k| 0 | 3.850447e+03 | 3.985000e+03 | 3.49% 1 | 0 | 3485 |3060k| 0 | 3.852538e+03 | 3.985000e+03 | 3.44% 1 | 0 | 3491 |3070k| 0 | 3.852611e+03 | 3.985000e+03 | 3.44% 1 | 2 | 3491 |3082k| 0 | 3.852611e+03 | 3.985000e+03 | 3.44% (run 3, node 1) restarting after 24 global fixings of integer variables (restart) converted 5 cuts from the global cut pool into linear constraints presolving: (round 1) 51 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 40 chg coeffs, 0 upgd conss, 404 impls, 0 clqs (round 2) 51 del vars, 14 del conss, 0 chg bounds, 5 chg sides, 40 chg coeffs, 0 upgd conss, 404 impls, 0 clqs presolving (3 rounds): 51 deleted vars, 14 deleted constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 40 changed coefficients 404 implications, 0 cliques presolved problem has 431 variables (166 bin, 0 int, 0 impl, 265 cont) and 479 constraints 166 constraints of type 313 constraints of type Presolving Time: 0.08 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 3901 |2896k| 0 | 3.852641e+03 | 3.985000e+03 | 3.44% 1 | 0 | 3984 |2971k| 0 | 3.859284e+03 | 3.985000e+03 | 3.26% 1 | 0 | 4118 |2980k| 0 | 3.868838e+03 | 3.985000e+03 | 3.00% 1 | 0 | 4134 |2991k| 0 | 3.869897e+03 | 3.985000e+03 | 2.97% 1 | 2 | 4134 |3002k| 0 | 3.869897e+03 | 3.985000e+03 | 2.97% (run 4, node 1) restarting after 15 global fixings of integer variables (restart) converted 8 cuts from the global cut pool into linear constraints presolving: (round 1) 33 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 0 upgd conss, 405 impls, 0 clqs (round 2) 33 del vars, 8 del conss, 0 chg bounds, 3 chg sides, 3 chg coeffs, 0 upgd conss, 405 impls, 0 clqs presolving (3 rounds): 33 deleted vars, 8 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 3 changed coefficients 405 implications, 0 cliques presolved problem has 398 variables (151 bin, 0 int, 0 impl, 247 cont) and 462 constraints 151 constraints of type 311 constraints of type Presolving Time: 0.09 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 4528 |2904k| 0 | 3.869897e+03 | 3.985000e+03 | 2.97% 1 | 0 | 4623 |2984k| 0 | 3.886086e+03 | 3.985000e+03 | 2.55% 1 | 2 | 4623 |2996k| 0 | 3.886086e+03 | 3.985000e+03 | 2.55% * 6 | 3 | 4789 |3088k| 4 | 3.972456e+03 | 3.983000e+03 | 0.27% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 5.55 Solving Nodes : 13 (total of 17 nodes in 5 runs) Primal Bound : +3.98300000000000e+03 (39 solutions) Dual Bound : +3.98300000000000e+03 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 5.55 Original Problem : Problem name : gamsmodel Variables : 878 (378 binary, 0 integer, 0 implicit integer, 500 continuous) Constraints : 478 initial, 478 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 398 (151 binary, 0 integer, 0 implicit integer, 247 continuous) Constraints : 462 initial, 462 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 449 0 0 0 0 0 0 0 dualfix : 0.00 1 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.02 0 0 0 0 0 0 0 0 varbound : 0.00 0 0 0 1 0 1 0 12 linear : 0.05 1 29 0 791 0 50 9 421 root node : - 323 - - 702 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 18 0 1 15 0 0 18 varbound : 151 22 281 1 0 0 412 0 0 0 linear : 311 22 281 1 0 0 125 4 0 0 countsols : 0 0 0 1 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 2.16 0.00 0.00 2.16 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 linear : 0.03 0.02 0.01 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 22 pseudoobj : 0.00 116 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: 63) redcost : 0.00 37 0 370 0 0 impliedbounds : 0.00 22 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.12 22 0 0 17 0 strongcg : 0.10 22 0 0 0 0 cmir : 1.21 14 0 0 988 0 flowcover : 0.39 14 0 0 405 0 clique : 0.00 5 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 : 2.16 17 1 15 0 0 18 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 rootsoldiving : 0.00 0 0 oneopt : 0.00 2 0 simplerounding : 0.00 38 37 rounding : 0.00 38 0 shifting : 0.01 31 0 intshifting : 0.06 1 0 fixandinfer : 0.00 0 0 feaspump : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 linesearchdiving : 0.00 0 0 guideddiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.64 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.03 0 0 0.00 0.00 dual LP : 0.66 43 4531 105.37 6865.15 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.06 1 359 359.00 5983.33 strong branching : 2.16 171 15421 90.18 7139.35 (at root node) : - 140 14475 103.39 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 5 nodes : 13 nodes (total) : 17 nodes left : 0 max depth : 5 max depth (total): 5 backtracks : 3 (23.1%) delayed cutoffs : 0 repropagations : 3 (20 domain reductions, 0 cutoffs) avg switch length: 2.31 switching time : 0.00 Solution : Solutions found : 39 (3 improvements) Primal Bound : +3.98300000000000e+03 (in run 5, after 6 nodes, 5.52 seconds, depth 4, found by ) Dual Bound : +3.98300000000000e+03 Gap : 0.00 % Root Dual Bound : +3.88608558837200e+03 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- fixnet6.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job fixnet6.gms Stop 10/01/08 17:24:36 elapsed 0:00:05.714