--- Job vpm2 Start 10/03/08 08:07:34 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 --- vpm2.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/vpm2.gdx --- vpm2.gms(147) 3 Mb --- Starting execution: elapsed 0:00:00.089 --- vpm2.gms(123) 4 Mb --- Generating MIP model m --- vpm2.gms(124) 4 Mb --- 235 rows 379 columns 1,086 non-zeroes --- 168 discrete-columns --- vpm2.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.111 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 (round 13) 197 del vars, 105 del conss, 174 chg bounds, 9 chg sides, 84 chg coeffs, 84 upgd conss, 99 impls, 0 clqs (round 14) 197 del vars, 106 del conss, 174 chg bounds, 9 chg sides, 114 chg coeffs, 84 upgd conss, 99 impls, 0 clqs presolving (15 rounds): 197 deleted vars, 106 deleted constraints, 174 tightened bounds, 0 added holes, 9 changed sides, 114 changed coefficients 99 implications, 0 cliques presolved problem has 181 variables (83 bin, 0 int, 0 impl, 98 cont) and 128 constraints 83 constraints of type 45 constraints of type transformed objective value is always integral (scale: 0.25) Presolving Time: 0.02 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 147 | 764k| 0 | 1.106192e+01 | -- | Inf F 1 | 0 | 294 | 782k| 0 | 1.106192e+01 | 1.950000e+01 | 76.28% 1 | 0 | 339 | 853k| 0 | 1.189129e+01 | 1.950000e+01 | 63.99% 1 | 0 | 394 | 898k| 0 | 1.263985e+01 | 1.950000e+01 | 54.27% 1 | 0 | 417 | 909k| 0 | 1.276780e+01 | 1.950000e+01 | 52.73% 1 | 0 | 446 | 929k| 0 | 1.285065e+01 | 1.950000e+01 | 51.74% 1 | 0 | 470 | 954k| 0 | 1.288867e+01 | 1.950000e+01 | 51.30% 1 | 0 | 491 | 982k| 0 | 1.290095e+01 | 1.950000e+01 | 51.15% 1 | 0 | 503 | 993k| 0 | 1.290407e+01 | 1.950000e+01 | 51.12% 1 | 0 | 530 |1002k| 0 | 1.291917e+01 | 1.950000e+01 | 50.94% 1 | 0 | 556 |1021k| 0 | 1.293229e+01 | 1.950000e+01 | 50.79% 1 | 0 | 583 |1031k| 0 | 1.296211e+01 | 1.950000e+01 | 50.44% 1 | 0 | 594 |1032k| 0 | 1.296511e+01 | 1.950000e+01 | 50.40% 1 | 0 | 595 |1032k| 0 | 1.296514e+01 | 1.950000e+01 | 50.40% k 1 | 0 | 744 |1043k| 0 | 1.296514e+01 | 1.600000e+01 | 23.41% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap E 1 | 0 | 744 |1043k| 0 | 1.296514e+01 | 1.375000e+01 | 6.05% 1 | 0 | 744 |1043k| 0 | 1.296514e+01 | 1.375000e+01 | 6.05% 1 | 0 | 744 |1040k| 0 | 1.296514e+01 | 1.375000e+01 | 6.05% 1 | 2 | 744 |1040k| 0 | 1.296514e+01 | 1.375000e+01 | 6.05% (run 1, node 1) restarting after 8 global fixings of integer variables (restart) converted 61 cuts from the global cut pool into linear constraints presolving: (round 1) 16 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 19 upgd conss, 101 impls, 0 clqs presolving (2 rounds): 16 deleted vars, 0 deleted constraints, 2 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 101 implications, 0 cliques presolved problem has 165 variables (75 bin, 0 int, 0 impl, 90 cont) and 181 constraints 78 constraints of type 2 constraints of type 87 constraints of type 14 constraints of type transformed objective value is always integral (scale: 0.25) Presolving Time: 0.03 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 958 | 890k| 0 | 1.296514e+01 | 1.375000e+01 | 6.05% 1 | 0 | 968 | 899k| 0 | 1.297052e+01 | 1.375000e+01 | 6.01% 1 | 2 | 968 | 899k| 0 | 1.297052e+01 | 1.375000e+01 | 6.01% 100 | 31 | 2340 | 945k| 15 | 1.323139e+01 | 1.375000e+01 | 3.92% 200 | 41 | 3371 | 955k| 15 | 1.333468e+01 | 1.375000e+01 | 3.11% 300 | 43 | 4282 | 970k| 17 | 1.335993e+01 | 1.375000e+01 | 2.92% 400 | 9 | 5318 | 954k| 17 | 1.339973e+01 | 1.375000e+01 | 2.61% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 2.36 Solving Nodes : 421 (total of 422 nodes in 2 runs) Primal Bound : +1.37500000000000e+01 (11 solutions) Dual Bound : +1.37500000000000e+01 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 2.36 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 : 165 (75 binary, 0 integer, 0 implicit integer, 90 continuous) Constraints : 181 initial, 184 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 16 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 1 0 0 30 0 0 0 0 varbound : 0.00 0 0 0 2 0 1 0 30 knapsack : 0.00 0 0 0 0 0 0 0 0 linear : 0.00 60 16 0 144 0 105 9 84 logicor : 0.00 0 0 0 0 0 0 0 0 bounddisjunction : 0.00 0 0 0 0 0 0 0 0 root node : - 21 - - 40 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 323 0 13 162 0 0 422 varbound : 78 15 1538 0 0 0 681 0 0 0 knapsack : 2 1 1323 0 0 0 11 0 0 0 linear : 87 15 1538 0 0 3 935 20 0 0 logicor : 14+ 1 320 0 0 0 63 0 0 0 bounddisjunction : 0+ 0 111 0 0 0 0 0 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.41 0.00 0.00 0.41 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 knapsack : 0.00 0.00 0.00 0.00 0.00 linear : 0.06 0.01 0.05 0.00 0.00 logicor : 0.00 0.00 0.00 0.00 0.00 bounddisjunction : 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 0 0 0 pseudoobj : 0.01 1364 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 2 2 3 4.0 2 3.5 - infeasible LP : 0.00 2 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 : - - - 4 3.5 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 0 - - 0 - (maximal pool size: 8) redcost : 0.00 436 0 313 0 0 impliedbounds : 0.00 15 0 0 2 0 intobj : 0.00 0 0 0 0 0 gomory : 0.02 15 0 0 20 0 strongcg : 0.02 15 0 0 0 0 cmir : 0.36 11 0 0 313 0 flowcover : 0.07 11 0 0 110 0 clique : 0.00 2 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.41 323 13 162 0 0 422 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 veclendiving : 0.00 0 0 objpscostdiving : 0.00 0 0 rootsoldiving : 0.00 0 0 linesearchdiving : 0.00 0 0 guideddiving : 0.00 0 0 oneopt : 0.01 1 1 coefdiving : 0.00 1 0 pscostdiving : 0.00 1 0 fracdiving : 0.01 1 0 simplerounding : 0.00 0 0 rounding : 0.00 221 0 shifting : 0.03 46 7 intshifting : 0.00 1 0 fixandinfer : 0.00 0 0 feaspump : 0.01 1 1 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.88 1 1 rins : 0.00 0 0 localbranching : 0.00 0 0 mutation : 0.00 0 0 crossover : 0.02 1 1 dins : 0.00 0 0 LP : Time Calls Iterations Iter/call Iter/sec primal LP : 0.00 0 0 0.00 - dual LP : 0.38 534 5064 9.48 13326.32 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.02 40 443 11.07 22150.00 strong branching : 0.41 510 11368 22.29 27726.83 (at root node) : - 49 2139 43.65 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 2 nodes : 421 nodes (total) : 422 nodes left : 0 max depth : 17 max depth (total): 17 backtracks : 121 (28.7%) delayed cutoffs : 0 repropagations : 2 (1 domain reductions, 0 cutoffs) avg switch length: 4.20 switching time : 0.01 Solution : Solutions found : 11 (3 improvements) Primal Bound : +1.37500000000000e+01 (in run 1, after 1 nodes, 1.39 seconds, depth 0, found by ) Dual Bound : +1.37500000000000e+01 Gap : 0.00 % Root Dual Bound : +1.29705239979812e+01 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- vpm2.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job vpm2.gms Stop 10/03/08 08:07:36 elapsed 0:00:02.581