--- Job ran10x10c Start 10/03/08 04:05:06 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 --- ran10x10c.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x10c.gdx --- ran10x10c.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.014 --- ran10x10c.gms(123) 4 Mb --- Generating MIP model m --- ran10x10c.gms(124) 4 Mb --- 121 rows 201 columns 601 non-zeroes --- 100 discrete-columns --- Executing SCIP: elapsed 0:00:00.019 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 | 142 | 524k| 0 | 1.120309e+04 | -- | Inf r 1 | 0 | 142 | 528k| 0 | 1.120309e+04 | 1.649000e+04 | 47.19% 1 | 0 | 175 | 619k| 0 | 1.165544e+04 | 1.649000e+04 | 41.48% 1 | 0 | 210 | 665k| 0 | 1.213098e+04 | 1.649000e+04 | 35.93% 1 | 0 | 249 | 702k| 0 | 1.227305e+04 | 1.649000e+04 | 34.36% 1 | 0 | 296 | 730k| 0 | 1.239546e+04 | 1.649000e+04 | 33.03% 1 | 0 | 322 | 746k| 0 | 1.241068e+04 | 1.649000e+04 | 32.87% 1 | 0 | 352 | 761k| 0 | 1.243048e+04 | 1.649000e+04 | 32.66% 1 | 0 | 374 | 773k| 0 | 1.243576e+04 | 1.649000e+04 | 32.60% 1 | 0 | 408 | 784k| 0 | 1.244330e+04 | 1.649000e+04 | 32.52% 1 | 0 | 453 | 793k| 0 | 1.244892e+04 | 1.649000e+04 | 32.46% 1 | 0 | 491 | 803k| 0 | 1.245171e+04 | 1.649000e+04 | 32.43% 1 | 0 | 525 | 807k| 0 | 1.245549e+04 | 1.649000e+04 | 32.39% 1 | 0 | 545 | 810k| 0 | 1.245648e+04 | 1.649000e+04 | 32.38% E 1 | 0 | 682 | 816k| 0 | 1.245648e+04 | 1.300700e+04 | 4.42% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 682 | 816k| 0 | 1.245648e+04 | 1.300700e+04 | 4.42% 1 | 2 | 682 | 816k| 0 | 1.245648e+04 | 1.300700e+04 | 4.42% 100 | 53 | 3098 |1079k| 26 | 1.255285e+04 | 1.300700e+04 | 3.62% 200 | 69 | 5634 |1109k| 26 | 1.258782e+04 | 1.300700e+04 | 3.33% 300 | 93 | 7430 |1133k| 26 | 1.263275e+04 | 1.300700e+04 | 2.96% 400 | 99 | 9597 |1150k| 26 | 1.265329e+04 | 1.300700e+04 | 2.80% 500 | 91 | 11829 |1156k| 26 | 1.268803e+04 | 1.300700e+04 | 2.51% 600 | 85 | 13820 |1161k| 26 | 1.275660e+04 | 1.300700e+04 | 1.96% 700 | 59 | 15794 |1144k| 26 | 1.278717e+04 | 1.300700e+04 | 1.72% 800 | 53 | 17624 |1136k| 26 | 1.281363e+04 | 1.300700e+04 | 1.51% 900 | 15 | 19572 |1090k| 26 | 1.289658e+04 | 1.300700e+04 | 0.86% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 4.15 Solving Nodes : 917 Primal Bound : +1.30070000000000e+04 (332 solutions) Dual Bound : +1.30070000000000e+04 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 4.15 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 : 200 (100 binary, 0 integer, 0 implicit integer, 100 continuous) Constraints : 120 initial, 121 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 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 linear : 0.01 0 0 0 100 0 0 0 0 logicor : 0.00 0 0 0 0 0 0 0 0 root node : - 2 - - 4 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 686 0 32 283 0 0 916 varbound : 100 14 3002 0 0 0 2868 0 0 0 linear : 20 14 3002 0 0 1 409 36 0 0 logicor : 0+ 0 80 0 0 0 1 0 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 1.75 0.00 0.00 1.75 0.00 varbound : 0.01 0.00 0.01 0.00 0.00 linear : 0.01 0.00 0.01 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.02 2848 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 1 1 2 15.0 0 0.0 - infeasible LP : 0.00 1 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 : - - - 1 14.0 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 13 - - 51 - (maximal pool size: 255) redcost : 0.00 1062 0 2101 0 0 impliedbounds : 0.00 14 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.04 14 0 0 26 0 strongcg : 0.01 14 0 0 2 0 cmir : 0.24 10 0 0 190 0 flowcover : 0.04 10 0 0 135 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 : 1.75 686 32 283 0 0 916 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 feaspump : 0.00 0 0 oneopt : 0.00 1 0 objpscostdiving : 0.04 1 30 rootsoldiving : 0.00 1 0 coefdiving : 0.02 2 1 pscostdiving : 0.00 2 9 fracdiving : 0.00 2 0 veclendiving : 0.00 2 0 linesearchdiving : 0.01 2 1 guideddiving : 0.01 2 0 crossover : 0.05 2 2 simplerounding : 0.00 701 287 rounding : 0.01 313 0 shifting : 0.02 96 1 intshifting : 0.01 2 0 fixandinfer : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.55 1 1 rins : 0.00 0 0 localbranching : 0.00 0 0 mutation : 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 : 1.25 1126 18843 16.73 15074.40 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.08 95 1314 13.83 16425.00 strong branching : 1.74 938 35522 37.87 20414.94 (at root node) : - 42 3972 94.57 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 917 nodes (total) : 917 nodes left : 0 max depth : 26 max depth (total): 26 backtracks : 255 (27.8%) delayed cutoffs : 0 repropagations : 1 (1 domain reductions, 0 cutoffs) avg switch length: 5.87 switching time : 0.00 Solution : Solutions found : 332 (2 improvements) Primal Bound : +1.30070000000000e+04 (in run 1, after 1 nodes, 0.93 seconds, depth 0, found by ) Dual Bound : +1.30070000000000e+04 Gap : 0.00 % Root Dual Bound : +1.24564818761438e+04 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- ran10x10c.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x10c.gms Stop 10/03/08 04:05:10 elapsed 0:00:04.306