--- Job modglob Start 08/21/08 09:35:59 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 --- modglob.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/modglob.gdx --- modglob.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.033 --- modglob.gms(123) 4 Mb --- Generating MIP model m --- modglob.gms(124) 4 Mb --- 292 rows 423 columns 1,391 non-zeroes --- 98 discrete-columns --- modglob.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.042 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 422 columns and 291 rows. 98 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 2.04309e+07 - 0.01 seconds processed model has 289 rows, 389 columns (98 integer) and 935 elements Pass 1: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 17) - solution found of 3.51471e+07 Before mini branch and bound, 68 integers at bound fixed and 201 continuous Full problem 289 rows 389 columns, reduced to 37 rows 65 columns Mini branch and bound improved solution from 3.51471e+07 to 2.07846e+07 (0.01 seconds) Freeing continuous variables gives a solution of 2.07846e+07 Round again with cutoff of 2.07492e+07 Pass 2: obj. 2.70570 --> up = 0 , down = 0 -- rand = 21 ( 21) Pass 3: obj. 0.04208 --> up = 0 , down = 0 -- rand = 6 ( 16) Pass 4: obj. 1.41660 --> up = 0 , down = 1 Pass 5: obj. 0.53277 --> up = 0 , down = 0 -- rand = 2 ( 11) Pass 6: obj. 0.52318 --> up = 0 , down = 0 -- rand = 2 ( 13) Pass 7: obj. 0.09254 --> up = 0 , down = 0 -- rand = 2 ( 15) Pass 8: obj. 1.65343 --> up = 0 , down = 2 perturbation applied Pass 9: obj. 9.85244 --> up = 0 , down = 9 Pass 10: obj. 1.61282 --> up = 0 , down = 0 -- rand = 11 ( 19) Pass 11: obj. 7.33622 --> up = 0 , down = 7 Pass 12: obj. 1.13326 --> up = 0 , down = 0 -- rand = 12 ( 21) Pass 13: obj. 9.91170 --> up = 0 , down = 10 Pass 14: obj. 0.92650 --> up = 0 , down = 0 -- rand = 14 ( 29) Pass 15: obj. 12.31897 --> up = 0 , down = 12 perturbation applied Pass 16: obj. 9.99967 --> up = 0 , down = 9 Pass 17: obj. 1.53611 --> up = 0 , down = 0 -- rand = 14 ( 21) Pass 18: obj. 11.75263 --> up = 0 , down = 12 Pass 19: obj. 1.43432 --> up = 0 , down = 0 -- rand = 12 ( 12) Pass 20: obj. 9.14933 --> up = 0 , down = 9 Pass 21: obj. 1.04432 --> No solution found this major pass Before mini branch and bound, 36 integers at bound fixed and 210 continuous Full problem 289 rows 389 columns, reduced to 48 rows 66 columns Mini branch and bound did not improve solution (0.10 seconds) After 0.10 seconds - Feasibility pump exiting - took 0.10 seconds Integer solution of 2.07846e+07 found by feasibility pump after 0 iterations and 0 nodes (0.10 seconds) Full problem 289 rows 389 columns, reduced to 89 rows 120 columns 88 added rows had average density of 124.284 At root node, 88 cuts changed objective from 2.04309e+07 to 2.06861e+07 in 100 passes Cut generator 0 (Probing) - 9 row cuts (0 active), 2 column cuts in 4.676 seconds - new frequency is 4 Cut generator 1 (Gomory) - 1352 row cuts (30 active), 0 column cuts in 0.252 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.120 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 631 row cuts (13 active), 0 column cuts in 0.032 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 989 row cuts (28 active), 0 column cuts in 0.696 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 177 row cuts (11 active), 0 column cuts in 0.048 seconds - new frequency is -100 After 0 nodes, 1 on tree, 2.07846e+07 best solution, best possible 2.06861e+07 (8.78 seconds) Integer solution of 2.07839e+07 found after 8998 iterations and 563 nodes (12.79 seconds) Full problem 289 rows 389 columns, reduced to 106 rows 145 columns Integer solution of 2.07478e+07 found by combine solutions after 9007 iterations and 564 nodes (13.22 seconds) Integer solution of 2.07452e+07 found by rounding after 11417 iterations and 887 nodes (14.29 seconds) Full problem 289 rows 389 columns, reduced to 108 rows 148 columns After 1000 nodes, 184 on tree, 2.07452e+07 best solution, best possible 2.07051e+07 (15.26 seconds) Integer solution of 2.07405e+07 found by rounding after 13347 iterations and 1164 nodes (15.65 seconds) Full problem 289 rows 389 columns, reduced to 108 rows 148 columns After 2000 nodes, 378 on tree, 2.07405e+07 best solution, best possible 2.0712e+07 (17.92 seconds) After 3000 nodes, 450 on tree, 2.07405e+07 best solution, best possible 2.07178e+07 (19.96 seconds) After 4000 nodes, 501 on tree, 2.07405e+07 best solution, best possible 2.07181e+07 (22.15 seconds) After 5000 nodes, 487 on tree, 2.07405e+07 best solution, best possible 2.07183e+07 (24.13 seconds) After 6000 nodes, 417 on tree, 2.07405e+07 best solution, best possible 2.07254e+07 (25.99 seconds) After 7000 nodes, 268 on tree, 2.07405e+07 best solution, best possible 2.07292e+07 (27.77 seconds) After 8000 nodes, 89 on tree, 2.07405e+07 best solution, best possible 2.0733e+07 (29.48 seconds) Search completed - best objective 20740508.08630824, took 42490 iterations and 8315 nodes (30.03 seconds) Strong branching done 2150 times (23348 iterations), fathomed 45 nodes and fixed 287 variables Maximum depth 40, 3592 variables fixed on reduced cost Cuts at root node changed objective from 2.04309e+07 to 2.06861e+07 Probing was tried 1357 times and created 189 cuts of which 147 were active after adding rounds of cuts (5.432 seconds) Gomory was tried 902 times and created 1713 cuts of which 170 were active after adding rounds of cuts (0.536 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.120 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) MixedIntegerRounding2 was tried 1215 times and created 4843 cuts of which 2287 were active after adding rounds of cuts (0.280 seconds) FlowCover was tried 1215 times and created 1878 cuts of which 427 were active after adding rounds of cuts (0.972 seconds) TwoMirCuts was tried 100 times and created 177 cuts of which 11 were active after adding rounds of cuts (0.048 seconds) Result - Finished objective 20740508.08630824 after 8315 nodes and 42490 iterations - took 30.03 seconds (total time 30.04) Total time 30.05 Solved to optimality. Writing solution. Objective: 2.07405e+07 Time: 30.04 s --- Restarting execution --- modglob.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job modglob.gms Stop 08/21/08 09:36:29 elapsed 0:00:30.247