--- Job dano3_5 Start 10/01/08 13:54:51 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 --- dano3_5.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/dano3_5.gdx --- dano3_5.gms(148) 6 Mb --- Starting execution: elapsed 0:00:00.143 --- dano3_5.gms(123) 6 Mb --- Generating MIP model m --- dano3_5.gms(124) 10 Mb --- 3,203 rows 13,874 columns 79,657 non-zeroes --- 115 discrete-columns --- dano3_5.gms(124) 10 Mb --- Executing SCIP: elapsed 0:00:00.452 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) 13 del vars, 13 del conss, 13324 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 13 del vars, 28 del conss, 13325 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 3) 13 del vars, 28 del conss, 13325 chg bounds, 0 chg sides, 0 chg coeffs, 133 upgd conss, 0 impls, 0 clqs presolving (4 rounds): 13 deleted vars, 28 deleted constraints, 13325 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 2905 implications, 0 cliques presolved problem has 13860 variables (115 bin, 0 int, 0 impl, 13745 cont) and 3174 constraints 133 constraints of type 3041 constraints of type Presolving Time: 1.24 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 60678 | 29M| 0 | 5.762316e+02 | -- | Inf 1 | 0 |150287 | 29M| 0 | 5.762316e+02 | -- | Inf 1 | 0 |151407 | 29M| 0 | 5.762752e+02 | -- | Inf 1 | 0 |152093 | 29M| 0 | 5.763046e+02 | -- | Inf 1 | 0 |152748 | 29M| 0 | 5.763288e+02 | -- | Inf 1 | 0 |153149 | 29M| 0 | 5.763329e+02 | -- | Inf 1 | 0 |153369 | 29M| 0 | 5.763340e+02 | -- | Inf 1 | 0 |153562 | 29M| 0 | 5.763347e+02 | -- | Inf 1 | 0 |153694 | 29M| 0 | 5.763352e+02 | -- | Inf 1 | 0 |153702 | 29M| 0 | 5.763352e+02 | -- | Inf i 1 | 0 |157077 | 30M| 0 | 5.763352e+02 | 5.792179e+02 | 0.50% 1 | 0 |157077 | 30M| 0 | 5.763352e+02 | 5.792179e+02 | 0.50% 1 | 0 |157287 | 30M| 0 | 5.763373e+02 | 5.792179e+02 | 0.50% 1 | 2 |157287 | 30M| 0 | 5.763373e+02 | 5.792179e+02 | 0.50% c 8 | 9 |197085 | 30M| 7 | 5.763793e+02 | 5.773968e+02 | 0.18% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap c 35 | 14 |508957 | 31M| 15 | 5.767512e+02 | 5.769249e+02 | 0.03% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 1624.98 Solving Nodes : 89 Primal Bound : +5.76924915956558e+02 (3 solutions) Dual Bound : +5.76924915956558e+02 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 1624.98 Original Problem : Problem name : gamsmodel Variables : 13873 (115 binary, 0 integer, 0 implicit integer, 13758 continuous) Constraints : 3202 initial, 3202 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 13860 (115 binary, 0 integer, 0 implicit integer, 13745 continuous) Constraints : 3174 initial, 3174 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 0 0 0 0 0 0 0 0 dualfix : 0.01 0 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 : 1.01 0 0 0 0 0 0 0 0 varbound : 0.00 0 0 0 0 0 0 0 0 linear : 0.18 0 13 0 13325 0 28 0 0 root node : - 16 - - 16614 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 90 0 2 69 0 0 104 varbound : 133 10 1111 0 0 0 867 0 0 0 linear : 3041 10 1111 0 0 0 42554 0 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 180.79 0.00 0.00 180.79 0.00 varbound : 0.02 0.00 0.02 0.00 0.00 linear : 2.51 0.12 2.39 0.00 0.00 countsols : 0.00 0.00 0.00 0.00 0.00 Propagators : Time Calls Cutoffs DomReds rootredcost : 0.00 2 0 957 pseudoobj : 0.00 781 0 12 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.05 57 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 9 - - 9 - (maximal pool size: 101) redcost : 0.08 126 0 370 0 0 impliedbounds : 0.01 10 0 0 42 0 intobj : 0.00 0 0 0 0 0 gomory : 0.03 10 0 0 0 0 strongcg : 0.02 10 0 0 0 0 cmir : 2.01 10 0 0 60 0 flowcover : 1.06 10 0 0 1 0 clique : 0.00 1 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 : 180.79 90 2 69 0 0 104 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 crossover : 0.00 0 0 oneopt : 0.03 3 0 pscostdiving : 37.31 2 0 fracdiving : 48.58 2 0 guideddiving : 25.41 2 0 linesearchdiving : 70.24 2 0 veclendiving : 45.59 2 0 coefdiving : 51.07 3 2 simplerounding : 0.00 0 0 rounding : 0.01 101 0 shifting : 0.03 17 0 intshifting : 65.31 3 1 fixandinfer : 0.00 0 0 feaspump : 109.16 1 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 objpscostdiving : 41.06 1 0 rootsoldiving : 50.37 1 0 octane : 0.00 0 0 rens : 0.23 1 0 rins : 0.00 0 0 localbranching : 0.00 0 0 mutation : 0.00 0 0 dins : 0.00 0 0 LP : Time Calls Iterations Iter/call Iter/sec primal LP : 3.65 0 0 0.00 0.00 dual LP : 889.77 137 552205 4030.69 620.62 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 542.91 201 365651 1819.16 673.50 strong branching : 180.76 419 104361 249.07 577.35 (at root node) : - 23 6056 263.30 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 89 nodes (total) : 89 nodes left : 0 max depth : 18 max depth (total): 18 backtracks : 47 (52.8%) delayed cutoffs : 0 repropagations : 35 (2431 domain reductions, 0 cutoffs) avg switch length: 7.91 switching time : 3.75 Solution : Solutions found : 3 (3 improvements) Primal Bound : +5.76924915956558e+02 (in run 1, after 35 nodes, 928.07 seconds, depth 18, found by ) Dual Bound : +5.76924915956558e+02 Gap : 0.00 % Root Dual Bound : +5.76337267566713e+02 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- dano3_5.gms(124) 0 Mb --- Reading solution for model m --- dano3_5.gms(124) 6 Mb *** Status: Normal completion --- Job dano3_5.gms Stop 10/01/08 14:22:48 elapsed 0:27:57.372