--- Job ran10x10b Start 10/03/08 04:05:05 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 --- ran10x10b.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x10b.gdx --- ran10x10b.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- ran10x10b.gms(123) 4 Mb --- Generating MIP model m --- ran10x10b.gms(124) 4 Mb --- 121 rows 201 columns 601 non-zeroes --- 100 discrete-columns --- Executing SCIP: elapsed 0:00:00.011 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.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 126 | 524k| 0 | 2.613469e+03 | -- | Inf r 1 | 0 | 126 | 528k| 0 | 2.613469e+03 | 3.232000e+03 | 23.67% 1 | 0 | 140 | 607k| 0 | 2.776131e+03 | 3.232000e+03 | 16.42% 1 | 0 | 164 | 634k| 0 | 2.895557e+03 | 3.232000e+03 | 11.62% 1 | 0 | 187 | 650k| 0 | 2.913255e+03 | 3.232000e+03 | 10.94% 1 | 0 | 226 | 674k| 0 | 2.946513e+03 | 3.232000e+03 | 9.69% 1 | 0 | 251 | 704k| 0 | 2.955817e+03 | 3.232000e+03 | 9.34% 1 | 0 | 284 | 728k| 0 | 2.978174e+03 | 3.232000e+03 | 8.52% 1 | 0 | 312 | 744k| 0 | 2.994471e+03 | 3.232000e+03 | 7.93% 1 | 0 | 327 | 756k| 0 | 2.997920e+03 | 3.232000e+03 | 7.81% 1 | 0 | 349 | 769k| 0 | 3.000168e+03 | 3.232000e+03 | 7.73% 1 | 0 | 353 | 788k| 0 | 3.000936e+03 | 3.232000e+03 | 7.70% 1 | 0 | 355 | 791k| 0 | 3.001050e+03 | 3.232000e+03 | 7.70% E 1 | 0 | 355 | 797k| 0 | 3.001050e+03 | 3.073000e+03 | 2.40% 1 | 0 | 355 | 797k| 0 | 3.001050e+03 | 3.073000e+03 | 2.40% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 355 | 785k| 0 | 3.001050e+03 | 3.073000e+03 | 2.40% 1 | 2 | 355 | 785k| 0 | 3.001050e+03 | 3.073000e+03 | 2.40% (run 1, node 1) restarting after 35 global fixings of integer variables (restart) converted 36 cuts from the global cut pool into linear constraints presolving: (round 1) 71 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 103 impls, 0 clqs (round 2) 71 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 20 upgd conss, 103 impls, 0 clqs presolving (3 rounds): 71 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 103 implications, 0 cliques presolved problem has 129 variables (65 bin, 0 int, 0 impl, 64 cont) and 120 constraints 65 constraints of type 4 constraints of type 35 constraints of type 16 constraints of type Presolving Time: 0.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 493 | 620k| 0 | 3.001050e+03 | 3.073000e+03 | 2.40% 1 | 0 | 503 | 627k| 0 | 3.001421e+03 | 3.073000e+03 | 2.38% 1 | 0 | 509 | 629k| 0 | 3.002257e+03 | 3.073000e+03 | 2.36% 1 | 0 | 525 | 633k| 0 | 3.003054e+03 | 3.073000e+03 | 2.33% 1 | 2 | 525 | 636k| 0 | 3.003054e+03 | 3.073000e+03 | 2.33% (run 2, node 1) restarting after 10 global fixings of integer variables (restart) converted 2 cuts from the global cut pool into linear constraints presolving: (round 1) 20 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 103 impls, 0 clqs (round 2) 20 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 1 upgd conss, 103 impls, 0 clqs presolving (3 rounds): 20 deleted vars, 3 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients 103 implications, 0 cliques presolved problem has 109 variables (55 bin, 0 int, 0 impl, 54 cont) and 109 constraints 55 constraints of type 4 constraints of type 35 constraints of type 15 constraints of type Presolving Time: 0.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 658 | 618k| 0 | 3.003054e+03 | 3.073000e+03 | 2.33% 1 | 0 | 675 | 624k| 0 | 3.007178e+03 | 3.073000e+03 | 2.19% 1 | 0 | 682 | 626k| 0 | 3.007983e+03 | 3.073000e+03 | 2.16% 1 | 0 | 696 | 627k| 0 | 3.009847e+03 | 3.073000e+03 | 2.10% 1 | 0 | 713 | 629k| 0 | 3.013127e+03 | 3.073000e+03 | 1.99% 1 | 2 | 713 | 631k| 0 | 3.013127e+03 | 3.073000e+03 | 1.99% (run 3, node 1) restarting after 11 global fixings of integer variables (restart) converted 1 cuts from the global cut pool into linear constraints presolving: (round 1) 22 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 107 impls, 0 clqs presolving (2 rounds): 22 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 107 implications, 0 cliques presolved problem has 87 variables (44 bin, 0 int, 0 impl, 43 cont) and 97 constraints 44 constraints of type 4 constraints of type 35 constraints of type 14 constraints of type Presolving Time: 0.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 811 | 614k| 0 | 3.013127e+03 | 3.073000e+03 | 1.99% 1 | 0 | 813 | 620k| 0 | 3.013446e+03 | 3.073000e+03 | 1.98% 1 | 0 | 813 | 622k| 0 | 3.013446e+03 | 3.073000e+03 | 1.98% (run 4, node 1) restarting after 10 global fixings of integer variables (restart) converted 3 cuts from the global cut pool into linear constraints presolving: (round 1) 19 del vars, 10 del conss, 6 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 114 impls, 0 clqs (round 2) 19 del vars, 14 del conss, 6 chg bounds, 0 chg sides, 1 chg coeffs, 1 upgd conss, 114 impls, 0 clqs presolving (3 rounds): 19 deleted vars, 14 deleted constraints, 6 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients 114 implications, 0 cliques presolved problem has 68 variables (34 bin, 0 int, 0 impl, 34 cont) and 82 constraints 35 constraints of type 4 constraints of type 35 constraints of type 8 constraints of type Presolving Time: 0.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 895 | 603k| 0 | 3.030435e+03 | 3.073000e+03 | 1.40% 1 | 0 | 909 | 619k| 0 | 3.044066e+03 | 3.073000e+03 | 0.95% 1 | 0 | 935 | 617k| 0 | 3.062414e+03 | 3.073000e+03 | 0.35% 1 | 0 | 935 | 619k| 0 | 3.073000e+03 | 3.073000e+03 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.62 Solving Nodes : 1 (total of 5 nodes in 5 runs) Primal Bound : +3.07300000000000e+03 (29 solutions) Dual Bound : +3.07300000000000e+03 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.62 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 : 68 (34 binary, 0 integer, 0 implicit integer, 34 continuous) Constraints : 82 initial, 82 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 125 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 3 0 5 0 2 knapsack : 0.00 0 0 0 0 0 0 0 0 linear : 0.01 3 4 0 103 0 5 0 0 logicor : 0.00 0 0 0 0 0 10 0 0 root node : - 73 - - 142 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 11 0 1 23 0 0 6 varbound : 35 17 236 0 0 0 65 0 0 0 knapsack : 4 4 27 0 0 0 0 0 0 0 linear : 35 17 236 0 0 0 6 29 0 0 logicor : 8 4 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.18 0.00 0.00 0.18 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 63 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: 22) redcost : 0.00 17 0 48 0 0 impliedbounds : 0.00 17 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.04 17 0 0 21 0 strongcg : 0.00 17 0 0 0 0 cmir : 0.22 14 0 0 224 0 flowcover : 0.01 14 0 0 130 0 clique : 0.00 5 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.18 11 1 23 0 0 6 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.01 26 26 rounding : 0.00 26 0 shifting : 0.00 26 2 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.08 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.07 26 935 35.96 13357.14 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.00 0 0 0.00 - strong branching : 0.18 114 4285 37.59 23805.56 (at root node) : - 114 4285 37.59 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 5 nodes : 1 nodes (total) : 5 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 : 29 (2 improvements) Primal Bound : +3.07300000000000e+03 (in run 1, after 1 nodes, 0.37 seconds, depth 0, found by ) Dual Bound : +3.07300000000000e+03 Gap : 0.00 % Root Dual Bound : +3.07300000000000e+03 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- ran10x10b.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x10b.gms Stop 10/03/08 04:05:06 elapsed 0:00:00.667