--- Job vpm1 Start 10/03/08 08:07:32 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 --- vpm1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/vpm1.gdx --- vpm1.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.382 --- vpm1.gms(123) 4 Mb --- Generating MIP model m --- vpm1.gms(124) 4 Mb --- 235 rows 379 columns 918 non-zeroes --- 168 discrete-columns --- vpm1.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.403 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) 32 del vars, 5 del conss, 91 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 67 del vars, 32 del conss, 136 chg bounds, 4 chg sides, 66 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 3) 105 del vars, 80 del conss, 136 chg bounds, 4 chg sides, 76 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 4) 151 del vars, 80 del conss, 136 chg bounds, 6 chg sides, 76 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 5) 161 del vars, 90 del conss, 136 chg bounds, 6 chg sides, 76 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 6) 169 del vars, 90 del conss, 136 chg bounds, 8 chg sides, 76 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 7) 179 del vars, 100 del conss, 136 chg bounds, 8 chg sides, 76 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 8) 187 del vars, 100 del conss, 136 chg bounds, 9 chg sides, 76 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 9) 192 del vars, 105 del conss, 136 chg bounds, 9 chg sides, 76 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 10) 196 del vars, 105 del conss, 144 chg bounds, 9 chg sides, 76 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 11) 196 del vars, 105 del conss, 144 chg bounds, 9 chg sides, 84 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 12) 196 del vars, 105 del conss, 144 chg bounds, 9 chg sides, 84 chg coeffs, 84 upgd conss, 0 impls, 0 clqs presolving (13 rounds): 196 deleted vars, 105 deleted constraints, 144 tightened bounds, 0 added holes, 9 changed sides, 84 changed coefficients 98 implications, 0 cliques presolved problem has 182 variables (84 bin, 0 int, 0 impl, 98 cont) and 129 constraints 84 constraints of type 45 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.05 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 125 | 757k| 0 | 1.676667e+01 | -- | Inf r 1 | 0 | 125 | 764k| 0 | 1.676667e+01 | 2.300000e+01 | 37.18% s 1 | 0 | 125 | 775k| 0 | 1.676667e+01 | 2.200000e+01 | 31.21% 1 | 0 | 144 | 840k| 0 | 1.763333e+01 | 2.200000e+01 | 24.76% 1 | 0 | 160 | 874k| 0 | 1.925000e+01 | 2.200000e+01 | 14.29% 1 | 0 | 178 | 887k| 0 | 1.950000e+01 | 2.200000e+01 | 12.82% 1 | 0 | 193 | 912k| 0 | 1.950000e+01 | 2.200000e+01 | 12.82% 1 | 0 | 209 | 935k| 0 | 1.950000e+01 | 2.200000e+01 | 12.82% 1 | 0 | 230 | 958k| 0 | 1.966667e+01 | 2.200000e+01 | 11.86% 1 | 0 | 259 | 980k| 0 | 2.000000e+01 | 2.200000e+01 | 10.00% 1 | 0 | 283 | 999k| 0 | 2.000000e+01 | 2.200000e+01 | 10.00% 1 | 0 | 310 |1019k| 0 | 2.000000e+01 | 2.200000e+01 | 10.00% 1 | 0 | 337 |1028k| 0 | 2.000000e+01 | 2.200000e+01 | 10.00% 1 | 0 | 359 |1035k| 0 | 2.000000e+01 | 2.200000e+01 | 10.00% 1 | 0 | 389 |1044k| 0 | 2.000000e+01 | 2.200000e+01 | 10.00% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap i 1 | 0 | 438 |1056k| 0 | 2.000000e+01 | 2.100000e+01 | 5.00% E 1 | 0 | 438 |1061k| 0 | 2.000000e+01 | 2.000000e+01 | 0.00% 1 | 0 | 438 |1061k| 0 | 2.000000e+01 | 2.000000e+01 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.28 Solving Nodes : 1 Primal Bound : +2.00000000000000e+01 (16 solutions) Dual Bound : +2.00000000000000e+01 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.28 Original Problem : Problem name : gamsmodel Variables : 378 (168 binary, 0 integer, 0 implicit integer, 210 continuous) Constraints : 234 initial, 234 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 182 (84 binary, 0 integer, 0 implicit integer, 98 continuous) Constraints : 129 initial, 129 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 0 0 0 0 0 0 0 0 dualfix : 0.00 120 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 varbound : 0.00 0 0 0 0 0 0 0 0 linear : 0.02 60 16 0 144 0 105 9 84 root node : - 0 - - 0 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 0 0 0 0 0 0 0 varbound : 84 12 179 0 0 0 0 0 0 0 linear : 45 12 179 0 0 0 0 15 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.00 0.00 0.00 0.00 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 linear : 0.01 0.01 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 0 0 0 pseudoobj : 0.00 7 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 11 - - 44 - (maximal pool size: 240) redcost : 0.00 12 0 0 0 0 impliedbounds : 0.00 12 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 12 0 0 64 0 strongcg : 0.00 12 0 0 0 0 cmir : 0.12 10 0 0 139 0 flowcover : 0.05 10 0 0 88 0 clique : 0.00 12 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 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 relpscost : 0.00 0 0 0 0 0 0 Primal Heuristics : Time Calls Found LP solutions : 0.00 - 0 pseudo solutions : 0.00 - 0 simplerounding : 0.00 13 13 rounding : 0.00 13 0 shifting : 0.00 13 1 intshifting : 0.00 1 1 oneopt : 0.00 1 0 fixandinfer : 0.00 0 0 feaspump : 0.00 0 0 coefdiving : 0.00 0 0 pscostdiving : 0.00 0 0 fracdiving : 0.00 0 0 veclendiving : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 objpscostdiving : 0.00 0 0 rootsoldiving : 0.00 0 0 linesearchdiving : 0.00 0 0 guideddiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.02 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.00 0 0 0.00 - dual LP : 0.03 13 389 29.92 12966.67 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.00 1 49 49.00 - strong branching : 0.00 0 0 0.00 - (at root node) : - 0 0 0.00 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 1 nodes (total) : 1 nodes left : 0 max depth : 0 max depth (total): 0 backtracks : 0 (0.0%) delayed cutoffs : 0 repropagations : 0 (0 domain reductions, 0 cutoffs) avg switch length: 2.00 switching time : 0.00 Solution : Solutions found : 16 (4 improvements) Primal Bound : +2.00000000000000e+01 (in run 1, after 1 nodes, 0.28 seconds, depth 0, found by ) Dual Bound : +2.00000000000000e+01 Gap : 0.00 % Root Dual Bound : +2.00000000000000e+01 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- vpm1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job vpm1.gms Stop 10/03/08 08:07:34 elapsed 0:00:01.631