--- Job dsbmip Start 10/01/08 16:24:09 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 --- dsbmip.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/dsbmip.gdx --- dsbmip.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.070 --- dsbmip.gms(123) 4 Mb --- Generating MIP model m --- dsbmip.gms(124) 4 Mb --- 1,183 rows 1,904 columns 8,461 non-zeroes --- 160 discrete-columns --- dsbmip.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.139 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) 151 del vars, 29 del conss, 2339 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 0 impls, 40 clqs (round 2) 171 del vars, 53 del conss, 2386 chg bounds, 27 chg sides, 12 chg coeffs, 0 upgd conss, 40 impls, 20 clqs (round 3) 191 del vars, 73 del conss, 2388 chg bounds, 47 chg sides, 12 chg coeffs, 0 upgd conss, 40 impls, 20 clqs (round 4) 191 del vars, 139 del conss, 2388 chg bounds, 105 chg sides, 12 chg coeffs, 22 upgd conss, 40 impls, 20 clqs (round 5) 244 del vars, 139 del conss, 2492 chg bounds, 105 chg sides, 12 chg coeffs, 22 upgd conss, 2007 impls, 17 clqs (round 6) 249 del vars, 181 del conss, 2492 chg bounds, 105 chg sides, 18 chg coeffs, 22 upgd conss, 2007 impls, 17 clqs (round 7) 262 del vars, 181 del conss, 2545 chg bounds, 105 chg sides, 18 chg coeffs, 22 upgd conss, 3071 impls, 16 clqs (round 8) 263 del vars, 189 del conss, 2545 chg bounds, 105 chg sides, 18 chg coeffs, 22 upgd conss, 3071 impls, 16 clqs presolving (9 rounds): 263 deleted vars, 189 deleted constraints, 2545 tightened bounds, 0 added holes, 105 changed sides, 18 changed coefficients 3071 implications, 16 cliques presolved problem has 1640 variables (94 bin, 0 int, 0 impl, 1546 cont) and 993 constraints 2 constraints of type 16 constraints of type 975 constraints of type Presolving Time: 0.13 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 2213 |4462k| 0 |-3.067690e+02 | -- | Inf F 1 | 0 | 2338 |4513k| 0 |-3.067690e+02 |-3.067690e+02 | 0.00% 1 | 0 | 2338 |4509k| 0 |-3.067690e+02 |-3.067690e+02 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.46 Solving Nodes : 1 Primal Bound : -3.06769012030068e+02 (1 solutions) Dual Bound : -3.06769012030068e+02 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.46 Original Problem : Problem name : gamsmodel Variables : 1903 (183 binary, 0 integer, 0 implicit integer, 1720 continuous) Constraints : 1182 initial, 1182 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 1640 (94 binary, 0 integer, 0 implicit integer, 1546 continuous) Constraints : 993 initial, 993 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 78 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.06 66 0 0 157 0 0 0 0 varbound : 0.00 0 0 0 0 0 0 0 0 setppc : 0.00 0 0 0 0 0 4 0 0 linear : 0.06 0 119 0 2388 0 185 105 18 root node : - 0 - - 0 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 0 0 0 0 0 0 0 varbound : 2 0 600 0 0 0 0 0 0 0 setppc : 16 0 600 0 0 2 0 0 0 0 linear : 975 0 598 0 0 17 0 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 varbound : 0.00 0.00 0.00 0.00 0.00 setppc : 0.01 0.00 0.01 0.00 0.00 linear : 0.01 0.00 0.01 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 2 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 0 0 0 0 0 impliedbounds : 0.00 0 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 0 0 0 0 0 strongcg : 0.00 0 0 0 0 0 cmir : 0.00 0 0 0 0 0 flowcover : 0.00 0 0 0 0 0 clique : 0.00 0 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 - 0 pseudo solutions : 0.00 - 0 simplerounding : 0.00 0 0 rounding : 0.00 1 0 shifting : 0.00 1 0 intshifting : 0.00 0 0 oneopt : 0.00 0 0 fixandinfer : 0.00 0 0 feaspump : 0.04 1 1 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.28 2 2213 1106.50 7903.57 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.04 2 125 62.50 3125.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 : 1 (1 improvements) Primal Bound : -3.06769012030068e+02 (in run 1, after 1 nodes, 0.46 seconds, depth 0, found by ) Dual Bound : -3.06769012030068e+02 Gap : 0.00 % Root Dual Bound : -3.06769012030068e+02 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- dsbmip.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job dsbmip.gms Stop 10/01/08 16:24:10 elapsed 0:00:01.252