--- Job acc-tight-1 Start 08/23/08 21:29:22 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-1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-1.gdx --- acc-tight-1.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.025 --- acc-tight-1.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-1.gms(124) 5 Mb --- 2,521 rows 1,621 columns 15,329 non-zeroes --- 1,620 discrete-columns --- acc-tight-1.gms(124) 5 Mb --- Executing Cbc: elapsed 0:00:00.079 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 1620 columns and 2520 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.35 seconds Optimal - objective value 0 processed model has 2520 rows, 1620 columns (1620 integer) and 15327 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 58.49442 (354) obj. 0 iterations 2636 Pass 2: suminf. 44.53398 (351) obj. 0 iterations 1163 Pass 3: suminf. 37.92154 (313) obj. 0 iterations 1038 Pass 4: suminf. 34.02753 (301) obj. 0 iterations 851 Pass 5: suminf. 32.95075 (289) obj. 0 iterations 903 Pass 6: suminf. 31.54724 (317) obj. 0 iterations 651 Pass 7: suminf. 29.62802 (321) obj. 0.00927796 iterations 618 Pass 8: suminf. 24.17482 (312) obj. 0 iterations 1287 Pass 9: suminf. 18.98529 (327) obj. 0 iterations 2058 Pass 10: suminf. 15.91584 (272) obj. 0 iterations 1111 Pass 11: suminf. 13.33175 (295) obj. 0 iterations 1493 Pass 12: suminf. 13.51474 (267) obj. 0 iterations 280 Pass 13: suminf. 13.51474 (267) obj. 0 iterations 0 Pass 14: suminf. 83.27157 (376) obj. 0 iterations 2561 Pass 15: suminf. 44.20298 (272) obj. 0 iterations 2281 Pass 16: suminf. 35.39022 (278) obj. 0 iterations 2025 Pass 17: suminf. 26.04323 (324) obj. 0 iterations 1426 Pass 18: suminf. 23.90187 (337) obj. 0 iterations 1057 Pass 19: suminf. 23.90187 (337) obj. 0 iterations 0 Pass 20: suminf. 61.80448 (374) obj. 0 iterations 2305 No solution found this major pass Before mini branch and bound, 367 integers at bound fixed and 0 continuous Full problem 2520 rows 1620 columns, reduced to 2178 rows 1253 columns - too large Mini branch and bound did not improve solution (7.59 seconds) After 7.59 seconds - Feasibility pump exiting - took 7.59 seconds 50 added rows had average density of 6.04 At root node, 50 cuts changed objective from 0 to 0 in 10 passes Cut generator 0 (Probing) - 354 row cuts, 0 column cuts (50 active) in 0.488 seconds - new frequency is 1 Cut generator 1 (Gomory) - 5 row cuts, 0 column cuts (0 active) in 0.380 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.040 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 5 row cuts, 0 column cuts (0 active) in 0.320 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 (11.06 seconds) After 100 nodes, 53 on tree, 1e+50 best solution, best possible 0 (50.64 seconds) After 200 nodes, 107 on tree, 1e+50 best solution, best possible 0 (73.44 seconds) Integer solution of 0 found after 141874 iterations and 260 nodes (78.60 seconds) Search completed - best objective 0, took 141874 iterations and 260 nodes (78.60 seconds) Strong branching done 1878 times (19826 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 61, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 346 times and created 9910 cuts of which 3415 were active after adding rounds of cuts (3.648 seconds) Gomory was tried 10 times and created 5 cuts of which 0 were active after adding rounds of cuts (0.380 seconds) Knapsack was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) Clique was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) MixedIntegerRounding2 was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.040 seconds) FlowCover was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) TwoMirCuts was tried 10 times and created 5 cuts of which 0 were active after adding rounds of cuts (0.320 seconds) implication was tried 342 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 0 after 260 nodes and 141874 iterations - took 78.82 seconds (total time 79.17) Total time 79.20 Solved to optimality. MIP solution: 0 (260 nodes, 79.2 seconds) Best possible: 0 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- acc-tight-1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job acc-tight-1.gms Stop 08/23/08 21:30:42 elapsed 0:01:19.589