--- Job modglob Start 10/01/08 23:26:18 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 --- modglob.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/modglob.gdx --- modglob.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.057 --- modglob.gms(123) 4 Mb --- Generating MIP model m --- modglob.gms(124) 4 Mb --- 292 rows 423 columns 1,391 non-zeroes --- 98 discrete-columns --- modglob.gms(124) 4 Mb --- Executing SCIP: elapsed 0:00:00.067 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) 35 del vars, 4 del conss, 322 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 35 del vars, 4 del conss, 322 chg bounds, 31 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 3) 38 del vars, 5 del conss, 322 chg bounds, 32 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 4) 38 del vars, 5 del conss, 322 chg bounds, 32 chg sides, 0 chg coeffs, 196 upgd conss, 0 impls, 0 clqs presolving (5 rounds): 38 deleted vars, 5 deleted constraints, 322 tightened bounds, 0 added holes, 32 changed sides, 0 changed coefficients 196 implications, 0 cliques presolved problem has 384 variables (98 bin, 0 int, 0 impl, 286 cont) and 286 constraints 196 constraints of type 90 constraints of type Presolving Time: 0.04 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 174 |1011k| 0 | 2.043095e+07 | -- | Inf r 1 | 0 | 174 |1018k| 0 | 2.043095e+07 | 2.078679e+07 | 1.74% 1 | 0 | 207 |1111k| 0 | 2.045838e+07 | 2.078679e+07 | 1.61% 1 | 0 | 250 |1166k| 0 | 2.051257e+07 | 2.078679e+07 | 1.34% 1 | 0 | 311 |1222k| 0 | 2.056009e+07 | 2.078679e+07 | 1.10% 1 | 0 | 358 |1267k| 0 | 2.058631e+07 | 2.078679e+07 | 0.97% 1 | 0 | 405 |1321k| 0 | 2.063197e+07 | 2.078679e+07 | 0.75% 1 | 0 | 449 |1373k| 0 | 2.067210e+07 | 2.078679e+07 | 0.55% 1 | 0 | 483 |1425k| 0 | 2.069617e+07 | 2.078679e+07 | 0.44% 1 | 0 | 528 |1475k| 0 | 2.071159e+07 | 2.078679e+07 | 0.36% 1 | 0 | 560 |1528k| 0 | 2.071494e+07 | 2.078679e+07 | 0.35% 1 | 0 | 583 |1572k| 0 | 2.072120e+07 | 2.078679e+07 | 0.32% 1 | 0 | 599 |1579k| 0 | 2.072259e+07 | 2.078679e+07 | 0.31% 1 | 0 | 603 |1584k| 0 | 2.072260e+07 | 2.078679e+07 | 0.31% 1 | 0 | 610 |1590k| 0 | 2.072260e+07 | 2.078679e+07 | 0.31% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap E 1 | 0 | 693 |1602k| 0 | 2.072260e+07 | 2.074051e+07 | 0.09% 1 | 0 | 693 |1602k| 0 | 2.072260e+07 | 2.074051e+07 | 0.09% 1 | 0 | 713 |1599k| 0 | 2.074051e+07 | 2.074051e+07 | 0.00% 1 | 0 | 713 |1599k| 0 | 2.074051e+07 | 2.074051e+07 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.73 Solving Nodes : 1 Primal Bound : +2.07405080863086e+07 (15 solutions) Dual Bound : +2.07405080863086e+07 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.73 Original Problem : Problem name : gamsmodel Variables : 422 (98 binary, 0 integer, 0 implicit integer, 324 continuous) Constraints : 291 initial, 291 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 384 (98 binary, 0 integer, 0 implicit integer, 286 continuous) Constraints : 286 initial, 286 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 3 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.02 0 0 0 0 0 0 0 0 varbound : 0.00 0 0 0 0 0 0 0 0 linear : 0.01 2 33 0 322 0 5 32 0 root node : - 5 - - 5 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 1 0 0 5 0 0 0 varbound : 196 15 198 0 0 0 0 0 0 0 linear : 90 15 198 0 0 0 0 0 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.04 0.00 0.00 0.04 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 linear : 0.01 0.01 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 17 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 14 - - 294 - (maximal pool size: 853) redcost : 0.00 15 0 0 0 0 impliedbounds : 0.00 15 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 15 0 0 4 0 strongcg : 0.02 15 0 0 0 0 cmir : 0.17 10 0 0 788 0 flowcover : 0.21 10 0 0 235 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 relpscost : 0.04 1 0 5 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 15 14 rounding : 0.00 15 0 shifting : 0.00 15 0 intshifting : 0.00 1 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.16 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.01 0 0 0.00 - dual LP : 0.07 15 630 42.00 9000.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.00 1 83 83.00 - strong branching : 0.04 26 485 18.65 12125.00 (at root node) : - 26 485 18.65 - 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 : 15 (2 improvements) Primal Bound : +2.07405080863086e+07 (in run 1, after 1 nodes, 0.68 seconds, depth 0, found by ) Dual Bound : +2.07405080863086e+07 Gap : 0.00 % Root Dual Bound : +2.07405080863086e+07 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- modglob.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job modglob.gms Stop 10/01/08 23:26:19 elapsed 0:00:00.891