--- Job p0201 Start 10/03/08 03:55: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 --- p0201.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p0201.gdx --- p0201.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.190 --- p0201.gms(123) 4 Mb --- Generating MIP model m --- p0201.gms(124) 4 Mb --- 134 rows 202 columns 2,125 non-zeroes --- 201 discrete-columns --- p0201.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.207 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) 6 del vars, 0 del conss, 6 chg bounds, 6 chg sides, 30 chg coeffs, 0 upgd conss, 0 impls, 26 clqs (round 2) 6 del vars, 26 del conss, 6 chg bounds, 12 chg sides, 30 chg coeffs, 0 upgd conss, 0 impls, 26 clqs (round 3) 6 del vars, 26 del conss, 6 chg bounds, 12 chg sides, 30 chg coeffs, 107 upgd conss, 0 impls, 26 clqs presolving (4 rounds): 6 deleted vars, 26 deleted constraints, 6 tightened bounds, 0 added holes, 12 changed sides, 30 changed coefficients 1944 implications, 26 cliques presolved problem has 195 variables (195 bin, 0 int, 0 impl, 0 cont) and 107 constraints 87 constraints of type 20 constraints of type transformed objective value is always integral (scale: 5) Presolving Time: 0.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 82 | 854k| 0 | 7.125000e+03 | -- | Inf 1 | 0 | 380 |1072k| 0 | 7.125000e+03 | -- | Inf 1 | 0 | 408 |1225k| 0 | 7.180833e+03 | -- | Inf 1 | 0 | 419 |1426k| 0 | 7.191667e+03 | -- | Inf 1 | 0 | 447 |1513k| 0 | 7.208400e+03 | -- | Inf 1 | 0 | 462 |1660k| 0 | 7.231500e+03 | -- | Inf 1 | 0 | 502 |1744k| 0 | 7.245000e+03 | -- | Inf 1 | 0 | 541 |1791k| 0 | 7.270714e+03 | -- | Inf 1 | 0 | 591 |1886k| 0 | 7.305660e+03 | -- | Inf 1 | 0 | 612 |1896k| 0 | 7.329419e+03 | -- | Inf 1 | 0 | 644 |1903k| 0 | 7.356000e+03 | -- | Inf 1 | 0 | 700 |1937k| 0 | 7.379312e+03 | -- | Inf 1 | 0 | 716 |1960k| 0 | 7.393667e+03 | -- | Inf 1 | 0 | 719 |2077k| 0 | 7.398000e+03 | -- | Inf 1 | 0 | 738 |2170k| 0 | 7.414697e+03 | -- | Inf node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 784 |2177k| 0 | 7.429716e+03 | -- | Inf 1 | 0 | 788 |2181k| 0 | 7.430850e+03 | -- | Inf 1 | 0 | 830 |2217k| 0 | 7.440046e+03 | -- | Inf 1 | 0 | 861 |2225k| 0 | 7.466272e+03 | -- | Inf 1 | 0 | 889 |2500k| 0 | 7.473882e+03 | -- | Inf 1 | 0 | 915 |2502k| 0 | 7.478588e+03 | -- | Inf 1 | 0 | 960 |2567k| 0 | 7.482030e+03 | -- | Inf 1 | 0 | 968 |2570k| 0 | 7.482043e+03 | -- | Inf E 1 | 0 | 968 |2573k| 0 | 7.482043e+03 | 7.715000e+03 | 3.11% 1 | 0 | 968 |2573k| 0 | 7.482043e+03 | 7.715000e+03 | 3.11% 1 | 0 | 968 |2573k| 0 | 7.482043e+03 | 7.715000e+03 | 3.11% 1 | 2 | 968 |2573k| 0 | 7.482043e+03 | 7.715000e+03 | 3.11% R 8 | 5 | 1249 |2581k| 6 | 7.487605e+03 | 7.675000e+03 | 2.50% * 12 | 5 | 1547 |2584k| 6 | 7.502885e+03 | 7.665000e+03 | 2.16% * 20 | 4 | 2307 |2586k| 6 | 7.506445e+03 | 7.615000e+03 | 1.45% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 1.93 Solving Nodes : 24 Primal Bound : +7.61500000000000e+03 (4 solutions) Dual Bound : +7.61500000000000e+03 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 1.93 Original Problem : Problem name : gamsmodel Variables : 201 (201 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 133 initial, 133 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 195 (195 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 107 initial, 107 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 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.01 0 0 0 0 0 0 0 0 knapsack : 0.00 0 0 0 0 0 0 0 0 setppc : 0.00 0 0 0 0 0 0 0 0 linear : 0.00 6 0 0 6 0 26 12 30 root node : - 15 - - 15 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 55 0 4 140 0 0 24 knapsack : 87 24 715 2 0 0 111 88 0 0 setppc : 20 24 715 2 0 0 73 0 0 0 countsols : 0 0 0 2 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 1.22 0.00 0.00 1.22 0.00 knapsack : 0.01 0.01 0.00 0.00 0.00 setppc : 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 3 0 12 pseudoobj : 0.01 190 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 1 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 22 - - 201 - (maximal pool size: 631) redcost : 0.01 84 0 639 0 0 impliedbounds : 0.00 24 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.15 24 0 0 513 0 strongcg : 0.09 20 0 0 361 0 cmir : 0.05 10 0 0 61 0 flowcover : 0.11 10 0 0 111 0 clique : 0.00 24 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 : 1.22 53 4 140 0 0 24 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 objpscostdiving : 0.00 0 0 rootsoldiving : 0.00 0 0 linesearchdiving : 0.00 0 0 oneopt : 0.00 4 0 coefdiving : 0.00 1 0 veclendiving : 0.01 1 0 simplerounding : 0.00 0 0 rounding : 0.03 75 1 shifting : 0.01 23 0 intshifting : 0.00 0 0 fixandinfer : 0.00 0 0 feaspump : 0.00 1 0 pscostdiving : 0.00 1 0 fracdiving : 0.01 1 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 guideddiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.09 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.02 0 0 0.00 0.00 dual LP : 0.09 83 2286 27.54 25400.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.02 32 656 20.50 32800.00 strong branching : 1.22 560 27238 48.64 22326.23 (at root node) : - 19 671 35.32 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 24 nodes (total) : 24 nodes left : 0 max depth : 6 max depth (total): 6 backtracks : 7 (29.2%) delayed cutoffs : 0 repropagations : 2 (0 domain reductions, 0 cutoffs) avg switch length: 2.92 switching time : 0.00 Solution : Solutions found : 4 (4 improvements) Primal Bound : +7.61500000000000e+03 (in run 1, after 20 nodes, 1.69 seconds, depth 6, found by ) Dual Bound : +7.61500000000000e+03 Gap : 0.00 % Root Dual Bound : +7.48204271506485e+03 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- p0201.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p0201.gms Stop 10/03/08 03:55:54 elapsed 0:00:02.222