--- Job ran10x12 Start 08/21/08 11:45:27 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 --- ran10x12.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x12.gdx --- ran10x12.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.011 --- ran10x12.gms(123) 4 Mb --- Generating MIP model m --- ran10x12.gms(124) 4 Mb --- 143 rows 241 columns 721 non-zeroes --- 120 discrete-columns --- Executing COINCBC: elapsed 0:00:00.016 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 240 columns and 142 rows. 120 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 2426.22 - 0.00 seconds processed model has 142 rows, 240 columns (120 integer) and 480 elements Pass 1: obj. 1.05015 --> up = 0 , down = 0 -- rand = 6 ( 17) - solution found of 3571 Before mini branch and bound, 108 integers at bound fixed and 108 continuous Full problem 142 rows 240 columns, reduced to 8 rows 10 columns Mini branch and bound improved solution from 3571 to 3245 (0.01 seconds) Round again with cutoff of 3163.12 Pass 2: obj. 1.05015 --> up = 0 , down = 0 -- rand = 6 ( 28) Pass 3: obj. 1.41389 --> up = 0 , down = 2 Pass 4: obj. 0.32143 --> up = 0 , down = 0 -- rand = 2 ( 19) Pass 5: obj. 0.72622 --> up = 0 , down = 1 Pass 6: obj. 0.21429 --> up = 0 , down = 0 -- rand = 1 ( 14) perturbation applied Pass 7: obj. 15.51318 --> up = 2 , down = 14 Pass 8: obj. 1.01020 --> up = 0 , down = 0 -- rand = 4 ( 14) Pass 9: obj. 1.19388 --> up = 1 , down = 0 Pass 10: obj. 0.69597 --> up = 0 , down = 1 Pass 11: obj. 0.48168 --> up = 0 , down = 0 -- rand = 2 ( 19) perturbation applied Pass 12: obj. 14.85059 --> up = 1 , down = 13 Pass 13: obj. 1.35551 --> up = 0 , down = 0 -- rand = 4 ( 11) Pass 14: obj. 1.56791 --> up = 1 , down = 1 Pass 15: obj. 0.94273 --> up = 0 , down = 0 -- rand = 4 ( 13) Pass 16: obj. 1.05590 --> up = 0 , down = 1 Pass 17: obj. 0.84162 --> up = 0 , down = 0 -- rand = 3 ( 28) Pass 18: obj. 1.13649 --> up = 1 , down = 0 Pass 19: obj. 0.60729 --> up = 0 , down = 0 -- rand = 2 ( 20) perturbation applied Pass 20: obj. 14.91040 --> up = 1 , down = 13 Pass 21: obj. 1.69612 --> No solution found this major pass Before mini branch and bound, 88 integers at bound fixed and 85 continuous Full problem 142 rows 240 columns, reduced to 44 rows 61 columns Mini branch and bound improved solution from 3245 to 3047 (0.11 seconds) After 0.11 seconds - Feasibility pump exiting - took 0.11 seconds Integer solution of 3047 found by feasibility pump after 0 iterations and 0 nodes (0.11 seconds) Full problem 142 rows 240 columns, reduced to 0 rows 0 columns 23 added rows had average density of 75 At root node, 23 cuts changed objective from 2426.22 to 2677.98 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 1.124 seconds - new frequency is 10 Cut generator 1 (Gomory) - 2573 row cuts (7 active), 0 column cuts in 0.120 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 216 row cuts (11 active), 0 column cuts in 0.112 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 212 row cuts (4 active), 0 column cuts in 0.016 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) - 216 row cuts (1 active), 0 column cuts in 0.032 seconds - new frequency is -100 After 0 nodes, 1 on tree, 3047 best solution, best possible 2677.98 (2.08 seconds) Integer solution of 2798 found by rounding after 2609 iterations and 8 nodes (2.28 seconds) Full problem 142 rows 240 columns, reduced to 33 rows 42 columns Integer solution of 2714 found by combine solutions after 2616 iterations and 9 nodes (2.32 seconds) Search completed - best objective 2714, took 2916 iterations and 26 nodes (2.59 seconds) Strong branching done 808 times (9559 iterations), fathomed 9 nodes and fixed 29 variables Maximum depth 6, 315 variables fixed on reduced cost Cuts at root node changed objective from 2426.22 to 2677.98 Probing was tried 101 times and created 2 cuts of which 1 were active after adding rounds of cuts (1.124 seconds) Gomory was tried 122 times and created 2585 cuts of which 16 were active after adding rounds of cuts (0.140 seconds) Knapsack was tried 100 times and created 216 cuts of which 11 were active after adding rounds of cuts (0.112 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 100 times and created 212 cuts of which 4 were active after adding rounds of cuts (0.016 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 216 cuts of which 1 were active after adding rounds of cuts (0.032 seconds) Result - Finished objective 2714 after 26 nodes and 2916 iterations - took 2.59 seconds (total time 2.60) Total time 2.60 Solved to optimality. Writing solution. Objective: 2714 Time: 2.59 s --- Restarting execution --- ran10x12.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x12.gms Stop 08/21/08 11:45:30 elapsed 0:00:02.652