--- Job bk4x3 Start 10/01/08 13:32:44 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 --- bk4x3.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/bk4x3.gdx --- bk4x3.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.035 --- bk4x3.gms(123) 4 Mb --- Generating MIP model m --- bk4x3.gms(124) 4 Mb --- 20 rows 25 columns 73 non-zeroes --- 12 discrete-columns --- Executing SCIP: elapsed 0:00:00.039 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) 0 del vars, 0 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 0 del vars, 0 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 0 impls, 0 clqs presolving (3 rounds): 0 deleted vars, 0 deleted constraints, 12 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 37 implications, 0 cliques presolved problem has 24 variables (12 bin, 0 int, 0 impl, 12 cont) and 19 constraints 12 constraints of type 7 constraints of type Presolving Time: 0.00 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 15 | 118k| 0 | 3.216667e+02 | -- | Inf r 1 | 0 | 15 | 119k| 0 | 3.216667e+02 | 3.600000e+02 | 11.92% 1 | 0 | 22 | 134k| 0 | 3.450000e+02 | 3.600000e+02 | 4.35% 1 | 0 | 24 | 139k| 0 | 3.500000e+02 | 3.600000e+02 | 2.86% 1 | 0 | 24 | 138k| 0 | 3.500000e+02 | 3.600000e+02 | 2.86% (run 1, node 1) restarting after 2 global fixings of integer variables (restart) converted 7 cuts from the global cut pool into linear constraints presolving: (round 1) 4 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 40 impls, 0 clqs (round 2) 4 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 40 impls, 0 clqs presolving (3 rounds): 4 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 40 implications, 0 cliques presolved problem has 20 variables (10 bin, 0 int, 0 impl, 10 cont) and 22 constraints 10 constraints of type 12 constraints of type Presolving Time: 0.00 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 39 | 129k| 0 | 3.500000e+02 | 3.600000e+02 | 2.86% * 1 | 0 | 39 | 129k| 0 | 3.500000e+02 | 3.500000e+02 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.03 Solving Nodes : 1 (total of 2 nodes in 2 runs) Primal Bound : +3.50000000000000e+02 (5 solutions) Dual Bound : +3.50000000000000e+02 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.03 Original Problem : Problem name : gamsmodel Variables : 24 (12 binary, 0 integer, 0 implicit integer, 12 continuous) Constraints : 19 initial, 19 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 20 (10 binary, 0 integer, 0 implicit integer, 10 continuous) Constraints : 22 initial, 22 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 3 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.00 0 0 0 0 0 0 0 0 varbound : 0.00 0 0 0 0 0 0 0 0 linear : 0.00 0 1 0 12 0 2 0 0 root node : - 2 - - 4 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 2 0 0 0 0 0 0 varbound : 10 5 38 2 0 0 2 0 0 0 linear : 12 5 38 2 0 0 1 4 0 0 countsols : 0 0 0 2 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.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 9 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: 0) redcost : 0.00 5 0 1 0 0 impliedbounds : 0.00 2 0 0 5 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 5 0 0 5 0 strongcg : 0.00 5 0 0 2 0 cmir : 0.00 5 0 0 5 0 flowcover : 0.00 5 0 0 12 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 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 - 1 pseudo solutions : 0.00 - 0 simplerounding : 0.00 2 2 rounding : 0.00 2 0 shifting : 0.00 2 2 intshifting : 0.00 0 0 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.01 0 0 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.00 4 39 9.75 - barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.00 0 0 0.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 : 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 : 5 (2 improvements) Primal Bound : +3.50000000000000e+02 (in run 2, after 1 nodes, 0.03 seconds, depth 0, found by ) Dual Bound : +3.50000000000000e+02 Gap : 0.00 % Root Dual Bound : +3.50000000000000e+02 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- bk4x3.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job bk4x3.gms Stop 10/01/08 13:32:44 elapsed 0:00:00.113