--- Job rentacar Start 08/24/08 06:44:35 GAMS Rev 227 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G071106/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.076 --- 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 Cbc: elapsed 0:00:00.253 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 9558 columns and 6784 rows. 55 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 2.81495e+07 - 0.28 seconds Optimal - objective value 2.81495e+07 10 fixed, 1 tightened bounds, 9 strengthened rows, 0 substitutions 1 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions processed model has 1156 rows, 2927 columns (24 integer) and 18118 elements Pass 1: suminf. 0.36196 (2) obj. 4.82121e+08 iterations 599 Pass 2: suminf. 0.00000 (0) obj. 3.55615e+08 iterations 121 Solution found of 3.55615e+08 Before mini branch and bound, 15 integers at bound fixed and 2186 continuous Full problem 1156 rows 2927 columns, reduced to 443 rows 516 columns Mini branch and bound improved solution from 3.55615e+08 to 2.91354e+07 (0.56 seconds) Freeing continuous variables gives a solution of 2.88825e+07 Round again with cutoff of 2.88214e+07 Pass 3: suminf. 1.30808 (7) obj. 2.88214e+07 iterations 127 Pass 4: suminf. 0.00015 (1) obj. 2.88214e+07 iterations 233 Pass 5: suminf. 0.00015 (1) obj. 2.88214e+07 iterations 0 Pass 6: suminf. 0.91276 (4) obj. 2.88214e+07 iterations 135 Pass 7: suminf. 0.35542 (2) obj. 2.88214e+07 iterations 144 Pass 8: suminf. 0.00016 (1) obj. 2.88214e+07 iterations 5 Pass 9: suminf. 0.00016 (1) obj. 2.88214e+07 iterations 0 Pass 10: suminf. 0.74036 (5) obj. 2.88214e+07 iterations 212 Pass 11: suminf. 0.43417 (3) obj. 2.88214e+07 iterations 93 Pass 12: suminf. 0.14695 (2) obj. 2.88214e+07 iterations 182 Pass 13: suminf. 0.00035 (1) obj. 2.88214e+07 iterations 139 Pass 14: suminf. 0.00035 (1) obj. 2.88214e+07 iterations 0 Pass 15: suminf. 0.08604 (2) obj. 2.88214e+07 iterations 79 Pass 16: suminf. 0.53102 (4) obj. 2.88214e+07 iterations 123 Pass 17: suminf. 0.00038 (1) obj. 2.88214e+07 iterations 64 Pass 18: suminf. 0.00038 (1) obj. 2.88214e+07 iterations 0 Pass 19: suminf. 0.56420 (5) obj. 2.88214e+07 iterations 84 Pass 20: suminf. 0.67449 (4) obj. 2.88214e+07 iterations 143 Pass 21: suminf. 0.10291 (2) obj. 2.88214e+07 iterations 135 Pass 22: suminf. 1.08498 (8) obj. 2.88214e+07 iterations 140 No solution found this major pass Before mini branch and bound, 7 integers at bound fixed and 2322 continuous Mini branch and bound did not improve solution (1.52 seconds) After 1.52 seconds - Feasibility pump exiting with objective of 2.88825e+07 - took 1.51 seconds Integer solution of 2.88825e+07 found by feasibility pump after 0 iterations and 0 nodes (1.52 seconds) Full problem 1156 rows 2927 columns, reduced to 972 rows 2646 columns - too large 49 added rows had average density of 3.89796 At root node, 49 cuts changed objective from 2.82717e+07 to 2.87305e+07 in 5 passes Cut generator 0 (Probing) - 73 row cuts, 0 column cuts (48 active) in 0.012 seconds - new frequency is 1 Cut generator 1 (Gomory) - 2 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 6 row cuts, 0 column cuts (1 active) in 0.004 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.028 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 9 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Optimal - objective value 2.87305e+07 Optimal - objective value 2.87305e+07 After 0 nodes, 1 on tree, 2.88825e+07 best solution, best possible 2.87305e+07 (2.09 seconds) Search completed - best objective 28882470.94755345, took 900 iterations and 6 nodes (2.37 seconds) Strong branching done 16 times (902 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 2, 0 variables fixed on reduced cost Cuts at root node changed objective from 2.82717e+07 to 2.87305e+07 Probing was tried 7 times and created 73 cuts of which 48 were active after adding rounds of cuts (0.020 seconds) Gomory was tried 5 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) Knapsack was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Clique was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 7 times and created 6 cuts of which 1 were active after adding rounds of cuts (0.004 seconds) FlowCover was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) TwoMirCuts was tried 5 times and created 9 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) implication was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts 2168 bounds tightened after postprocessing Result - Finished objective 28882470.94755345 after 6 nodes and 900 iterations - took 3.32 seconds (total time 3.62) Total time 5.83 Solved to optimality. MIP solution: 28882470.95 (6 nodes, 5.83 seconds) Best possible: 28882470.95 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- rentacar.gms(124) 0 Mb --- Reading solution for model m --- rentacar.gms(124) 6 Mb *** Status: Normal completion --- Job rentacar.gms Stop 08/24/08 06:44:41 elapsed 0:00:06.287