--- Job p0033 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 --- p0033.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p0033.gdx --- p0033.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.080 --- p0033.gms(123) 4 Mb --- Generating MIP model m --- p0033.gms(124) 4 Mb --- 16 rows 34 columns 132 non-zeroes --- 33 discrete-columns --- Executing SCIP: elapsed 0:00:00.082 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) 2 del vars, 1 del conss, 0 chg bounds, 4 chg sides, 12 chg coeffs, 0 upgd conss, 4 impls, 3 clqs (round 2) 3 del vars, 2 del conss, 0 chg bounds, 4 chg sides, 12 chg coeffs, 11 upgd conss, 4 impls, 3 clqs (round 3) 3 del vars, 2 del conss, 0 chg bounds, 4 chg sides, 12 chg coeffs, 12 upgd conss, 4 impls, 3 clqs presolving (4 rounds): 3 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 12 changed coefficients 4 implications, 3 cliques presolved problem has 30 variables (30 bin, 0 int, 0 impl, 0 cont) and 13 constraints 5 constraints of type 3 constraints of type 1 constraints of type 4 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.02 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 17 | 144k| 0 | 2.838547e+03 | -- | Inf 1 | 0 | 49 | 155k| 0 | 2.889830e+03 | -- | Inf 1 | 0 | 57 | 169k| 0 | 2.917884e+03 | -- | Inf 1 | 0 | 66 | 179k| 0 | 2.941400e+03 | -- | Inf 1 | 0 | 70 | 193k| 0 | 2.941400e+03 | -- | Inf 1 | 0 | 79 | 203k| 0 | 2.948273e+03 | -- | Inf 1 | 0 | 81 | 211k| 0 | 2.948273e+03 | -- | Inf 1 | 0 | 88 | 217k| 0 | 2.956391e+03 | -- | Inf 1 | 0 | 95 | 233k| 0 | 2.972222e+03 | -- | Inf s 1 | 0 | 95 | 234k| 0 | 2.972222e+03 | 3.910000e+03 | 31.55% 1 | 0 | 103 | 245k| 0 | 2.974378e+03 | 3.910000e+03 | 31.46% s 1 | 0 | 103 | 245k| 0 | 2.974378e+03 | 3.343000e+03 | 12.39% 1 | 0 | 112 | 255k| 0 | 2.980830e+03 | 3.343000e+03 | 12.15% 1 | 0 | 116 | 260k| 0 | 2.997710e+03 | 3.343000e+03 | 11.52% 1 | 0 | 121 | 264k| 0 | 3.012143e+03 | 3.343000e+03 | 10.98% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 128 | 271k| 0 | 3.046626e+03 | 3.343000e+03 | 9.73% 1 | 0 | 129 | 272k| 0 | 3.046626e+03 | 3.343000e+03 | 9.73% 1 | 0 | 130 | 272k| 0 | 3.046626e+03 | 3.343000e+03 | 9.73% k 1 | 0 | 130 | 274k| 0 | 3.046626e+03 | 3.188000e+03 | 4.64% E 1 | 0 | 130 | 274k| 0 | 3.046626e+03 | 3.089000e+03 | 1.39% 1 | 0 | 130 | 274k| 0 | 3.046626e+03 | 3.089000e+03 | 1.39% 1 | 0 | 130 | 274k| 0 | 3.046626e+03 | 3.089000e+03 | 1.39% 1 | 0 | 130 | 274k| 0 | 3.046626e+03 | 3.089000e+03 | 1.39% (run 1, node 1) restarting after 10 global fixings of integer variables (restart) converted 38 cuts from the global cut pool into linear constraints presolving: (round 1) 10 del vars, 4 del conss, 0 chg bounds, 2 chg sides, 9 chg coeffs, 0 upgd conss, 20 impls, 5 clqs (round 2) 10 del vars, 5 del conss, 0 chg bounds, 3 chg sides, 10 chg coeffs, 0 upgd conss, 20 impls, 5 clqs (round 3) 10 del vars, 5 del conss, 0 chg bounds, 5 chg sides, 17 chg coeffs, 34 upgd conss, 32 impls, 5 clqs (round 4) 10 del vars, 14 del conss, 0 chg bounds, 17 chg sides, 61 chg coeffs, 34 upgd conss, 32 impls, 5 clqs (round 5) 10 del vars, 16 del conss, 0 chg bounds, 18 chg sides, 69 chg coeffs, 34 upgd conss, 44 impls, 5 clqs (round 6) 10 del vars, 16 del conss, 0 chg bounds, 18 chg sides, 70 chg coeffs, 34 upgd conss, 44 impls, 5 clqs presolving (7 rounds): 10 deleted vars, 16 deleted constraints, 0 tightened bounds, 0 added holes, 18 changed sides, 70 changed coefficients 44 implications, 5 cliques presolved problem has 20 variables (20 bin, 0 int, 0 impl, 0 cont) and 48 constraints 29 constraints of type 8 constraints of type 1 constraints of type 10 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.04 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 151 | 191k| 0 | 3.081263e+03 | 3.089000e+03 | 0.25% 1 | 0 | 153 | 198k| 0 | 3.084178e+03 | 3.089000e+03 | 0.16% 1 | 0 | 153 | 199k| 0 | 3.089000e+03 | 3.089000e+03 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.13 Solving Nodes : 1 (total of 2 nodes in 2 runs) Primal Bound : +3.08900000000000e+03 (9 solutions) Dual Bound : +3.08900000000000e+03 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.13 Original Problem : Problem name : gamsmodel Variables : 33 (33 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 15 initial, 15 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 20 (20 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 48 initial, 48 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 10 0 0 0 0 0 0 0 dualfix : 0.00 2 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.00 0 0 0 0 0 0 0 0 knapsack : 0.00 0 0 0 0 0 2 17 69 setppc : 0.00 0 0 0 0 0 10 0 0 linear : 0.00 0 1 0 0 0 6 5 13 logicor : 0.01 0 0 0 0 0 0 0 0 root node : - 17 - - 17 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 2 0 1 3 0 0 0 knapsack : 29 18 66 0 0 0 0 31 0 0 setppc : 8 18 66 0 0 0 2 0 0 0 linear : 1 18 66 0 0 0 0 3 0 0 logicor : 10 18 15 0 0 0 2 0 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 knapsack : 0.00 0.00 0.00 0.00 0.00 setppc : 0.00 0.00 0.00 0.00 0.00 linear : 0.00 0.00 0.00 0.00 0.00 logicor : 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.00 21 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 0 - - 0 - (maximal pool size: 23) redcost : 0.00 18 0 10 0 0 impliedbounds : 0.00 18 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.02 18 0 0 61 0 strongcg : 0.00 18 0 0 64 0 cmir : 0.02 11 0 0 49 0 flowcover : 0.01 11 0 0 99 0 clique : 0.00 18 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.00 2 1 3 0 0 0 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 simplerounding : 0.00 8 0 rounding : 0.00 18 0 shifting : 0.00 18 7 intshifting : 0.00 0 0 oneopt : 0.00 1 1 fixandinfer : 0.00 0 0 feaspump : 0.00 1 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.01 18 130 7.22 - barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.00 11 23 2.09 - strong branching : 0.00 15 132 8.80 - (at root node) : - 15 132 8.80 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 2 nodes : 1 nodes (total) : 2 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 : 9 (4 improvements) Primal Bound : +3.08900000000000e+03 (in run 1, after 1 nodes, 0.11 seconds, depth 0, found by ) Dual Bound : +3.08900000000000e+03 Gap : 0.00 % Root Dual Bound : +3.08900000000000e+03 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- p0033.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p0033.gms Stop 10/03/08 03:55:51 elapsed 0:00:00.433