--- Job gen Start 10/01/08 17:24:36 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 --- gen.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/gen.gdx --- gen.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.043 --- gen.gms(123) 4 Mb --- Generating MIP model m --- gen.gms(124) 4 Mb --- 781 rows 871 columns 3,175 non-zeroes --- 150 discrete-columns --- gen.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.070 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) 220 del vars, 281 del conss, 676 chg bounds, 0 chg sides, 3 chg coeffs, 0 upgd conss, 2 impls, 0 clqs (round 2) 232 del vars, 281 del conss, 691 chg bounds, 0 chg sides, 3 chg coeffs, 0 upgd conss, 2 impls, 0 clqs (round 3) 232 del vars, 281 del conss, 703 chg bounds, 0 chg sides, 3 chg coeffs, 0 upgd conss, 2 impls, 0 clqs (round 4) 232 del vars, 281 del conss, 703 chg bounds, 0 chg sides, 3 chg coeffs, 336 upgd conss, 2 impls, 0 clqs (round 5) 232 del vars, 281 del conss, 703 chg bounds, 6 chg sides, 29 chg coeffs, 336 upgd conss, 342 impls, 6 clqs (round 6) 232 del vars, 286 del conss, 703 chg bounds, 6 chg sides, 29 chg coeffs, 336 upgd conss, 342 impls, 6 clqs presolving (7 rounds): 232 deleted vars, 286 deleted constraints, 703 tightened bounds, 0 added holes, 6 changed sides, 29 changed coefficients 1441 implications, 6 cliques presolved problem has 638 variables (108 bin, 0 int, 0 impl, 530 cont) and 500 constraints 324 constraints of type 6 constraints of type 6 constraints of type 163 constraints of type 1 constraints of type Presolving Time: 0.06 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 117 |2052k| 0 | 1.122739e+05 | -- | Inf s 1 | 0 | 117 |2067k| 0 | 1.122739e+05 | 1.133659e+05 | 0.97% 1 | 0 | 145 |2122k| 0 | 1.122795e+05 | 1.133659e+05 | 0.97% s 1 | 0 | 145 |2141k| 0 | 1.122795e+05 | 1.132146e+05 | 0.83% 1 | 0 | 189 |2161k| 0 | 1.123047e+05 | 1.132146e+05 | 0.81% s 1 | 0 | 189 |2172k| 0 | 1.123047e+05 | 1.128896e+05 | 0.52% 1 | 0 | 203 |2189k| 0 | 1.123127e+05 | 1.128896e+05 | 0.51% 1 | 0 | 210 |2204k| 0 | 1.123133e+05 | 1.128896e+05 | 0.51% s 1 | 0 | 210 |2216k| 0 | 1.123133e+05 | 1.128198e+05 | 0.45% 1 | 0 | 213 |2232k| 0 | 1.123134e+05 | 1.128198e+05 | 0.45% 1 | 0 | 214 |2248k| 0 | 1.123134e+05 | 1.128198e+05 | 0.45% * 1 | 0 | 214 |2259k| 0 | 1.123134e+05 | 1.123134e+05 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.24 Solving Nodes : 1 Primal Bound : +1.12313362718000e+05 (6 solutions) Dual Bound : +1.12313362718000e+05 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.24 Original Problem : Problem name : gamsmodel Variables : 870 (144 binary, 6 integer, 0 implicit integer, 720 continuous) Constraints : 780 initial, 780 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 638 (108 binary, 0 integer, 0 implicit integer, 530 continuous) Constraints : 500 initial, 500 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 12 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.03 0 0 0 0 0 0 0 0 varbound : 0.00 0 0 0 0 0 0 0 0 knapsack : 0.00 0 0 0 0 0 5 6 26 setppc : 0.00 0 0 0 0 0 0 0 0 linear : 0.03 61 159 0 703 0 281 0 3 logicor : 0.00 0 0 0 0 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 : 324 7 344 1 0 0 0 0 0 0 knapsack : 6 7 344 1 0 0 0 14 0 0 setppc : 6 7 344 1 0 0 0 0 0 0 linear : 163 7 344 1 0 0 0 0 0 0 logicor : 1 7 7 1 0 0 0 0 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.01 0.00 0.01 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.01 0.01 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 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 6 - - 17 - (maximal pool size: 140) redcost : 0.00 7 0 0 0 0 impliedbounds : 0.00 6 0 0 3 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 7 0 0 19 0 strongcg : 0.00 7 0 0 0 0 cmir : 0.06 7 0 0 76 0 flowcover : 0.07 7 0 0 76 0 clique : 0.00 7 0 0 1 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 0 0 rounding : 0.00 6 0 shifting : 0.01 6 5 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.03 7 214 30.57 7133.33 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 (5 improvements) Primal Bound : +1.12313362718000e+05 (in run 1, after 1 nodes, 0.24 seconds, depth 0, found by ) Dual Bound : +1.12313362718000e+05 Gap : 0.00 % Root Dual Bound : +1.12313362718000e+05 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- gen.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job gen.gms Stop 10/01/08 17:24:37 elapsed 0:00:00.394