--- Job dano3_3 Start 08/24/08 00:23:46 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 --- dano3_3.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/dano3_3.gdx --- dano3_3.gms(148) 6 Mb --- Starting execution: elapsed 0:00:00.102 --- dano3_3.gms(123) 6 Mb --- Generating MIP model m --- dano3_3.gms(124) 10 Mb --- 3,203 rows 13,874 columns 79,657 non-zeroes --- 69 discrete-columns --- dano3_3.gms(124) 10 Mb --- Executing Cbc: elapsed 0:00:00.340 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 13873 columns and 3202 rows. 69 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 576.232 - 31.06 seconds Optimal - objective value 576.232 0 fixed, 63 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 3139 rows, 13825 columns (69 integer) and 80277 elements Pass 1: (0.79 seconds) suminf. 1.00000 (12) obj. 576.762 iterations 792 Pass 2: (0.86 seconds) suminf. 1.00000 (10) obj. 576.76 iterations 26 Pass 3: (1.45 seconds) suminf. 0.71502 (13) obj. 577.46 iterations 523 Pass 4: (2.04 seconds) suminf. 0.00000 (0) obj. 577.905 iterations 579 Solution found of 577.905 Before mini branch and bound, 44 integers at bound fixed and 11973 continuous Full problem 3139 rows 13825 columns, reduced to 1877 rows 1616 columns Mini branch and bound improved solution from 577.905 to 576.503 (8.22 seconds) Freeing continuous variables gives a solution of 576.345 Round again with cutoff of 576.333 Reduced cost fixing fixed 6 variables on major pass 2 Pass 5: (16.58 seconds) suminf. 1.00000 (7) obj. 576.333 iterations 974 Pass 6: (16.65 seconds) suminf. 1.00000 (6) obj. 576.333 iterations 57 Pass 7: (17.65 seconds) suminf. 1.36108 (9) obj. 576.333 iterations 1312 Pass 8: (19.73 seconds) suminf. 0.06162 (4) obj. 576.333 iterations 2869 Pass 9: (20.97 seconds) suminf. 0.83153 (10) obj. 576.333 iterations 1685 Pass 10: (21.22 seconds) suminf. 0.79900 (9) obj. 576.333 iterations 266 Pass 11: (24.66 seconds) suminf. 2.20105 (12) obj. 576.333 iterations 4530 Pass 12: (26.80 seconds) suminf. 0.19379 (7) obj. 576.333 iterations 2692 Pass 13: (29.57 seconds) suminf. 1.32096 (10) obj. 576.333 iterations 3758 Pass 14: (29.80 seconds) suminf. 1.49757 (8) obj. 576.333 iterations 250 Pass 15: (30.98 seconds) suminf. 0.79667 (7) obj. 576.333 iterations 1612 Pass 16: (31.69 seconds) suminf. 0.45508 (10) obj. 576.333 iterations 855 Pass 17: (35.78 seconds) suminf. 1.29027 (10) obj. 576.333 iterations 5706 Pass 18: (36.55 seconds) suminf. 0.92465 (9) obj. 576.333 iterations 984 Pass 19: (40.01 seconds) suminf. 1.08520 (7) obj. 576.333 iterations 4521 Pass 20: (42.11 seconds) suminf. 1.25122 (5) obj. 576.333 iterations 2903 Pass 21: (43.53 seconds) suminf. 0.40125 (11) obj. 576.333 iterations 1759 Pass 22: (47.08 seconds) suminf. 1.75796 (10) obj. 576.333 iterations 4981 Pass 23: (47.79 seconds) suminf. 1.41245 (11) obj. 576.333 iterations 894 Pass 24: (49.98 seconds) suminf. 1.11052 (7) obj. 576.333 iterations 3083 No solution found this major pass Before mini branch and bound, 49 integers at bound fixed and 11820 continuous Full problem 3139 rows 13825 columns, reduced to 1822 rows 1841 columns Mini branch and bound did not improve solution (56.91 seconds) After 56.91 seconds - Feasibility pump exiting with objective of 576.345 - took 56.88 seconds Integer solution of 576.345 found by feasibility pump after 0 iterations and 0 nodes (56.93 seconds) Full problem 3139 rows 13825 columns, reduced to 2881 rows 12244 columns - too large 11 added rows had average density of 2 At root node, 11 cuts changed objective from 576.232 to 576.254 in 5 passes Cut generator 0 (Probing) - 12 row cuts, 1 column cuts (11 active) in 0.072 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts, 0 column cuts (0 active) in 0.044 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.044 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) - 0 row cuts, 0 column cuts (0 active) in 0.036 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.340 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts, 0 column cuts (0 active) in 0.080 seconds - new frequency is -100 Optimal - objective value 576.254 Optimal - objective value 576.254 After 0 nodes, 1 on tree, 576.345 best solution, best possible 576.254 (61.90 seconds) Search completed - best objective 576.3446330306435, took 8693 iterations and 24 nodes (74.76 seconds) Strong branching done 30 times (2089 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 9, 6 variables fixed on reduced cost Cuts at root node changed objective from 576.232 to 576.254 Probing was tried 16 times and created 21 cuts of which 19 were active after adding rounds of cuts (0.168 seconds) Gomory was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.044 seconds) Knapsack was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.044 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 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) FlowCover was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.340 seconds) TwoMirCuts was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.080 seconds) implication was tried 15 times and created 0 cuts of which 0 were active after adding rounds of cuts 63 bounds tightened after postprocessing Result - Finished objective 576.3446330306435 after 24 nodes and 8693 iterations - took 75.24 seconds (total time 106.32) Total time 244.61 Solved to optimality. MIP solution: 576.344633 (24 nodes, 244.63 seconds) Best possible: 576.344633 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- dano3_3.gms(124) 0 Mb --- Reading solution for model m --- dano3_3.gms(124) 6 Mb *** Status: Normal completion --- Job dano3_3.gms Stop 08/24/08 00:27:52 elapsed 0:04:06.076