--- Job dano3_4 Start 10/01/08 13:41:57 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_4.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/dano3_4.gdx --- dano3_4.gms(148) 6 Mb --- Starting execution: elapsed 0:00:00.173 --- dano3_4.gms(123) 6 Mb --- Generating MIP model m --- dano3_4.gms(124) 10 Mb --- 3,203 rows 13,874 columns 79,657 non-zeroes --- 92 discrete-columns --- dano3_4.gms(124) 10 Mb --- Executing SCIP: elapsed 0:00:00.480 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, 106 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 2320 implications, 0 cliques presolved problem has 13860 variables (92 bin, 0 int, 0 impl, 13768 cont) and 3174 constraints 106 constraints of type 3068 constraints of type Presolving Time: 0.72 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 50120 | 29M| 0 | 5.762316e+02 | -- | Inf (node 1) unresolved numerical troubles in LP 15 1 | 0 |154747 | 29M| 0 | 5.762316e+02 | -- | Inf 1 | 0 |155590 | 29M| 0 | 5.762594e+02 | -- | Inf 1 | 0 |156139 | 29M| 0 | 5.762708e+02 | -- | Inf 1 | 0 |156690 | 29M| 0 | 5.762849e+02 | -- | Inf 1 | 0 |157060 | 29M| 0 | 5.762894e+02 | -- | Inf 1 | 0 |157261 | 29M| 0 | 5.762903e+02 | -- | Inf i 1 | 0 |163463 | 29M| 0 | 5.762903e+02 | 5.815354e+02 | 0.91% 1 | 0 |163463 | 29M| 0 | 5.762903e+02 | 5.815354e+02 | 0.91% 1 | 0 |163589 | 29M| 0 | 5.762910e+02 | 5.815354e+02 | 0.91% 1 | 2 |163589 | 29M| 0 | 5.762910e+02 | 5.815354e+02 | 0.91% c 8 | 9 |210494 | 30M| 7 | 5.763191e+02 | 5.784313e+02 | 0.37% p 23 | 15 |261984 | 30M| 13 | 5.763298e+02 | 5.768342e+02 | 0.09% f 33 | 10 |289623 | 31M| 13 | 5.763298e+02 | 5.764994e+02 | 0.03% v 35 | 6 |331898 | 31M| 13 | 5.763298e+02 | 5.764352e+02 | 0.02% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 725.01 Solving Nodes : 43 Primal Bound : +5.76435224707203e+02 (5 solutions) Dual Bound : +5.76435224707203e+02 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 725.01 Original Problem : Problem name : gamsmodel Variables : 13873 (92 binary, 0 integer, 0 implicit integer, 13781 continuous) Constraints : 3202 initial, 3202 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 13860 (92 binary, 0 integer, 0 implicit integer, 13768 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 : 0.57 0 0 0 0 0 0 0 0 varbound : 0.00 0 0 0 0 0 0 0 0 linear : 0.11 0 13 0 13325 0 28 0 0 root node : - 47 - - 38939 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 39 0 0 3 0 0 72 varbound : 106 7 491 0 0 0 264 0 0 0 linear : 3068 7 500 0 0 0 43033 0 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 112.92 0.00 0.00 112.92 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 linear : 1.02 0.06 0.96 0.00 0.00 countsols : 0.00 0.00 0.00 0.00 0.00 Propagators : Time Calls Cutoffs DomReds rootredcost : 0.04 4 0 13210 pseudoobj : 0.00 228 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.00 9 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 6 - - 3 - (maximal pool size: 58) redcost : 0.03 50 0 9 0 0 impliedbounds : 0.00 7 0 0 29 0 intobj : 0.00 0 0 0 0 0 gomory : 0.02 7 0 0 0 0 strongcg : 0.03 7 0 0 0 0 cmir : 1.11 7 0 0 30 0 flowcover : 0.74 7 0 0 0 0 clique : 0.01 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 : 112.92 39 0 3 0 0 72 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 objpscostdiving : 0.00 0 0 rootsoldiving : 0.00 0 0 linesearchdiving : 0.00 0 0 guideddiving : 0.00 0 0 crossover : 0.00 0 0 oneopt : 0.06 5 0 coefdiving : 45.24 1 1 pscostdiving : 5.20 1 1 fracdiving : 4.30 1 1 simplerounding : 0.00 0 0 rounding : 0.02 47 0 shifting : 0.00 13 0 intshifting : 64.97 4 1 fixandinfer : 0.00 0 0 feaspump : 132.70 1 0 veclendiving : 28.77 1 1 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.20 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.44 0 0 0.00 0.00 dual LP : 323.64 54 200680 3716.30 620.07 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 280.92 42 195662 4658.62 696.50 strong branching : 112.92 275 64684 235.21 572.83 (at root node) : - 21 4664 222.10 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 43 nodes (total) : 43 nodes left : 0 max depth : 13 max depth (total): 13 backtracks : 9 (20.9%) delayed cutoffs : 0 repropagations : 32 (12503 domain reductions, 0 cutoffs) avg switch length: 4.00 switching time : 3.47 Solution : Solutions found : 5 (5 improvements) Primal Bound : +5.76435224707203e+02 (in run 1, after 35 nodes, 620.65 seconds, depth 15, found by ) Dual Bound : +5.76435224707203e+02 Gap : 0.00 % Root Dual Bound : +5.76291030058114e+02 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- dano3_4.gms(124) 0 Mb --- Reading solution for model m --- dano3_4.gms(124) 6 Mb *** Status: Normal completion --- Job dano3_4.gms Stop 10/01/08 13:54:51 elapsed 0:12:53.348