--- Job ran4x64 Start 08/21/08 12:42: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 --- ran4x64.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran4x64.gdx --- ran4x64.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.008 --- ran4x64.gms(123) 4 Mb --- Generating MIP model m --- ran4x64.gms(124) 4 Mb --- 325 rows 513 columns 1,537 non-zeroes --- 256 discrete-columns --- ran4x64.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.017 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 512 columns and 324 rows. 256 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 9637.93 - 0.01 seconds processed model has 324 rows, 512 columns (256 integer) and 1024 elements Pass 1: obj. 0.25423 --> up = 0 , down = 0 -- rand = 3 ( 14) - solution found of 10221 Before mini branch and bound, 247 integers at bound fixed and 246 continuous Full problem 324 rows 512 columns, reduced to 9 rows 11 columns Mini branch and bound improved solution from 10221 to 10012 (0.02 seconds) Round again with cutoff of 9974.59 Pass 2: obj. 0.25423 --> up = 0 , down = 0 -- rand = 3 ( 23) Pass 3: obj. 1.08019 --> up = 0 , down = 1 Pass 4: obj. 0.25769 --> up = 0 , down = 0 -- rand = 3 ( 24) Pass 5: obj. 2.38493 --> up = 1 , down = 2 Pass 6: obj. 0.18605 --> up = 0 , down = 0 -- rand = 2 ( 27) Pass 7: obj. 1.75703 --> up = 0 , down = 2 perturbation applied Pass 8: obj. 40.95603 --> up = 12 , down = 29 Pass 9: obj. 1.06399 --> up = 0 , down = 0 -- rand = 7 ( 26) Pass 10: obj. 3.30432 --> up = 1 , down = 1 Pass 11: obj. 1.66236 --> up = 1 , down = 1 Pass 12: obj. 0.30233 --> up = 0 , down = 0 -- rand = 2 ( 18) Pass 13: obj. 1.36504 --> up = 0 , down = 1 Pass 14: obj. 0.60802 --> up = 0 , down = 0 -- rand = 3 ( 22) Pass 15: obj. 1.12947 --> up = 1 , down = 0 Pass 16: obj. 0.73412 --> up = 0 , down = 0 -- rand = 3 ( 23) Pass 17: obj. 1.00337 --> up = 1 , down = 0 perturbation applied Pass 18: obj. 47.04913 --> up = 16 , down = 32 Pass 19: obj. 1.21161 --> up = 0 , down = 0 -- rand = 7 ( 20) Pass 20: obj. 3.17904 --> up = 0 , down = 2 Pass 21: obj. 1.76936 --> No solution found this major pass Before mini branch and bound, 220 integers at bound fixed and 219 continuous Full problem 324 rows 512 columns, reduced to 45 rows 63 columns Mini branch and bound improved solution from 10012 to 9951 (0.12 seconds) After 0.12 seconds - Feasibility pump exiting - took 0.12 seconds Integer solution of 9951 found by feasibility pump after 0 iterations and 0 nodes (0.12 seconds) Full problem 324 rows 512 columns, reduced to 0 rows 0 columns 15 added rows had average density of 297.133 At root node, 15 cuts changed objective from 9637.93 to 9689.61 in 15 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.208 seconds - new frequency is 10 Cut generator 1 (Gomory) - 301 row cuts (7 active), 0 column cuts in 0.024 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 53 row cuts (7 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 17 row cuts (1 active), 0 column cuts in 0.028 seconds - new frequency is -100 After 0 nodes, 1 on tree, 9951 best solution, best possible 9689.61 (0.68 seconds) Full problem 324 rows 512 columns, reduced to 12 rows 15 columns Strong branching is fixing too many variables, too expensively! Full problem 324 rows 512 columns, reduced to 30 rows 39 columns Integer solution of 9711 found after 1138 iterations and 61 nodes (1.90 seconds) Search completed - best objective 9711, took 1164 iterations and 66 nodes (1.93 seconds) Strong branching done 1216 times (8009 iterations), fathomed 18 nodes and fixed 137 variables Maximum depth 10, 1030 variables fixed on reduced cost Cuts at root node changed objective from 9637.93 to 9689.61 Probing was tried 21 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.216 seconds) Gomory was tried 46 times and created 301 cuts of which 7 were active after adding rounds of cuts (0.048 seconds) Knapsack was tried 15 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) Clique was tried 15 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 15 times and created 53 cuts of which 7 were active after adding rounds of cuts (0.012 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 15 times and created 17 cuts of which 1 were active after adding rounds of cuts (0.028 seconds) Result - Finished objective 9711 after 66 nodes and 1164 iterations - took 1.94 seconds (total time 1.95) Total time 1.96 Solved to optimality. Writing solution. Objective: 9711 Time: 1.95 s --- Restarting execution --- ran4x64.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran4x64.gms Stop 08/21/08 12:42:25 elapsed 0:00:02.011