--- Job ran12x12 Start 08/24/08 05:44: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 --- 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.005 --- 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 Cbc: elapsed 0:00:00.012 GAMS/Cbc 2.1 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 1826.55 - 0.01 seconds Optimal - objective value 1826.55 processed model has 168 rows, 288 columns (144 integer) and 576 elements Pass 1: suminf. 1.65515 (8) obj. 1931.29 iterations 52 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 14 rows 16 columns Mini branch and bound improved solution from 2655 to 2579 (0.01 seconds) Round again with cutoff of 2503.75 Pass 2: suminf. 1.65515 (8) obj. 1931.29 iterations 53 Pass 3: suminf. 0.16898 (1) obj. 2503.75 iterations 69 Pass 4: suminf. 0.10526 (1) obj. 2492.16 iterations 6 Pass 5: suminf. 2.37313 (8) obj. 2503.75 iterations 67 Pass 6: suminf. 2.07537 (9) obj. 2503.75 iterations 28 Pass 7: suminf. 2.20643 (8) obj. 2503.75 iterations 58 Pass 8: suminf. 1.19552 (7) obj. 2503.75 iterations 55 Pass 9: suminf. 1.54449 (7) obj. 2503.75 iterations 51 Pass 10: suminf. 0.86206 (6) obj. 2503.75 iterations 51 Pass 11: suminf. 1.54449 (7) obj. 2503.75 iterations 53 Pass 12: suminf. 0.75753 (6) obj. 2503.75 iterations 87 Pass 13: suminf. 0.51287 (6) obj. 2503.75 iterations 50 Pass 14: suminf. 0.75596 (6) obj. 2503.75 iterations 27 Pass 15: suminf. 2.92944 (11) obj. 2503.75 iterations 79 Pass 16: suminf. 1.83908 (9) obj. 2503.75 iterations 48 Pass 17: suminf. 2.33363 (8) obj. 2503.75 iterations 51 Pass 18: suminf. 1.65063 (6) obj. 2503.75 iterations 40 Pass 19: suminf. 1.83435 (8) obj. 2503.75 iterations 42 Pass 20: suminf. 1.16447 (7) obj. 2503.75 iterations 44 Pass 21: suminf. 0.87122 (7) obj. 2503.75 iterations 30 No solution found this major pass Before mini branch and bound, 86 integers at bound fixed and 91 continuous Full problem 168 rows 288 columns, reduced to 70 rows 101 columns Mini branch and bound did not improve solution (0.14 seconds) After 0.14 seconds - Feasibility pump exiting with objective of 2579 - took 0.14 seconds Integer solution of 2579 found by feasibility pump after 0 iterations and 0 nodes (0.14 seconds) Full problem 168 rows 288 columns, reduced to 0 rows 0 columns 50 added rows had average density of 96.62 At root node, 50 cuts changed objective from 1826.55 to 2141.55 in 100 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 4.792 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 4026 row cuts, 0 column cuts (44 active) in 0.356 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 285 row cuts, 0 column cuts (6 active) in 0.060 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 505 row cuts, 0 column cuts (0 active) in 0.032 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 330 row cuts, 0 column cuts (0 active) in 0.340 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 356 row cuts, 0 column cuts (0 active) in 0.064 seconds - new frequency is -100 Optimal - objective value 2141.55 Optimal - objective value 2141.55 After 0 nodes, 1 on tree, 2579 best solution, best possible 2141.55 (6.98 seconds) Integer solution of 2572 found after 30235 iterations and 997 nodes (18.26 seconds) Full problem 168 rows 288 columns, reduced to 36 rows 45 columns Integer solution of 2428 found by combine solutions after 30257 iterations and 998 nodes (18.84 seconds) After 1000 nodes, 47 on tree, 2428 best solution, best possible 2145.23 (18.88 seconds) Integer solution of 2331 found after 34166 iterations and 1128 nodes (19.79 seconds) Full problem 168 rows 288 columns, reduced to 48 rows 63 columns After 2000 nodes, 404 on tree, 2331 best solution, best possible 2167.42 (25.65 seconds) After 3000 nodes, 642 on tree, 2331 best solution, best possible 2175.4 (30.60 seconds) Integer solution of 2329 found after 92093 iterations and 3080 nodes (31.02 seconds) Full problem 168 rows 288 columns, reduced to 59 rows 78 columns Integer solution of 2295 found by combine solutions after 92126 iterations and 3081 nodes (31.72 seconds) Integer solution of 2294 found after 113761 iterations and 3940 nodes (35.63 seconds) Full problem 168 rows 288 columns, reduced to 63 rows 84 columns After 4000 nodes, 483 on tree, 2294 best solution, best possible 2228.06 (36.89 seconds) After 5000 nodes, 641 on tree, 2294 best solution, best possible 2262.14 (42.11 seconds) After 6000 nodes, 667 on tree, 2294 best solution, best possible 2273.99 (46.09 seconds) After 7000 nodes, 552 on tree, 2294 best solution, best possible 2281.85 (49.36 seconds) After 8000 nodes, 318 on tree, 2294 best solution, best possible 2289.09 (52.09 seconds) Integer solution of 2291 found after 197444 iterations and 8109 nodes (52.34 seconds) Full problem 168 rows 288 columns, reduced to 63 rows 84 columns Search completed - best objective 2291, took 199662 iterations and 8313 nodes (53.59 seconds) Strong branching done 11670 times (198537 iterations), fathomed 86 nodes and fixed 1346 variables Maximum depth 50, 58273 variables fixed on reduced cost Cuts at root node changed objective from 1826.55 to 2141.55 Probing was tried 7519 times and created 6267 cuts of which 2546 were active after adding rounds of cuts (6.892 seconds) Gomory was tried 7080 times and created 16121 cuts of which 3343 were active after adding rounds of cuts (3.500 seconds) Knapsack was tried 10413 times and created 18230 cuts of which 4235 were active after adding rounds of cuts (4.120 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 10413 times and created 15336 cuts of which 3809 were active after adding rounds of cuts (1.516 seconds) FlowCover was tried 10413 times and created 2000 cuts of which 233 were active after adding rounds of cuts (0.656 seconds) TwoMirCuts was tried 100 times and created 356 cuts of which 0 were active after adding rounds of cuts (0.064 seconds) Result - Finished objective 2291 after 8313 nodes and 199662 iterations - took 53.60 seconds (total time 53.61) Total time 53.61 Solved to optimality. MIP solution: 2291 (8313 nodes, 53.6 seconds) Best possible: 2291 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran12x12.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran12x12.gms Stop 08/24/08 05:45:50 elapsed 0:00:54.088