--- Job acc-tight-0 Start 08/23/08 21:28:52 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-0.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-0.gdx --- acc-tight-0.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.028 --- acc-tight-0.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-0.gms(124) 4 Mb --- 1,738 rows 1,621 columns 7,292 non-zeroes --- 1,620 discrete-columns --- acc-tight-0.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.062 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 1620 columns and 1737 rows. 1620 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 0 - 0.16 seconds Optimal - objective value 0 processed model has 1737 rows, 1620 columns (1620 integer) and 7290 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 37.07077 (261) obj. 0 iterations 1894 Pass 2: suminf. 24.00895 (183) obj. 0 iterations 1500 Pass 3: suminf. 20.50000 (124) obj. 0 iterations 892 Pass 4: suminf. 14.36364 (77) obj. 0 iterations 1278 Pass 5: suminf. 13.00000 (26) obj. 0 iterations 394 Pass 6: suminf. 11.00000 (22) obj. 0 iterations 421 Pass 7: suminf. 11.00000 (22) obj. 0 iterations 216 Pass 8: suminf. 11.00000 (22) obj. 0 iterations 211 Pass 9: suminf. 11.00000 (22) obj. 0 iterations 467 Pass 10: suminf. 11.00000 (22) obj. 0 iterations 409 Pass 11: suminf. 11.00000 (22) obj. 0 iterations 493 Pass 12: suminf. 11.00000 (22) obj. 0 iterations 892 Pass 13: suminf. 11.00000 (22) obj. 0 iterations 336 Pass 14: suminf. 11.00000 (22) obj. 0 iterations 688 Pass 15: suminf. 11.00000 (22) obj. 0 iterations 378 Pass 16: suminf. 11.00000 (22) obj. 0 iterations 380 Pass 17: suminf. 11.00000 (22) obj. 0 iterations 494 Pass 18: suminf. 11.00000 (22) obj. 0 iterations 270 Pass 19: suminf. 11.00000 (22) obj. 0 iterations 333 Pass 20: suminf. 11.00000 (22) obj. 0 iterations 393 No solution found this major pass Before mini branch and bound, 1124 integers at bound fixed and 0 continuous Full problem 1737 rows 1620 columns, reduced to 562 rows 445 columns Mini branch and bound did not improve solution (5.40 seconds) After 5.40 seconds - Feasibility pump exiting - took 5.39 seconds 35 added rows had average density of 6.94286 At root node, 35 cuts changed objective from 0 to 0 in 5 passes Cut generator 0 (Probing) - 136 row cuts, 0 column cuts (35 active) in 0.120 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts, 0 column cuts (0 active) in 0.108 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts, 0 column cuts (0 active) in 0.136 seconds - new frequency is -100 Optimal - objective value 0 Optimal - objective value 0 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (6.78 seconds) After 100 nodes, 53 on tree, 1e+50 best solution, best possible 0 (20.83 seconds) After 200 nodes, 105 on tree, 1e+50 best solution, best possible 0 (29.00 seconds) Integer solution of 0 found after 59196 iterations and 222 nodes (29.63 seconds) Search completed - best objective 0, took 59196 iterations and 222 nodes (29.64 seconds) Strong branching done 1660 times (18065 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 39, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 281 times and created 4443 cuts of which 1517 were active after adding rounds of cuts (1.116 seconds) Gomory was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.108 seconds) Knapsack was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) Clique was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) FlowCover was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) TwoMirCuts was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.136 seconds) implication was tried 312 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 0 after 222 nodes and 59196 iterations - took 29.76 seconds (total time 29.92) Total time 29.95 Solved to optimality. MIP solution: 0 (222 nodes, 29.94 seconds) Best possible: 0 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- acc-tight-0.gms(124) 0 Mb --- Reading solution for model m --- acc-tight-0.gms(124) 3 Mb *** Status: Normal completion --- Job acc-tight-0.gms Stop 08/23/08 21:29:22 elapsed 0:00:30.306