--- Job ran17x17 Start 08/21/08 12:41:56 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.033 --- 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 COINCBC: elapsed 0:00:00.043 GAMS/CoinCbc 2.0 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.00.00, build Mar 20 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 1215.25 - 0.01 seconds processed model has 323 rows, 578 columns (289 integer) and 1156 elements Pass 1: obj. 2.14901 --> up = 0 , down = 0 -- rand = 11 ( 12) - 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 13 rows 17 columns Mini branch and bound improved solution from 1574 to 1464 (0.01 seconds) Round again with cutoff of 1439.12 Pass 2: obj. 1.72044 --> up = 0 , down = 0 -- rand = 11 ( 18) Pass 3: obj. 2.32222 --> up = 0 , down = 2 Pass 4: obj. 0.47894 --> up = 0 , down = 0 -- rand = 3 ( 17) Pass 5: obj. 1.19695 --> up = 0 , down = 1 Pass 6: obj. 0.34243 --> up = 0 , down = 0 -- rand = 5 ( 16) Pass 7: obj. 4.06099 --> up = 0 , down = 4 Pass 8: obj. 0.55347 --> up = 0 , down = 0 -- rand = 3 ( 21) Pass 9: obj. 1.09111 --> up = 0 , down = 1 Pass 10: obj. 0.51217 --> up = 0 , down = 0 -- rand = 2 ( 25) Pass 11: obj. 0.42411 --> up = 0 , down = 0 -- rand = 2 ( 10) perturbation applied Pass 12: obj. 42.24429 --> up = 0 , down = 42 Pass 13: obj. 1.65832 --> up = 0 , down = 0 -- rand = 10 ( 10) Pass 14: obj. 5.08115 --> up = 0 , down = 3 Pass 15: obj. 2.08115 --> up = 0 , down = 1 Pass 16: obj. 1.63974 --> up = 0 , down = 0 -- rand = 6 ( 17) Pass 17: obj. 2.66570 --> up = 0 , down = 3 Pass 18: obj. 1.44572 --> up = 0 , down = 0 -- rand = 5 ( 17) Pass 19: obj. 2.78160 --> up = 0 , down = 3 Pass 20: obj. 1.01508 --> up = 1 , down = 0 Pass 21: obj. 0.97308 --> No solution found this major pass Before mini branch and bound, 244 integers at bound fixed and 245 continuous Full problem 323 rows 578 columns, reduced to 55 rows 73 columns Mini branch and bound did not improve solution (0.16 seconds) After 0.16 seconds - Feasibility pump exiting - took 0.16 seconds Integer solution of 1464 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) Full problem 323 rows 578 columns, reduced to 0 rows 0 columns 43 added rows had average density of 40.1628 At root node, 43 cuts changed objective from 1215.25 to 1316.8 in 22 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.224 seconds - new frequency is 10 Cut generator 1 (Gomory) - 139 row cuts (4 active), 0 column cuts in 0.064 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 98 row cuts (8 active), 0 column cuts in 0.036 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 111 row cuts (26 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 78 row cuts (5 active), 0 column cuts in 0.052 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1464 best solution, best possible 1316.8 (1.00 seconds) Strong branching is fixing too many variables, too expensively! After 1000 nodes, 76 on tree, 1464 best solution, best possible 1320.05 (6.90 seconds) After 2000 nodes, 100 on tree, 1464 best solution, best possible 1320.05 (9.05 seconds) After 3000 nodes, 68 on tree, 1464 best solution, best possible 1320.05 (11.03 seconds) After 4000 nodes, 77 on tree, 1464 best solution, best possible 1320.05 (13.34 seconds) Integer solution of 1463 found by rounding after 44715 iterations and 4573 nodes (14.61 seconds) Full problem 323 rows 578 columns, reduced to 35 rows 44 columns Integer solution of 1428 found by combine solutions after 44749 iterations and 4574 nodes (15.08 seconds) Integer solution of 1426 found by rounding after 47972 iterations and 4724 nodes (15.69 seconds) Full problem 323 rows 578 columns, reduced to 54 rows 69 columns Integer solution of 1398 found by combine solutions after 47973 iterations and 4725 nodes (16.85 seconds) Integer solution of 1373 found by rounding after 51010 iterations and 4914 nodes (17.46 seconds) Full problem 323 rows 578 columns, reduced to 59 rows 77 columns After 5000 nodes, 53 on tree, 1373 best solution, best possible 1320.05 (18.62 seconds) After 6000 nodes, 151 on tree, 1373 best solution, best possible 1338.29 (21.51 seconds) After 7000 nodes, 140 on tree, 1373 best solution, best possible 1340.83 (23.62 seconds) After 8000 nodes, 44 on tree, 1373 best solution, best possible 1357.51 (25.69 seconds) Search completed - best objective 1373, took 78057 iterations and 8200 nodes (26.09 seconds) Strong branching done 5288 times (62526 iterations), fathomed 229 nodes and fixed 953 variables Maximum depth 50, 58404 variables fixed on reduced cost Cuts at root node changed objective from 1215.25 to 1316.8 Probing was tried 483 times and created 288 cuts of which 135 were active after adding rounds of cuts (0.436 seconds) Gomory was tried 1115 times and created 1307 cuts of which 500 were active after adding rounds of cuts (0.512 seconds) Knapsack was tried 1248 times and created 1083 cuts of which 218 were active after adding rounds of cuts (1.400 seconds) Clique was tried 22 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 1248 times and created 2640 cuts of which 1496 were active after adding rounds of cuts (0.440 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) TwoMirCuts was tried 22 times and created 78 cuts of which 5 were active after adding rounds of cuts (0.052 seconds) Result - Finished objective 1373 after 8200 nodes and 78057 iterations - took 26.10 seconds (total time 26.11) Total time 26.11 Solved to optimality. Writing solution. Objective: 1373 Time: 26.11 s --- Restarting execution --- ran17x17.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran17x17.gms Stop 08/21/08 12:42:23 elapsed 0:00:26.213