--- Job bienst2 Start 08/21/08 03:37:49 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 --- bienst2.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/bienst2.gdx --- bienst2.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.009 --- bienst2.gms(123) 4 Mb --- Generating MIP model m --- bienst2.gms(124) 4 Mb --- 577 rows 506 columns 2,186 non-zeroes --- 35 discrete-columns --- bienst2.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.022 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 505 columns and 576 rows. 35 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 11.7241 - 0.01 seconds processed model has 576 rows, 505 columns (35 integer) and 2184 elements Pass 1: obj. 5.00000 --> up = 0 , down = 0 -- rand = 17 ( 17) Pass 2: obj. 12.00000 --> up = 0 , down = 16 Pass 3: obj. 4.00000 --> up = 1 , down = 0 Pass 4: obj. 3.00000 --> up = 0 , down = 0 -- rand = 13 ( 15) Pass 5: obj. 10.00000 --> up = 0 , down = 13 perturbation applied Pass 6: obj. 4.00000 --> up = 0 , down = 4 Pass 7: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 11) - solution found of 74.25 Before mini branch and bound, 1 integers at bound fixed and 172 continuous Full problem 576 rows 505 columns, reduced to 387 rows 324 columns - too large Mini branch and bound did not improve solution (0.14 seconds) Round again with cutoff of 67.9974 Pass 8: obj. 5.00000 --> up = 0 , down = 0 -- rand = 17 ( 17) Pass 9: obj. 12.00000 --> up = 0 , down = 16 Pass 10: obj. 4.00000 --> up = 1 , down = 0 Pass 11: obj. 3.00000 --> up = 0 , down = 0 -- rand = 13 ( 15) Pass 12: obj. 10.00000 --> up = 0 , down = 13 perturbation applied Pass 13: obj. 4.00000 --> up = 0 , down = 4 Pass 14: obj. 0.11266 --> up = 0 , down = 0 -- rand = 2 ( 28) Pass 15: obj. 0.03673 --> up = 0 , down = 0 -- rand = 2 ( 26) Pass 16: obj. 0.04104 --> up = 0 , down = 0 -- rand = 2 ( 12) perturbation applied Pass 17: obj. 4.00000 --> up = 1 , down = 3 Pass 18: obj. 0.13943 --> up = 0 , down = 0 -- rand = 5 ( 27) Pass 19: obj. 1.00000 --> up = 0 , down = 1 - solution found of 67.9974 Before mini branch and bound, 0 integers at bound fixed and 116 continuous Full problem 576 rows 505 columns, reduced to 457 rows 386 columns - too large Mini branch and bound did not improve solution (0.41 seconds) After 0.41 seconds - Feasibility pump exiting - took 0.41 seconds Integer solution of 67.5 found by feasibility pump after 0 iterations and 0 nodes (0.45 seconds) Full problem 576 rows 505 columns, reduced to 199 rows 196 columns 56 added rows had average density of 29.2143 At root node, 56 cuts changed objective from 11.7241 to 38.2064 in 12 passes Cut generator 0 (Probing) - 144 row cuts (16 active), 0 column cuts in 0.060 seconds - new frequency is 1 Cut generator 1 (Gomory) - 342 row cuts (16 active), 0 column cuts in 0.020 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.004 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) - 152 row cuts (9 active), 0 column cuts in -0.000 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 115 row cuts (13 active), 0 column cuts in 0.032 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 120 row cuts (2 active), 0 column cuts in 0.016 seconds - new frequency is -100 After 0 nodes, 1 on tree, 67.5 best solution, best possible 38.2064 (2.00 seconds) Integer solution of 65.6 found after 43170 iterations and 130 nodes (10.65 seconds) Full problem 576 rows 505 columns, reduced to 432 rows 361 columns - too large Integer solution of 58 found after 62772 iterations and 242 nodes (12.86 seconds) Full problem 576 rows 505 columns, reduced to 477 rows 406 columns - too large After 1000 nodes, 427 on tree, 58 best solution, best possible 38.5438 (25.99 seconds) After 2000 nodes, 823 on tree, 58 best solution, best possible 38.5438 (43.06 seconds) Integer solution of 56.3333 found after 411140 iterations and 2345 nodes (48.44 seconds) Full problem 576 rows 505 columns, reduced to 522 rows 451 columns - too large After 3000 nodes, 1158 on tree, 56.3333 best solution, best possible 38.5438 (61.08 seconds) After 4000 nodes, 1572 on tree, 56.3333 best solution, best possible 38.5438 (78.48 seconds) After 5000 nodes, 1958 on tree, 56.3333 best solution, best possible 38.5438 (95.07 seconds) After 6000 nodes, 2327 on tree, 56.3333 best solution, best possible 38.5438 (111.85 seconds) After 7000 nodes, 2672 on tree, 56.3333 best solution, best possible 38.5438 (124.45 seconds) After 8000 nodes, 3049 on tree, 56.3333 best solution, best possible 38.5438 (138.82 seconds) After 9000 nodes, 3399 on tree, 56.3333 best solution, best possible 38.5438 (153.65 seconds) After 10000 nodes, 3694 on tree, 56.3333 best solution, best possible 38.5438 (165.36 seconds) After 11000 nodes, 4007 on tree, 56.3333 best solution, best possible 38.5438 (178.01 seconds) After 12000 nodes, 4343 on tree, 56.3333 best solution, best possible 45.4572 (195.22 seconds) After 13000 nodes, 4630 on tree, 56.3333 best solution, best possible 47 (209.42 seconds) After 14000 nodes, 4898 on tree, 56.3333 best solution, best possible 47 (217.98 seconds) After 15000 nodes, 5154 on tree, 56.3333 best solution, best possible 47.8983 (230.01 seconds) After 16000 nodes, 5661 on tree, 56.3333 best solution, best possible 48 (241.42 seconds) After 17000 nodes, 5997 on tree, 56.3333 best solution, best possible 48 (253.34 seconds) After 18000 nodes, 6236 on tree, 56.3333 best solution, best possible 48 (261.98 seconds) After 19000 nodes, 6642 on tree, 56.3333 best solution, best possible 48 (273.42 seconds) After 20000 nodes, 7016 on tree, 56.3333 best solution, best possible 48 (285.55 seconds) After 21000 nodes, 7344 on tree, 56.3333 best solution, best possible 48 (297.84 seconds) After 22000 nodes, 7499 on tree, 56.3333 best solution, best possible 48 (306.23 seconds) After 23000 nodes, 7831 on tree, 56.3333 best solution, best possible 48 (318.51 seconds) After 24000 nodes, 8143 on tree, 56.3333 best solution, best possible 48 (331.47 seconds) After 25000 nodes, 8411 on tree, 56.3333 best solution, best possible 48.3223 (342.61 seconds) Integer solution of 56 found after 3169591 iterations and 25228 nodes (344.28 seconds) Full problem 576 rows 505 columns, reduced to 540 rows 469 columns - too large After 26000 nodes, 8291 on tree, 56 best solution, best possible 48.3223 (349.93 seconds) After 27000 nodes, 8523 on tree, 56 best solution, best possible 48.6667 (361.10 seconds) After 28000 nodes, 8764 on tree, 56 best solution, best possible 48.9931 (371.86 seconds) After 29000 nodes, 8965 on tree, 56 best solution, best possible 49.25 (381.86 seconds) After 30000 nodes, 9006 on tree, 56 best solution, best possible 49.25 (388.52 seconds) After 31000 nodes, 9285 on tree, 56 best solution, best possible 49.4 (400.09 seconds) After 32000 nodes, 9542 on tree, 56 best solution, best possible 49.5 (410.63 seconds) After 33000 nodes, 9724 on tree, 56 best solution, best possible 49.7114 (420.36 seconds) After 34000 nodes, 9749 on tree, 56 best solution, best possible 49.7114 (426.82 seconds) After 35000 nodes, 9919 on tree, 56 best solution, best possible 50 (435.95 seconds) After 36000 nodes, 10042 on tree, 56 best solution, best possible 50.1918 (444.63 seconds) Integer solution of 55.875 found after 4020397 iterations and 36555 nodes (446.76 seconds) Full problem 576 rows 505 columns, reduced to 540 rows 469 columns - too large After 37000 nodes, 9640 on tree, 55.875 best solution, best possible 50.1918 (449.52 seconds) Integer solution of 55.6 found after 4046425 iterations and 37185 nodes (450.78 seconds) Full problem 576 rows 505 columns, reduced to 558 rows 487 columns - too large After 38000 nodes, 9507 on tree, 55.6 best solution, best possible 50.3296 (458.98 seconds) After 39000 nodes, 9607 on tree, 55.6 best solution, best possible 50.5 (467.89 seconds) After 40000 nodes, 9697 on tree, 55.6 best solution, best possible 50.6667 (477.08 seconds) After 41000 nodes, 9891 on tree, 55.6 best solution, best possible 50.7707 (488.82 seconds) Integer solution of 55.25 found after 4387917 iterations and 41750 nodes (493.33 seconds) Full problem 576 rows 505 columns, reduced to 576 rows 505 columns - too large After 42000 nodes, 9351 on tree, 55.25 best solution, best possible 50.825 (495.55 seconds) After 43000 nodes, 9494 on tree, 55.25 best solution, best possible 51 (504.50 seconds) After 44000 nodes, 9653 on tree, 55.25 best solution, best possible 51.0099 (515.55 seconds) After 45000 nodes, 9670 on tree, 55.25 best solution, best possible 51.2 (523.04 seconds) Integer solution of 55.1429 found after 4626644 iterations and 45003 nodes (523.07 seconds) Full problem 576 rows 505 columns, reduced to 576 rows 505 columns - too large After 46000 nodes, 9610 on tree, 55.1429 best solution, best possible 51.2684 (533.39 seconds) After 47000 nodes, 9622 on tree, 55.1429 best solution, best possible 51.4154 (541.29 seconds) After 48000 nodes, 9633 on tree, 55.1429 best solution, best possible 51.5462 (548.67 seconds) After 49000 nodes, 9643 on tree, 55.1429 best solution, best possible 51.6599 (556.07 seconds) Integer solution of 55 found after 4895510 iterations and 49978 nodes (561.02 seconds) Full problem 576 rows 505 columns, reduced to 576 rows 505 columns - too large After 50000 nodes, 9115 on tree, 55 best solution, best possible 51.6655 (561.22 seconds) After 51000 nodes, 9191 on tree, 55 best solution, best possible 51.75 (570.17 seconds) After 52000 nodes, 9154 on tree, 55 best solution, best possible 51.8524 (578.32 seconds) After 53000 nodes, 9062 on tree, 55 best solution, best possible 52 (585.41 seconds) Integer solution of 54.8571 found after 5084379 iterations and 53668 nodes (588.65 seconds) Full problem 576 rows 505 columns, reduced to 576 rows 505 columns - too large After 54000 nodes, 8554 on tree, 54.8571 best solution, best possible 52.0397 (591.02 seconds) After 55000 nodes, 8455 on tree, 54.8571 best solution, best possible 52.1975 (597.94 seconds) After 56000 nodes, 8321 on tree, 54.8571 best solution, best possible 52.3333 (604.94 seconds) After 57000 nodes, 8174 on tree, 54.8571 best solution, best possible 52.4537 (611.50 seconds) After 58000 nodes, 7861 on tree, 54.8571 best solution, best possible 52.4537 (616.07 seconds) After 59000 nodes, 7772 on tree, 54.8571 best solution, best possible 52.5656 (623.69 seconds) After 60000 nodes, 7712 on tree, 54.8571 best solution, best possible 52.6667 (630.67 seconds) After 61000 nodes, 7725 on tree, 54.8571 best solution, best possible 52.6994 (638.06 seconds) After 62000 nodes, 7383 on tree, 54.8571 best solution, best possible 52.6994 (642.48 seconds) After 63000 nodes, 7245 on tree, 54.8571 best solution, best possible 52.8646 (648.90 seconds) After 64000 nodes, 7088 on tree, 54.8571 best solution, best possible 53 (655.49 seconds) After 65000 nodes, 6895 on tree, 54.8571 best solution, best possible 53.1109 (661.71 seconds) After 66000 nodes, 6563 on tree, 54.8571 best solution, best possible 53.1109 (666.08 seconds) After 67000 nodes, 6357 on tree, 54.8571 best solution, best possible 53.25 (672.29 seconds) After 68000 nodes, 6307 on tree, 54.8571 best solution, best possible 53.3165 (680.91 seconds) After 69000 nodes, 6068 on tree, 54.8571 best solution, best possible 53.4213 (686.84 seconds) Integer solution of 54.6 found after 5666475 iterations and 69499 nodes (688.85 seconds) Full problem 576 rows 505 columns, reduced to 576 rows 505 columns - too large After 70000 nodes, 4755 on tree, 54.6 best solution, best possible 53.4807 (691.88 seconds) After 71000 nodes, 4472 on tree, 54.6 best solution, best possible 53.5927 (697.70 seconds) After 72000 nodes, 4177 on tree, 54.6 best solution, best possible 53.6923 (703.41 seconds) After 73000 nodes, 3971 on tree, 54.6 best solution, best possible 53.7706 (710.23 seconds) After 74000 nodes, 3569 on tree, 54.6 best solution, best possible 53.7706 (714.24 seconds) After 75000 nodes, 3248 on tree, 54.6 best solution, best possible 53.8694 (719.89 seconds) After 76000 nodes, 2913 on tree, 54.6 best solution, best possible 53.9877 (725.51 seconds) After 77000 nodes, 2586 on tree, 54.6 best solution, best possible 54.0707 (730.91 seconds) After 78000 nodes, 2152 on tree, 54.6 best solution, best possible 54.071 (734.93 seconds) After 79000 nodes, 1760 on tree, 54.6 best solution, best possible 54.2 (740.30 seconds) After 80000 nodes, 1372 on tree, 54.6 best solution, best possible 54.3022 (745.49 seconds) After 81000 nodes, 964 on tree, 54.6 best solution, best possible 54.4024 (750.57 seconds) After 82000 nodes, 518 on tree, 54.6 best solution, best possible 54.4024 (754.77 seconds) After 83000 nodes, 185 on tree, 54.6 best solution, best possible 54.5357 (760.68 seconds) Search completed - best objective 54.6, took 5989077 iterations and 83391 nodes (762.89 seconds) Strong branching done 590 times (34405 iterations), fathomed 0 nodes and fixed 2 variables Maximum depth 28, 5744 variables fixed on reduced cost Cuts at root node changed objective from 11.7241 to 38.2064 Probing was tried 50551 times and created 358162 cuts of which 161227 were active after adding rounds of cuts (25.374 seconds) Gomory was tried 5070 times and created 7412 cuts of which 3937 were active after adding rounds of cuts (2.476 seconds) Knapsack was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Clique was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 50551 times and created 182151 cuts of which 107718 were active after adding rounds of cuts (15.313 seconds) FlowCover was tried 50551 times and created 2000 cuts of which 880 were active after adding rounds of cuts (0.396 seconds) TwoMirCuts was tried 12 times and created 120 cuts of which 2 were active after adding rounds of cuts (0.016 seconds) Result - Finished objective 54.6 after 83391 nodes and 5989077 iterations - took 762.90 seconds (total time 762.91) Total time 762.96 Solved to optimality. Writing solution. Objective: 54.6 Time: 762.96 s --- Restarting execution --- bienst2.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job bienst2.gms Stop 08/21/08 03:50:41 elapsed 0:12:51.665