--- Job ran10x10a Start 08/21/08 11:45:10 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 --- ran10x10a.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x10a.gdx --- ran10x10a.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.024 --- ran10x10a.gms(123) 4 Mb --- Generating MIP model m --- ran10x10a.gms(124) 4 Mb --- 121 rows 201 columns 601 non-zeroes --- 100 discrete-columns --- Executing COINCBC: elapsed 0:00:00.029 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 200 columns and 120 rows. 100 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 1252.74 - 0.00 seconds processed model has 120 rows, 200 columns (100 integer) and 400 elements Pass 1: obj. 1.36795 --> up = 0 , down = 0 -- rand = 5 ( 15) - solution found of 1736 Before mini branch and bound, 91 integers at bound fixed and 91 continuous Full problem 120 rows 200 columns, reduced to 0 rows 0 columns Mini branch and bound improved solution from 1736 to 1736 (0.01 seconds) Round again with cutoff of 1687.67 Pass 2: obj. 1.36795 --> up = 0 , down = 0 -- rand = 5 ( 28) Pass 3: obj. 0.26848 --> up = 0 , down = 0 -- rand = 1 ( 12) Pass 4: obj. 0.07692 --> up = 0 , down = 0 -- rand = 1 ( 13) perturbation applied Pass 5: obj. 14.42729 --> up = 0 , down = 15 Pass 6: obj. 0.87431 --> up = 0 , down = 0 -- rand = 4 ( 28) Pass 7: obj. 1.29772 --> up = 1 , down = 1 Pass 8: obj. 0.89177 --> up = 0 , down = 0 -- rand = 4 ( 23) Pass 9: obj. 1.27667 --> up = 1 , down = 0 Pass 10: obj. 1.04590 --> up = 0 , down = 0 -- rand = 4 ( 29) Pass 11: obj. 2.50137 --> up = 1 , down = 2 Pass 12: obj. 0.86504 --> up = 0 , down = 0 -- rand = 4 ( 28) Pass 13: obj. 2.70137 --> up = 1 , down = 3 perturbation applied Pass 14: obj. 12.26294 --> up = 3 , down = 10 Pass 15: obj. 1.18394 --> up = 0 , down = 0 -- rand = 4 ( 14) Pass 16: obj. 2.03178 --> up = 0 , down = 2 Pass 17: obj. 0.57386 --> up = 0 , down = 0 -- rand = 2 ( 12) Pass 18: obj. 1.26255 --> up = 1 , down = 1 perturbation applied Pass 19: obj. 11.53537 --> up = 0 , down = 12 Pass 20: obj. 1.65118 --> up = 0 , down = 0 -- rand = 6 ( 14) Pass 21: obj. 2.86680 --> No solution found this major pass Before mini branch and bound, 63 integers at bound fixed and 62 continuous Full problem 120 rows 200 columns, reduced to 50 rows 70 columns Mini branch and bound did not improve solution (0.12 seconds) After 0.12 seconds - Feasibility pump exiting - took 0.12 seconds Integer solution of 1736 found by feasibility pump after 0 iterations and 0 nodes (0.12 seconds) Full problem 120 rows 200 columns, reduced to 0 rows 0 columns 30 added rows had average density of 69.0667 At root node, 30 cuts changed objective from 1252.74 to 1470.69 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.956 seconds - new frequency is 10 Cut generator 1 (Gomory) - 2960 row cuts (10 active), 0 column cuts in 0.100 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 223 row cuts (11 active), 0 column cuts in 0.108 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) - 240 row cuts (6 active), 0 column cuts in 0.020 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) - 234 row cuts (3 active), 0 column cuts in 0.048 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1736 best solution, best possible 1470.69 (2.06 seconds) Full problem 120 rows 200 columns, reduced to 11 rows 13 columns Integer solution of 1523 found by combine solutions after 3260 iterations and 33 nodes (2.80 seconds) Full problem 120 rows 200 columns, reduced to 19 rows 23 columns Search completed - best objective 1499, took 4313 iterations and 78 nodes (3.52 seconds) Strong branching done 1880 times (29072 iterations), fathomed 17 nodes and fixed 60 variables Maximum depth 8, 884 variables fixed on reduced cost Cuts at root node changed objective from 1252.74 to 1470.69 Probing was tried 106 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.956 seconds) Gomory was tried 164 times and created 3007 cuts of which 36 were active after adding rounds of cuts (0.112 seconds) Knapsack was tried 100 times and created 223 cuts of which 11 were active after adding rounds of cuts (0.108 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 100 times and created 240 cuts of which 6 were active after adding rounds of cuts (0.020 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 234 cuts of which 3 were active after adding rounds of cuts (0.048 seconds) Result - Finished objective 1499 after 78 nodes and 4313 iterations - took 3.52 seconds (total time 3.53) Total time 3.53 Solved to optimality. Writing solution. Objective: 1499 Time: 3.53 s --- Restarting execution --- ran10x10a.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x10a.gms Stop 08/21/08 11:45:13 elapsed 0:00:03.619