--- Job misc06 Start 10/01/08 21:16:38 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 --- misc06.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/misc06.gdx --- misc06.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.028 --- misc06.gms(123) 4 Mb --- Generating MIP model m --- misc06.gms(124) 4 Mb --- 821 rows 1,809 columns 5,861 non-zeroes --- 112 discrete-columns --- misc06.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.064 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) 204 del vars, 164 del conss, 794 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 520 del vars, 296 del conss, 1164 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 3) 548 del vars, 296 del conss, 1289 chg bounds, 112 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 4) 548 del vars, 303 del conss, 1337 chg bounds, 112 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 5) 548 del vars, 303 del conss, 1551 chg bounds, 112 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 6) 548 del vars, 303 del conss, 1605 chg bounds, 112 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs presolving (7 rounds): 548 deleted vars, 303 deleted constraints, 1605 tightened bounds, 0 added holes, 112 changed sides, 0 changed coefficients 617 implications, 0 cliques presolved problem has 1260 variables (112 bin, 0 int, 0 impl, 1148 cont) and 517 constraints 517 constraints of type Presolving Time: 0.04 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 698 |3459k| 0 | 1.284169e+04 | -- | Inf r 1 | 0 | 698 |3484k| 0 | 1.284169e+04 | 1.289663e+04 | 0.43% 1 | 0 | 708 |3573k| 0 | 1.284263e+04 | 1.289663e+04 | 0.42% 1 | 0 | 710 |3598k| 0 | 1.284355e+04 | 1.289663e+04 | 0.41% i 1 | 0 | 747 |3647k| 0 | 1.284355e+04 | 1.286888e+04 | 0.20% k 1 | 0 | 783 |3694k| 0 | 1.284355e+04 | 1.286564e+04 | 0.17% E 1 | 0 | 783 |3694k| 0 | 1.284355e+04 | 1.285410e+04 | 0.08% 1 | 0 | 783 |3694k| 0 | 1.284355e+04 | 1.285410e+04 | 0.08% 1 | 0 | 783 |3608k| 0 | 1.284355e+04 | 1.285410e+04 | 0.08% 1 | 0 | 783 |3607k| 0 | 1.284355e+04 | 1.285410e+04 | 0.08% (run 1, node 1) restarting after 35 global fixings of integer variables (restart) converted 6 cuts from the global cut pool into linear constraints presolving: (round 1) 217 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 617 impls, 0 clqs (round 2) 217 del vars, 7 del conss, 76 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 617 impls, 0 clqs presolving (3 rounds): 217 deleted vars, 7 deleted constraints, 81 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 617 implications, 0 cliques presolved problem has 1043 variables (77 bin, 0 int, 0 impl, 966 cont) and 390 constraints 390 constraints of type Presolving Time: 0.05 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1295 |3512k| 0 | 1.284355e+04 | 1.285410e+04*| 0.08% 1 | 0 | 1301 |3531k| 0 | 1.284402e+04 | 1.285410e+04*| 0.08% 1 | 2 | 1301 |3555k| 0 | 1.284402e+04 | 1.285410e+04*| 0.08% (run 2, node 1) restarting after 7 global fixings of integer variables (restart) converted 4 cuts from the global cut pool into linear constraints presolving: (round 1) 28 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 617 impls, 0 clqs presolving (2 rounds): 28 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 617 implications, 0 cliques presolved problem has 1015 variables (70 bin, 0 int, 0 impl, 945 cont) and 387 constraints 387 constraints of type Presolving Time: 0.06 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1923 |3549k| 0 | 1.284402e+04 | 1.285410e+04*| 0.08% 1 | 0 | 1927 |3575k| 0 | 1.284402e+04 | 1.285410e+04*| 0.08% 1 | 2 | 2017 |3599k| 0 | 1.284402e+04 | 1.285410e+04*| 0.08% f 10 | 5 | 2181 |4143k| 4 | 1.284901e+04 | 1.285382e+04 | 0.04% f 10 | 5 | 2193 |4179k| 4 | 1.284901e+04 | 1.285359e+04 | 0.04% r 12 | 4 | 2201 |4244k| 5 | 1.285054e+04 | 1.285220e+04 | 0.01% * 13 | 5 | 2203 |4272k| 6 | 1.285054e+04 | 1.285211e+04 | 0.01% * 17 | 2 | 2261 |4387k| 6 | 1.285054e+04 | 1.285190e+04 | 0.01% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.59 Solving Nodes : 19 (total of 21 nodes in 3 runs) Primal Bound : +1.28518976783387e+04 (42 solutions) Dual Bound : +1.28518976783387e+04 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.59 Original Problem : Problem name : gamsmodel Variables : 1808 (112 binary, 0 integer, 0 implicit integer, 1696 continuous) Constraints : 820 initial, 820 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 1015 (70 binary, 0 integer, 0 implicit integer, 945 continuous) Constraints : 387 initial, 387 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 214 0 0 0 0 0 0 0 dualfix : 0.00 52 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.01 0 0 0 0 0 0 0 0 linear : 0.04 236 291 0 1686 0 310 112 0 root node : - 67 - - 1786 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 25 0 1 23 0 0 22 linear : 387 6 626 2 0 0 1554 0 0 0 countsols : 0 0 0 2 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.11 0.00 0.00 0.11 0.00 linear : 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 5 0 411 pseudoobj : 0.00 236 0 210 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: 2) redcost : 0.00 39 0 195 0 0 impliedbounds : 0.00 6 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 6 0 0 7 0 strongcg : 0.01 6 0 0 0 0 cmir : 0.04 6 0 0 6 0 flowcover : 0.05 6 0 0 0 0 clique : 0.00 3 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.11 23 1 23 0 0 22 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 - 2 pseudo solutions : 0.00 - 0 oneopt : 0.01 5 1 veclendiving : 0.00 1 0 linesearchdiving : 0.00 1 0 objpscostdiving : 0.00 1 0 rootsoldiving : 0.00 2 1 simplerounding : 0.01 28 27 rounding : 0.00 28 0 shifting : 0.00 8 0 intshifting : 0.00 2 1 fixandinfer : 0.00 0 0 feaspump : 0.00 0 0 coefdiving : 0.00 2 0 pscostdiving : 0.01 1 5 fracdiving : 0.01 1 4 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 guideddiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.14 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.01 1 5 5.00 - dual LP : 0.10 35 1988 56.80 19880.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.02 19 277 14.58 13850.00 strong branching : 0.11 88 1021 11.60 9281.82 (at root node) : - 30 375 12.50 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 3 nodes : 19 nodes (total) : 21 nodes left : 0 max depth : 6 max depth (total): 6 backtracks : 10 (52.6%) delayed cutoffs : 0 repropagations : 20 (317 domain reductions, 0 cutoffs) avg switch length: 4.00 switching time : 0.02 Solution : Solutions found : 42 (9 improvements) Primal Bound : +1.28518976783387e+04 (in run 3, after 17 nodes, 0.59 seconds, depth 6, found by ) Dual Bound : +1.28518976783387e+04 Gap : 0.00 % Root Dual Bound : +1.28440167753368e+04 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- misc06.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job misc06.gms Stop 10/01/08 21:16:39 elapsed 0:00:00.794