--- Job fast0507 Start 08/24/08 01:43:07 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 --- fast0507.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/fast0507.gdx --- fast0507.gms(148) 18 Mb --- Starting execution: elapsed 0:00:00.432 --- fast0507.gms(123) 19 Mb --- Generating MIP model m --- fast0507.gms(124) 40 Mb --- 508 rows 63,010 columns 472,359 non-zeroes --- 63,009 discrete-columns --- fast0507.gms(124) 39 Mb --- Executing Cbc: elapsed 0:00:01.563 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 63009 columns and 507 rows. 63009 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 172.146 - 2.13 seconds Optimal - objective value 172.146 processed model has 474 rows, 62173 columns (62173 integer) and 400842 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 11.25000 (38) obj. 213.25 iterations 5959 Pass 2: suminf. 0.00000 (0) obj. 212 iterations 90 Solution found of 212 Cleaned solution of 212 Before mini branch and bound, 61842 integers at bound fixed and 0 continuous Full problem 474 rows 62173 columns, reduced to 302 rows 331 columns Mini branch and bound improved solution from 212 to 177 (16.93 seconds) Round again with cutoff of 175 Pass 3: suminf. 21.63665 (128) obj. 175 iterations 5306 Pass 4: suminf. 17.67693 (137) obj. 175 iterations 1596 Pass 5: suminf. 15.71270 (134) obj. 175 iterations 859 Pass 6: suminf. 14.26111 (157) obj. 175 iterations 893 Pass 7: suminf. 13.72172 (147) obj. 175 iterations 482 Pass 8: suminf. 13.11973 (131) obj. 175 iterations 124 Pass 9: suminf. 13.43130 (153) obj. 175 iterations 2244 Pass 10: suminf. 11.74761 (148) obj. 175 iterations 1547 Pass 11: suminf. 12.59851 (67) obj. 175 iterations 3079 Pass 12: suminf. 9.57143 (69) obj. 175 iterations 3410 Pass 13: suminf. 8.51005 (115) obj. 175 iterations 1791 Pass 14: suminf. 7.96667 (121) obj. 175 iterations 940 Pass 15: suminf. 10.00000 (30) obj. 175 iterations 3579 Pass 16: suminf. 7.53181 (156) obj. 175 iterations 3627 Pass 17: suminf. 11.41935 (67) obj. 175 iterations 4613 Pass 18: suminf. 6.60937 (102) obj. 175 iterations 3406 Pass 19: suminf. 5.75674 (142) obj. 175 iterations 2319 Pass 20: suminf. 5.72222 (123) obj. 175 iterations 201 Pass 21: suminf. 8.00000 (16) obj. 175 iterations 3719 Pass 22: suminf. 8.00000 (16) obj. 175 iterations 964 No solution found this major pass Before mini branch and bound, 61522 integers at bound fixed and 0 continuous Full problem 474 rows 62173 columns, reduced to 333 rows 650 columns Mini branch and bound did not improve solution (171.67 seconds) After 171.67 seconds - Feasibility pump exiting with objective of 177 - took 171.54 seconds Integer solution of 177 found by feasibility pump after 0 iterations and 0 nodes (171.70 seconds) Full problem 474 rows 62173 columns, reduced to 0 rows 0 columns At root node, 0 cuts changed objective from 172.146 to 172.146 in 1 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 0.316 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 0 row cuts, 0 column cuts (0 active) in 0.072 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.116 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.056 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts, 0 column cuts (0 active) in 0.680 seconds - new frequency is -100 Optimal - objective value 172.146 Optimal - objective value 172.146 After 0 nodes, 1 on tree, 177 best solution, best possible 172.146 (179.36 seconds) After 100 nodes, 53 on tree, 177 best solution, best possible 172.208 (340.26 seconds) After 200 nodes, 108 on tree, 177 best solution, best possible 172.208 (457.51 seconds) After 300 nodes, 134 on tree, 177 best solution, best possible 172.208 (493.62 seconds) After 400 nodes, 148 on tree, 177 best solution, best possible 172.208 (503.54 seconds) After 500 nodes, 140 on tree, 177 best solution, best possible 172.208 (509.04 seconds) Integer solution of 176 found after 82650 iterations and 526 nodes (513.60 seconds) After 600 nodes, 145 on tree, 176 best solution, best possible 172.208 (612.77 seconds) After 700 nodes, 193 on tree, 176 best solution, best possible 172.208 (762.41 seconds) After 800 nodes, 243 on tree, 176 best solution, best possible 172.256 (895.57 seconds) After 900 nodes, 292 on tree, 176 best solution, best possible 172.256 (1034.63 seconds) After 1000 nodes, 343 on tree, 176 best solution, best possible 172.256 (1170.30 seconds) After 1100 nodes, 393 on tree, 176 best solution, best possible 172.256 (1307.80 seconds) After 1200 nodes, 442 on tree, 176 best solution, best possible 172.256 (1450.09 seconds) After 1300 nodes, 492 on tree, 176 best solution, best possible 172.256 (1585.98 seconds) After 1400 nodes, 543 on tree, 176 best solution, best possible 172.256 (1706.66 seconds) Exiting on maximum time Partial search - best objective 176 (best possible 172.256), took 430315 iterations and 1472 nodes (1799.78 seconds) Strong branching done 6076 times (42201 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 81, 990208 variables fixed on reduced cost Cuts at root node changed objective from 172.146 to 172.146 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.372 seconds) Gomory was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.072 seconds) Knapsack was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) Clique was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.116 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.056 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.680 seconds) implication was tried 927 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Stopped on time objective 176 after 1472 nodes and 430315 iterations - took 1801.42 seconds (total time 1803.62) Total time 1804.02 Time limit reached. Have feasible solution. MIP solution: 176 (1472 nodes, 1804.06 seconds) Best possible: 172.2557075 Absolute gap: 3.7443 (absolute tolerance optca: 0) Relative gap: 0.021737 (relative tolerance optcr: 0) --- Restarting execution --- fast0507.gms(124) 0 Mb --- Reading solution for model m --- fast0507.gms(124) 22 Mb *** Status: Normal completion --- Job fast0507.gms Stop 08/24/08 02:13:26 elapsed 0:30:18.805