--- Job acc-tight-5 Start 07/17/08 11:56:17 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 --- acc-tight-5.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-5.gdx --- acc-tight-5.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.052 --- acc-tight-5.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-5.gms(124) 5 Mb --- 3,250 rows 1,621 columns 16,787 non-zeroes --- 1,620 discrete-columns --- acc-tight-5.gms(124) 5 Mb --- Executing Cbc: elapsed 0:00:00.115 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Reading parameter(s) from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" >> threads 2 Finished reading from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" Problem statistics: 1620 columns and 3249 rows. 1620 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jul 15 2008 command line - GAMS/CBC -threads 2 -solve -quit threads was changed from 0 to 2 Continuous objective value is 0 - 1.12 seconds 0 fixed, 0 tightened bounds, 0 strengthened rows, 238 substitutions processed model has 3487 rows, 1620 columns (1620 integer) and 17261 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: (1.75 seconds) suminf. 71.44223 obj. 0 iterations 4063 Pass 2: (2.66 seconds) suminf. 55.25003 obj. 0 iterations 2249 Pass 3: (3.64 seconds) suminf. 48.53360 obj. 0.00255209 iterations 2200 Pass 4: (3.94 seconds) suminf. 48.30300 obj. 0.00205266 iterations 553 Pass 5: (5.51 seconds) suminf. 47.26623 obj. 0 iterations 3408 Pass 6: (6.25 seconds) suminf. 43.94294 obj. 0 iterations 1668 Pass 7: (6.88 seconds) suminf. 39.55149 obj. 0.0567064 iterations 1473 Pass 8: (7.68 seconds) suminf. 37.61289 obj. 0.0335653 iterations 1833 Pass 9: (8.26 seconds) suminf. 36.76747 obj. 0 iterations 1298 Pass 10: (9.22 seconds) suminf. 37.21252 obj. 0 iterations 2257 Pass 11: (9.83 seconds) suminf. 35.87040 obj. 0.00973357 iterations 1485 Pass 12: (10.73 seconds) suminf. 36.17038 obj. 0 iterations 2104 Pass 13: (11.08 seconds) suminf. 35.83040 obj. 0 iterations 748 Pass 14: (11.92 seconds) suminf. 35.04352 obj. 0 iterations 1998 Pass 15: (12.76 seconds) suminf. 32.29806 obj. 0 iterations 2030 Pass 16: (13.18 seconds) suminf. 31.78362 obj. 0 iterations 1001 Pass 17: (13.98 seconds) suminf. 33.21093 obj. 0 iterations 1865 Pass 18: (14.53 seconds) suminf. 31.77648 obj. 0 iterations 1344 Pass 19: (14.67 seconds) suminf. 31.75854 obj. 0 iterations 255 Pass 20: (15.46 seconds) suminf. 32.85050 obj. 0 iterations 1806 No solution found this major pass Before mini branch and bound, 244 integers at bound fixed and 0 continuous Full problem 3487 rows 1620 columns, reduced to 2859 rows 1317 columns - too large Mini branch and bound did not improve solution (16.01 seconds) After 16.01 seconds - Feasibility pump exiting - took 16.01 seconds 121 added rows had average density of 478.264 At root node, 121 cuts changed objective from 0 to 0 in 3 passes Cut generator 0 (Probing) - 822 row cuts (82 active), 0 column cuts in 0.116 seconds - new frequency is 1 Cut generator 1 (Gomory) - 454 row cuts (39 active), 0 column cuts in 1.084 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 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.008 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.484 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (52.92 seconds) After 100 nodes, 50 on tree, 1e+50 best solution, best possible 0 (296.09 seconds) After 200 nodes, 100 on tree, 1e+50 best solution, best possible 0 (469.01 seconds) After 300 nodes, 119 on tree, 1e+50 best solution, best possible 0 (537.23 seconds) Cbc0004I Integer solution of 0 found after 294476 iterations and 340 nodes (555.04 seconds) Thread 0 used 177 times, waiting to start 0.0254603, 1211 locks, 0.0885218 locked, 0.206377 waiting for locks Thread 1 used 164 times, waiting to start 7.87907, 1130 locks, 0.424336 locked, 0.00229972 waiting for locks Main thread 255.928 waiting for threads, 694 locks, 0.00959464 locked, 0.00134793 waiting for locks Search completed - best objective 0, took 295524 iterations and 341 nodes (555.05 seconds) Strong branching done 5080 times (496569 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 45, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 168 times and created 2928 cuts of which 547 were active after adding rounds of cuts (1.252 seconds) Gomory was tried 168 times and created 1459 cuts of which 122 were active after adding rounds of cuts (9.717 seconds) Knapsack was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.072 seconds) Clique was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.048 seconds) MixedIntegerRounding2 was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.060 seconds) FlowCover was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) TwoMirCuts was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (1.452 seconds) Result - Finished objective 0 after 341 nodes and 295524 iterations - took 555.63 seconds (total time 556.76) Total time 556.96 Solved to optimality. wallclocktime: 313.078 used seconds: 556.97 MIP solution: 0 (341 nodes, 556.97 seconds) Best possible: 0 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- acc-tight-5.gms(124) 0 Mb --- Reading solution for model m --- acc-tight-5.gms(124) 3 Mb *** Status: Normal completion --- Job acc-tight-5.gms Stop 07/17/08 12:01:31 elapsed 0:05:13.233