--- Job ran17x17 Start 08/24/08 06:43:40 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 --- ran17x17.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran17x17.gdx --- ran17x17.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.008 --- ran17x17.gms(123) 4 Mb --- Generating MIP model m --- ran17x17.gms(124) 4 Mb --- 324 rows 579 columns 1,735 non-zeroes --- 289 discrete-columns --- Executing Cbc: elapsed 0:00:00.018 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 578 columns and 323 rows. 289 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 1215.25 - 0.01 seconds Optimal - objective value 1215.25 processed model has 323 rows, 578 columns (289 integer) and 1156 elements Pass 1: suminf. 2.14901 (11) obj. 1265.86 iterations 165 Solution found of 1574 Before mini branch and bound, 267 integers at bound fixed and 266 continuous Full problem 323 rows 578 columns, reduced to 20 rows 24 columns Mini branch and bound improved solution from 1574 to 1464 (0.02 seconds) Round again with cutoff of 1439.12 Pass 2: suminf. 1.72044 (11) obj. 1263.96 iterations 146 Pass 3: suminf. 0.56756 (3) obj. 1439.12 iterations 128 Pass 4: suminf. 0.47894 (3) obj. 1439.12 iterations 42 Pass 5: suminf. 0.42410 (3) obj. 1439.12 iterations 81 Pass 6: suminf. 0.34243 (5) obj. 1439.12 iterations 38 Pass 7: suminf. 0.55347 (3) obj. 1439.12 iterations 46 Pass 8: suminf. 0.55347 (3) obj. 1439.12 iterations 51 Pass 9: suminf. 0.51217 (2) obj. 1439.12 iterations 42 Pass 10: suminf. 0.51217 (2) obj. 1439.12 iterations 43 Pass 11: suminf. 0.42411 (2) obj. 1439.12 iterations 61 Pass 12: suminf. 3.21272 (12) obj. 1439.12 iterations 101 Pass 13: suminf. 1.60435 (9) obj. 1439.12 iterations 59 Pass 14: suminf. 1.60435 (9) obj. 1439.12 iterations 8 Pass 15: suminf. 3.10009 (9) obj. 1439.12 iterations 112 Pass 16: suminf. 2.24228 (8) obj. 1439.12 iterations 55 Pass 17: suminf. 1.74237 (7) obj. 1439.12 iterations 64 Pass 18: suminf. 1.64853 (7) obj. 1439.12 iterations 50 Pass 19: suminf. 2.82334 (9) obj. 1439.12 iterations 57 Pass 20: suminf. 2.29114 (7) obj. 1439.12 iterations 36 Pass 21: suminf. 1.72802 (6) obj. 1439.12 iterations 17 No solution found this major pass Before mini branch and bound, 238 integers at bound fixed and 239 continuous Full problem 323 rows 578 columns, reduced to 66 rows 86 columns Mini branch and bound did not improve solution (0.15 seconds) After 0.15 seconds - Feasibility pump exiting with objective of 1464 - took 0.14 seconds Integer solution of 1464 found by feasibility pump after 0 iterations and 0 nodes (0.15 seconds) Full problem 323 rows 578 columns, reduced to 0 rows 0 columns 43 added rows had average density of 127.581 At root node, 43 cuts changed objective from 1215.25 to 1320.38 in 12 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 0.044 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 333 row cuts, 0 column cuts (37 active) in 0.028 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 77 row cuts, 0 column cuts (6 active) in 0.012 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 68 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 47 row cuts, 0 column cuts (0 active) in 0.052 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 259 row cuts, 0 column cuts (0 active) in 0.056 seconds - new frequency is -100 Optimal - objective value 1320.38 Optimal - objective value 1320.38 After 0 nodes, 1 on tree, 1464 best solution, best possible 1320.38 (0.90 seconds) Integer solution of 1456 found after 17298 iterations and 735 nodes (6.51 seconds) Full problem 323 rows 578 columns, reduced to 41 rows 48 columns Integer solution of 1423 found by combine solutions after 17345 iterations and 736 nodes (6.85 seconds) After 1000 nodes, 160 on tree, 1423 best solution, best possible 1322.13 (8.30 seconds) After 2000 nodes, 610 on tree, 1423 best solution, best possible 1322.13 (12.14 seconds) Integer solution of 1387 found after 61861 iterations and 2946 nodes (15.06 seconds) Full problem 323 rows 578 columns, reduced to 50 rows 61 columns Integer solution of 1381 found by combine solutions after 61918 iterations and 2948 nodes (15.15 seconds) Integer solution of 1374 found after 62221 iterations and 2974 nodes (15.22 seconds) Full problem 323 rows 578 columns, reduced to 53 rows 65 columns After 3000 nodes, 133 on tree, 1374 best solution, best possible 1330.52 (15.36 seconds) Integer solution of 1373 found after 73495 iterations and 3858 nodes (17.48 seconds) Full problem 323 rows 578 columns, reduced to 55 rows 68 columns After 4000 nodes, 135 on tree, 1373 best solution, best possible 1361.86 (18.53 seconds) After 5000 nodes, 17 on tree, 1373 best solution, best possible 1372.7 (20.58 seconds) Search completed - best objective 1373, took 85210 iterations and 5035 nodes (20.62 seconds) Strong branching done 3034 times (44841 iterations), fathomed 20 nodes and fixed 181 variables Maximum depth 62, 87049 variables fixed on reduced cost Cuts at root node changed objective from 1215.25 to 1320.38 Probing was tried 857 times and created 871 cuts of which 288 were active after adding rounds of cuts (0.312 seconds) Gomory was tried 1427 times and created 1880 cuts of which 734 were active after adding rounds of cuts (0.780 seconds) Knapsack was tried 1595 times and created 1154 cuts of which 322 were active after adding rounds of cuts (0.960 seconds) Clique was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 1595 times and created 2559 cuts of which 1394 were active after adding rounds of cuts (0.432 seconds) FlowCover was tried 1595 times and created 1900 cuts of which 423 were active after adding rounds of cuts (0.532 seconds) TwoMirCuts was tried 12 times and created 259 cuts of which 0 were active after adding rounds of cuts (0.056 seconds) Result - Finished objective 1373 after 5035 nodes and 85210 iterations - took 20.63 seconds (total time 20.64) Total time 20.65 Solved to optimality. MIP solution: 1373 (5035 nodes, 20.65 seconds) Best possible: 1373 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran17x17.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran17x17.gms Stop 08/24/08 06:44:01 elapsed 0:00:20.970