--- Job rentacar Start 10/03/08 05:36:37 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 --- rentacar.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/rentacar.gdx --- rentacar.gms(148) 6 Mb --- Starting execution: elapsed 0:00:00.118 --- rentacar.gms(123) 6 Mb --- Generating MIP model m --- rentacar.gms(124) 8 Mb --- 6,785 rows 9,559 columns 42,021 non-zeroes --- 55 discrete-columns --- rentacar.gms(124) 8 Mb --- Executing SCIP: elapsed 0:00:00.283 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) 6220 del vars, 5296 del conss, 7149 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2) 6388 del vars, 5384 del conss, 8709 chg bounds, 55 chg sides, 5 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 3) 6409 del vars, 5404 del conss, 9264 chg bounds, 55 chg sides, 10 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 4) 6436 del vars, 5430 del conss, 9397 chg bounds, 56 chg sides, 13 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 5) 6452 del vars, 5445 del conss, 9457 chg bounds, 56 chg sides, 17 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 6) 6454 del vars, 5446 del conss, 9470 chg bounds, 56 chg sides, 17 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 7) 6454 del vars, 5446 del conss, 9487 chg bounds, 56 chg sides, 17 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 8) 6454 del vars, 5446 del conss, 9500 chg bounds, 56 chg sides, 17 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 9) 6454 del vars, 5446 del conss, 9513 chg bounds, 56 chg sides, 17 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 10) 6454 del vars, 5446 del conss, 9526 chg bounds, 56 chg sides, 17 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 11) 6454 del vars, 5446 del conss, 9539 chg bounds, 56 chg sides, 17 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 12) 6454 del vars, 5446 del conss, 9552 chg bounds, 56 chg sides, 17 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 13) 6454 del vars, 5446 del conss, 9565 chg bounds, 56 chg sides, 17 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 14) 6460 del vars, 5446 del conss, 9588 chg bounds, 56 chg sides, 17 chg coeffs, 0 upgd conss, 3433 impls, 0 clqs (round 15) 6463 del vars, 5456 del conss, 9588 chg bounds, 56 chg sides, 18 chg coeffs, 0 upgd conss, 3433 impls, 0 clqs (round 16) 6463 del vars, 5456 del conss, 9588 chg bounds, 57 chg sides, 18 chg coeffs, 0 upgd conss, 3433 impls, 0 clqs (round 17) 6463 del vars, 5462 del conss, 9694 chg bounds, 57 chg sides, 18 chg coeffs, 0 upgd conss, 3433 impls, 0 clqs (round 18) 6464 del vars, 5463 del conss, 9694 chg bounds, 58 chg sides, 18 chg coeffs, 0 upgd conss, 3433 impls, 0 clqs (round 19) 6465 del vars, 5463 del conss, 9696 chg bounds, 58 chg sides, 18 chg coeffs, 0 upgd conss, 3433 impls, 0 clqs (round 20) 6466 del vars, 5465 del conss, 9696 chg bounds, 59 chg sides, 18 chg coeffs, 0 upgd conss, 3433 impls, 0 clqs (round 21) 6467 del vars, 5465 del conss, 9698 chg bounds, 59 chg sides, 18 chg coeffs, 0 upgd conss, 3433 impls, 0 clqs (round 22) 6468 del vars, 5466 del conss, 9702 chg bounds, 60 chg sides, 18 chg coeffs, 0 upgd conss, 3433 impls, 0 clqs (round 23) 6469 del vars, 5466 del conss, 9702 chg bounds, 60 chg sides, 18 chg coeffs, 22 upgd conss, 3433 impls, 0 clqs (round 24) 6469 del vars, 5466 del conss, 9702 chg bounds, 60 chg sides, 18 chg coeffs, 44 upgd conss, 3433 impls, 0 clqs presolving (25 rounds): 6469 deleted vars, 5466 deleted constraints, 9702 tightened bounds, 0 added holes, 60 changed sides, 18 changed coefficients 3433 implications, 0 cliques presolved problem has 3089 variables (24 bin, 0 int, 0 impl, 3065 cont) and 1318 constraints 44 constraints of type 1274 constraints of type Presolving Time: 0.25 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1517 | 17M| 0 | 2.827171e+07 | -- | Inf 1 | 0 | 1758 | 17M| 0 | 2.852725e+07 | -- | Inf 1 | 0 | 1795 | 17M| 0 | 2.859898e+07 | -- | Inf 1 | 0 | 1831 | 17M| 0 | 2.866458e+07 | -- | Inf 1 | 0 | 1897 | 17M| 0 | 2.875600e+07 | -- | Inf 1 | 0 | 1904 | 17M| 0 | 2.878274e+07 | -- | Inf 1 | 0 | 1908 | 17M| 0 | 2.878325e+07 | -- | Inf 1 | 0 | 1922 | 17M| 0 | 2.881590e+07 | -- | Inf 1 | 0 | 1928 | 17M| 0 | 2.882009e+07 | -- | Inf 1 | 0 | 1929 | 17M| 0 | 2.882060e+07 | -- | Inf 1 | 0 | 1974 | 17M| 0 | 2.883770e+07 | -- | Inf 1 | 0 | 1978 | 17M| 0 | 2.883810e+07 | -- | Inf 1 | 0 | 1979 | 17M| 0 | 2.883833e+07 | -- | Inf 1 | 2 | 4162 | 17M| 0 | 2.883833e+07 | -- | Inf c 6 | 7 | 5592 | 17M| 5 | 2.888247e+07 | 3.828187e+07 | 32.54% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap * 15 | 3 | 5720 | 17M| 9 | 2.888247e+07 | 3.007568e+07 | 4.13% * 17 | 0 | 5726 | 17M| 9 | 2.888247e+07 | 2.888247e+07 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 4.82 Solving Nodes : 17 Primal Bound : +2.88824709475526e+07 (3 solutions) Dual Bound : +2.88824709475526e+07 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 4.82 Original Problem : Problem name : gamsmodel Variables : 9558 (55 binary, 0 integer, 0 implicit integer, 9503 continuous) Constraints : 6784 initial, 6784 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 3089 (24 binary, 0 integer, 0 implicit integer, 3065 continuous) Constraints : 1318 initial, 1318 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 650 0 0 0 0 0 0 0 dualfix : 0.00 94 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.04 6 0 0 12 0 0 0 0 varbound : 0.00 0 0 0 0 0 0 0 0 linear : 0.17 3387 2332 0 9690 0 5466 60 18 root node : - 0 - - 7084 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 18 0 0 2 0 0 30 varbound : 44 13 181 2 0 0 22 0 0 0 linear : 1274 13 430 2 0 3 10852 0 0 0 countsols : 0 0 0 2 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 1.81 0.00 0.00 1.81 0.00 varbound : 0.00 0.00 0.00 0.00 0.00 linear : 0.06 0.01 0.05 0.00 0.00 countsols : 0.00 0.00 0.00 0.00 0.00 Propagators : Time Calls Cutoffs DomReds rootredcost : 0.02 2 0 2454 pseudoobj : 0.02 194 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 12 - - 161 - (maximal pool size: 161) redcost : 0.00 30 0 0 0 0 impliedbounds : 0.00 13 0 0 126 0 intobj : 0.00 0 0 0 0 0 gomory : 0.01 13 0 0 0 0 strongcg : 0.02 13 0 0 0 0 cmir : 0.17 10 0 0 75 0 flowcover : 0.57 10 0 0 86 0 clique : 0.00 13 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.81 16 0 2 0 0 30 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 - 2 pseudo solutions : 0.00 - 0 pscostdiving : 0.00 0 0 fracdiving : 0.00 0 0 veclendiving : 0.00 0 0 objpscostdiving : 0.00 0 0 rootsoldiving : 0.00 0 0 linesearchdiving : 0.00 0 0 guideddiving : 0.00 0 0 coefdiving : 0.13 1 1 simplerounding : 0.00 0 0 rounding : 0.00 28 0 shifting : 0.02 13 0 intshifting : 0.65 1 0 oneopt : 0.01 2 0 fixandinfer : 0.00 0 0 feaspump : 0.12 1 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.04 1 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.07 0 0 0.00 0.00 dual LP : 0.83 30 2960 98.67 3566.27 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.88 23 2766 120.26 3143.18 strong branching : 1.81 65 5774 88.83 3190.06 (at root node) : - 8 880 110.00 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 17 nodes (total) : 17 nodes left : 0 max depth : 9 max depth (total): 9 backtracks : 2 (11.8%) delayed cutoffs : 0 repropagations : 8 (4679 domain reductions, 0 cutoffs) avg switch length: 2.71 switching time : 0.07 Solution : Solutions found : 3 (3 improvements) Primal Bound : +2.88824709475526e+07 (in run 1, after 17 nodes, 4.82 seconds, depth 6, found by ) Dual Bound : +2.88824709475526e+07 Gap : 0.00 % Root Dual Bound : +2.88383329928741e+07 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- rentacar.gms(124) 0 Mb --- Reading solution for model m --- rentacar.gms(124) 6 Mb *** Status: Normal completion --- Job rentacar.gms Stop 10/03/08 05:36:44 elapsed 0:00:06.285