--- Job ran10x10a Start 10/03/08 04:05:04 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 --- ran10x10a.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x10a.gdx --- ran10x10a.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.020 --- ran10x10a.gms(123) 4 Mb --- Generating MIP model m --- ran10x10a.gms(124) 4 Mb --- 121 rows 201 columns 601 non-zeroes --- 100 discrete-columns --- Executing SCIP: elapsed 0:00:00.025 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, 100 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 0 del vars, 0 del conss, 100 chg bounds, 0 chg sides, 0 chg coeffs, 100 upgd conss, 0 impls, 0 clqs presolving (3 rounds): 0 deleted vars, 0 deleted constraints, 100 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 100 implications, 0 cliques presolved problem has 200 variables (100 bin, 0 int, 0 impl, 100 cont) and 120 constraints 100 constraints of type 20 constraints of type Presolving Time: 0.00 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 131 | 524k| 0 | 1.252742e+03 | -- | Inf r 1 | 0 | 131 | 528k| 0 | 1.252742e+03 | 1.736000e+03 | 38.58% 1 | 0 | 158 | 616k| 0 | 1.362430e+03 | 1.736000e+03 | 27.42% 1 | 0 | 186 | 679k| 0 | 1.401852e+03 | 1.736000e+03 | 23.84% 1 | 0 | 215 | 708k| 0 | 1.426638e+03 | 1.736000e+03 | 21.68% 1 | 0 | 261 | 751k| 0 | 1.441272e+03 | 1.736000e+03 | 20.45% 1 | 0 | 304 | 778k| 0 | 1.454667e+03 | 1.736000e+03 | 19.34% 1 | 0 | 323 | 804k| 0 | 1.456196e+03 | 1.736000e+03 | 19.21% 1 | 0 | 352 | 827k| 0 | 1.458345e+03 | 1.736000e+03 | 19.04% 1 | 0 | 380 | 847k| 0 | 1.460721e+03 | 1.736000e+03 | 18.85% 1 | 0 | 404 | 870k| 0 | 1.462429e+03 | 1.736000e+03 | 18.71% 1 | 0 | 438 | 885k| 0 | 1.463947e+03 | 1.736000e+03 | 18.58% 1 | 0 | 462 | 888k| 0 | 1.464729e+03 | 1.736000e+03 | 18.52% 1 | 0 | 494 | 891k| 0 | 1.465677e+03 | 1.736000e+03 | 18.44% 1 | 0 | 508 | 894k| 0 | 1.465847e+03 | 1.736000e+03 | 18.43% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap E 1 | 0 | 655 | 901k| 0 | 1.465847e+03 | 1.499000e+03 | 2.26% 1 | 0 | 655 | 901k| 0 | 1.465847e+03 | 1.499000e+03 | 2.26% 1 | 0 | 655 | 885k| 0 | 1.465847e+03 | 1.499000e+03 | 2.26% 1 | 2 | 655 | 886k| 0 | 1.465847e+03 | 1.499000e+03 | 2.26% (run 1, node 1) restarting after 37 global fixings of integer variables (restart) converted 41 cuts from the global cut pool into linear constraints presolving: (round 1) 74 del vars, 1 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 100 impls, 0 clqs (round 2) 74 del vars, 1 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 17 upgd conss, 100 impls, 0 clqs presolving (3 rounds): 74 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients 100 implications, 0 cliques presolved problem has 126 variables (63 bin, 0 int, 0 impl, 63 cont) and 123 constraints 63 constraints of type 2 constraints of type 43 constraints of type 15 constraints of type Presolving Time: 0.00 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 816 | 631k| 0 | 1.465847e+03 | 1.499000e+03 | 2.26% 1 | 0 | 835 | 643k| 0 | 1.466859e+03 | 1.499000e+03 | 2.19% 1 | 2 | 835 | 646k| 0 | 1.466859e+03 | 1.499000e+03 | 2.19% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 1.02 Solving Nodes : 3 (total of 4 nodes in 2 runs) Primal Bound : +1.49900000000000e+03 (22 solutions) Dual Bound : +1.49900000000000e+03 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 1.02 Original Problem : Problem name : gamsmodel Variables : 200 (100 binary, 0 integer, 0 implicit integer, 100 continuous) Constraints : 120 initial, 120 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 126 (63 binary, 0 integer, 0 implicit integer, 63 continuous) Constraints : 123 initial, 123 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 74 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 knapsack : 0.00 0 0 0 0 0 0 0 0 linear : 0.00 0 0 0 100 0 1 1 0 logicor : 0.00 0 0 0 0 0 0 0 0 root node : - 64 - - 125 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 7 0 2 15 0 0 4 varbound : 63 16 223 0 0 0 77 0 0 0 knapsack : 2 1 20 0 0 0 0 0 0 0 linear : 43 16 223 0 0 0 0 15 0 0 logicor : 15 1 9 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.21 0.00 0.00 0.21 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 knapsack : 0.00 0.00 0.00 0.00 0.00 linear : 0.00 0.00 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 43 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: 14) redcost : 0.00 23 0 64 0 0 impliedbounds : 0.00 16 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.03 16 0 0 36 0 strongcg : 0.03 16 0 0 1 0 cmir : 0.34 11 0 0 223 0 flowcover : 0.08 11 0 0 99 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 relpscost : 0.21 7 2 15 0 0 4 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 coefdiving : 0.00 0 0 oneopt : 0.00 1 0 simplerounding : 0.00 22 21 rounding : 0.00 22 0 shifting : 0.02 17 0 intshifting : 0.01 1 0 fixandinfer : 0.00 0 0 feaspump : 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.20 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.00 0 0 0.00 - dual LP : 0.09 21 874 41.62 9711.11 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.01 1 147 147.00 - strong branching : 0.21 80 4699 58.74 22376.19 (at root node) : - 41 3133 76.41 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 2 nodes : 3 nodes (total) : 4 nodes left : 0 max depth : 1 max depth (total): 1 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 : 22 (2 improvements) Primal Bound : +1.49900000000000e+03 (in run 1, after 1 nodes, 0.73 seconds, depth 0, found by ) Dual Bound : +1.49900000000000e+03 Gap : 0.00 % Root Dual Bound : +1.46685878831636e+03 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- ran10x10a.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x10a.gms Stop 10/03/08 04:05:05 elapsed 0:00:01.101