--- Job gr4x6 Start 10/01/08 17:24:47 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 --- gr4x6.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/gr4x6.gdx --- gr4x6.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.019 --- gr4x6.gms(123) 4 Mb --- Generating MIP model m --- gr4x6.gms(124) 4 Mb --- 35 rows 49 columns 145 non-zeroes --- 24 discrete-columns --- Executing SCIP: elapsed 0:00:00.021 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, 24 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 0 del vars, 0 del conss, 24 chg bounds, 0 chg sides, 0 chg coeffs, 24 upgd conss, 0 impls, 0 clqs presolving (3 rounds): 0 deleted vars, 0 deleted constraints, 24 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 24 implications, 0 cliques presolved problem has 48 variables (24 bin, 0 int, 0 impl, 24 cont) and 34 constraints 24 constraints of type 10 constraints of type Presolving Time: 0.00 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 35 | 173k| 0 | 1.855500e+02 | -- | Inf r 1 | 0 | 35 | 174k| 0 | 1.855500e+02 | 2.290500e+02 | 23.44% 1 | 0 | 46 | 199k| 0 | 1.942595e+02 | 2.290500e+02 | 17.91% 1 | 0 | 55 | 216k| 0 | 1.991113e+02 | 2.290500e+02 | 15.04% 1 | 0 | 73 | 240k| 0 | 2.017646e+02 | 2.290500e+02 | 13.52% 1 | 0 | 81 | 254k| 0 | 2.023179e+02 | 2.290500e+02 | 13.21% 1 | 0 | 84 | 263k| 0 | 2.023500e+02 | 2.290500e+02 | 13.19% * 1 | 0 | 84 | 264k| 0 | 2.023500e+02 | 2.023500e+02 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.04 Solving Nodes : 1 Primal Bound : +2.02350000000000e+02 (6 solutions) Dual Bound : +2.02350000000000e+02 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.04 Original Problem : Problem name : gamsmodel Variables : 48 (24 binary, 0 integer, 0 implicit integer, 24 continuous) Constraints : 34 initial, 34 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 48 (24 binary, 0 integer, 0 implicit integer, 24 continuous) Constraints : 34 initial, 34 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.00 0 0 0 0 0 0 0 0 varbound : 0.00 0 0 0 0 0 0 0 0 linear : 0.00 0 0 0 24 0 0 0 0 root node : - 0 - - 0 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 1 0 0 0 0 0 0 varbound : 24 6 49 1 0 0 0 0 0 0 linear : 10 6 49 1 0 0 0 14 0 0 countsols : 0 0 0 1 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 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 5 - - 39 - (maximal pool size: 119) redcost : 0.00 6 0 0 0 0 impliedbounds : 0.00 5 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 6 0 0 28 0 strongcg : 0.00 6 0 0 1 0 cmir : 0.02 6 0 0 67 0 flowcover : 0.01 6 0 0 45 0 clique : 0.00 1 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 5 5 rounding : 0.00 5 0 shifting : 0.00 5 0 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.00 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.01 6 84 14.00 - 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 : 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 : 6 (2 improvements) Primal Bound : +2.02350000000000e+02 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by ) Dual Bound : +2.02350000000000e+02 Gap : 0.00 % Root Dual Bound : +2.02350000000000e+02 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- gr4x6.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job gr4x6.gms Stop 10/01/08 17:24:47 elapsed 0:00:00.101