--- Job ran12x12 Start 08/21/08 11:47:23 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 --- ran12x12.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran12x12.gdx --- ran12x12.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.027 --- ran12x12.gms(123) 4 Mb --- Generating MIP model m --- ran12x12.gms(124) 4 Mb --- 169 rows 289 columns 865 non-zeroes --- 144 discrete-columns --- Executing COINCBC: elapsed 0:00:00.033 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 288 columns and 168 rows. 144 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 1826.55 - 0.00 seconds processed model has 168 rows, 288 columns (144 integer) and 576 elements Pass 1: obj. 1.65515 --> up = 0 , down = 0 -- rand = 8 ( 12) - solution found of 2655 Before mini branch and bound, 129 integers at bound fixed and 129 continuous Full problem 168 rows 288 columns, reduced to 9 rows 11 columns Mini branch and bound improved solution from 2655 to 2579 (0.01 seconds) Round again with cutoff of 2503.75 Pass 2: obj. 1.65515 --> up = 0 , down = 0 -- rand = 8 ( 26) Pass 3: obj. 0.83102 --> up = 0 , down = 1 Pass 4: obj. 0.10526 --> up = 0 , down = 0 -- rand = 1 ( 11) perturbation applied Pass 5: obj. 23.35152 --> up = 2 , down = 22 Pass 6: obj. 2.02062 --> up = 0 , down = 0 -- rand = 9 ( 14) Pass 7: obj. 5.00665 --> up = 2 , down = 4 Pass 8: obj. 0.45437 --> up = 0 , down = 0 -- rand = 3 ( 20) Pass 9: obj. 2.21022 --> up = 0 , down = 2 Pass 10: obj. 0.36955 --> up = 0 , down = 0 -- rand = 3 ( 27) Pass 11: obj. 2.31652 --> up = 0 , down = 2 Pass 12: obj. 0.73260 --> up = 0 , down = 0 -- rand = 4 ( 27) Pass 13: obj. 3.18959 --> up = 0 , down = 3 perturbation applied Pass 14: obj. 15.89409 --> up = 2 , down = 14 Pass 15: obj. 0.78903 --> up = 0 , down = 0 -- rand = 7 ( 19) Pass 16: obj. 4.56584 --> up = 2 , down = 3 Pass 17: obj. 0.57782 --> up = 0 , down = 0 -- rand = 5 ( 16) Pass 18: obj. 2.78195 --> up = 1 , down = 2 Pass 19: obj. 0.42915 --> up = 0 , down = 0 -- rand = 3 ( 26) Pass 20: obj. 2.18940 --> up = 1 , down = 1 Pass 21: obj. 0.56215 --> No solution found this major pass Before mini branch and bound, 98 integers at bound fixed and 97 continuous Full problem 168 rows 288 columns, reduced to 61 rows 88 columns Mini branch and bound improved solution from 2579 to 2428 (0.16 seconds) After 0.16 seconds - Feasibility pump exiting - took 0.16 seconds Integer solution of 2428 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) Full problem 168 rows 288 columns, reduced to 0 rows 0 columns 43 added rows had average density of 48.4651 At root node, 43 cuts changed objective from 1826.55 to 2134.79 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 1.476 seconds - new frequency is 10 Cut generator 1 (Gomory) - 3811 row cuts (5 active), 0 column cuts in 0.260 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 273 row cuts (15 active), 0 column cuts in 0.152 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 601 row cuts (22 active), 0 column cuts in 0.032 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) - 108 row cuts (1 active), 0 column cuts in 0.048 seconds - new frequency is -100 After 0 nodes, 1 on tree, 2428 best solution, best possible 2134.79 (3.27 seconds) Integer solution of 2421 found after 24721 iterations and 894 nodes (13.58 seconds) Full problem 168 rows 288 columns, reduced to 36 rows 44 columns Integer solution of 2364 found by combine solutions after 24758 iterations and 895 nodes (14.04 seconds) Integer solution of 2306 found by rounding after 27905 iterations and 979 nodes (15.07 seconds) Full problem 168 rows 288 columns, reduced to 46 rows 59 columns After 1000 nodes, 80 on tree, 2306 best solution, best possible 2142.75 (15.77 seconds) After 2000 nodes, 283 on tree, 2306 best solution, best possible 2170.52 (19.93 seconds) After 3000 nodes, 438 on tree, 2306 best solution, best possible 2170.52 (23.45 seconds) Integer solution of 2291 found after 72349 iterations and 3409 nodes (25.06 seconds) Full problem 168 rows 288 columns, reduced to 48 rows 63 columns After 4000 nodes, 414 on tree, 2291 best solution, best possible 2186.23 (28.43 seconds) After 5000 nodes, 422 on tree, 2291 best solution, best possible 2193.99 (31.71 seconds) After 6000 nodes, 407 on tree, 2291 best solution, best possible 2193.99 (34.89 seconds) After 7000 nodes, 386 on tree, 2291 best solution, best possible 2200.61 (38.01 seconds) Strong branching is fixing too many variables, too expensively! After 8000 nodes, 327 on tree, 2291 best solution, best possible 2225.59 (41.19 seconds) After 9000 nodes, 167 on tree, 2291 best solution, best possible 2225.59 (44.37 seconds) Search completed - best objective 2291, took 173032 iterations and 9815 nodes (47.17 seconds) Strong branching done 21304 times (284848 iterations), fathomed 822 nodes and fixed 3420 variables Maximum depth 49, 57490 variables fixed on reduced cost Cuts at root node changed objective from 1826.55 to 2134.79 Probing was tried 733 times and created 236 cuts of which 137 were active after adding rounds of cuts (1.628 seconds) Gomory was tried 6190 times and created 7984 cuts of which 2009 were active after adding rounds of cuts (2.688 seconds) Knapsack was tried 100 times and created 273 cuts of which 15 were active after adding rounds of cuts (0.152 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 6755 times and created 12170 cuts of which 7549 were active after adding rounds of cuts (1.228 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 100 times and created 108 cuts of which 1 were active after adding rounds of cuts (0.048 seconds) Result - Finished objective 2291 after 9815 nodes and 173032 iterations - took 47.17 seconds (total time 47.18) Total time 47.19 Solved to optimality. Writing solution. Objective: 2291 Time: 47.18 s --- Restarting execution --- ran12x12.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran12x12.gms Stop 08/21/08 11:48:11 elapsed 0:00:47.335