--- Job neos1 Start 08/24/08 04:32:18 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 --- neos1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/neos1.gdx --- neos1.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.035 --- neos1.gms(123) 4 Mb --- Generating MIP model m --- neos1.gms(124) 6 Mb --- 5,021 rows 2,113 columns 21,601 non-zeroes --- 2,112 discrete-columns --- neos1.gms(124) 6 Mb --- Executing Cbc: elapsed 0:00:00.121 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 2112 columns and 5020 rows. 2112 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 5.6 - 0.04 seconds Optimal - objective value 5.6 processed model has 1018 rows, 1728 columns (1728 integer) and 8208 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 5.60000 (26) obj. 5.6 iterations 107 Pass 2: suminf. 2.60000 (13) obj. 17.4 iterations 56 Pass 3: suminf. 2.60000 (13) obj. 17.4 iterations 2 Pass 4: suminf. 1.20000 (6) obj. 23 iterations 27 Pass 5: suminf. 1.20000 (6) obj. 23 iterations 8 Pass 6: suminf. 42.85000 (156) obj. 46.8167 iterations 408 Pass 7: suminf. 6.66667 (30) obj. 44.1333 iterations 165 Pass 8: suminf. 6.66667 (30) obj. 44.1333 iterations 23 Pass 9: suminf. 4.20000 (21) obj. 49.2 iterations 17 Pass 10: suminf. 4.20000 (21) obj. 49.2 iterations 0 Pass 11: suminf. 2.60000 (13) obj. 55.6 iterations 9 Pass 12: suminf. 2.60000 (13) obj. 55.6 iterations 0 Pass 13: suminf. 1.20000 (6) obj. 58 iterations 8 Pass 14: suminf. 1.20000 (6) obj. 58 iterations 3 Pass 15: suminf. 41.23333 (155) obj. 72.1333 iterations 319 Pass 16: suminf. 11.46667 (43) obj. 70.4 iterations 162 Pass 17: suminf. 6.46667 (25) obj. 70.0667 iterations 37 Pass 18: suminf. 6.13333 (24) obj. 70.0667 iterations 13 Pass 19: suminf. 3.26667 (15) obj. 72.2 iterations 29 Pass 20: suminf. 3.26667 (15) obj. 72.2 iterations 2 No solution found this major pass Before mini branch and bound, 1372 integers at bound fixed and 0 continuous Full problem 1018 rows 1728 columns, reduced to 323 rows 291 columns Mini branch and bound did not improve solution (0.33 seconds) Full problem 1019 rows 1728 columns, reduced to 1019 rows 1728 columns - too large After 0.38 seconds - Feasibility pump exiting - took 0.38 seconds 402 added rows had average density of 10.8532 At root node, 402 cuts changed objective from 5.6 to 17.7369 in 30 passes Cut generator 0 (Probing) - 1510 row cuts, 0 column cuts (402 active) in 1.064 seconds - new frequency is 1 Cut generator 1 (Gomory) - 1056 row cuts, 0 column cuts (0 active) in 0.552 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 3560 row cuts, 0 column cuts (0 active) in 0.064 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.028 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 460 row cuts, 0 column cuts (0 active) in 0.052 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 569 row cuts, 0 column cuts (0 active) in 0.116 seconds - new frequency is -100 Optimal - objective value 17.7369 Optimal - objective value 17.7369 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 17.7369 (5.16 seconds) Integer solution of 19 found after 17568 iterations and 40 nodes (8.71 seconds) After 1000 nodes, 38 on tree, 19 best solution, best possible 18 (46.72 seconds) Search completed - best objective 19, took 156093 iterations and 1671 nodes (70.78 seconds) Strong branching done 1892 times (15807 iterations), fathomed 1 nodes and fixed 0 variables Maximum depth 58, 11761 variables fixed on reduced cost Cuts at root node changed objective from 5.6 to 17.7369 Probing was tried 2055 times and created 79275 cuts of which 9704 were active after adding rounds of cuts (5.872 seconds) Gomory was tried 2055 times and created 2081 cuts of which 2 were active after adding rounds of cuts (6.752 seconds) Knapsack was tried 2055 times and created 35124 cuts of which 1 were active after adding rounds of cuts (2.800 seconds) Clique was tried 30 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) MixedIntegerRounding2 was tried 2055 times and created 4961 cuts of which 0 were active after adding rounds of cuts (2.920 seconds) FlowCover was tried 30 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) TwoMirCuts was tried 30 times and created 569 cuts of which 0 were active after adding rounds of cuts (0.116 seconds) implication was tried 1117 times and created 187104 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 19 after 1671 nodes and 156093 iterations - took 70.94 seconds (total time 71.00) Total time 71.03 Solved to optimality. MIP solution: 19 (1671 nodes, 71.04 seconds) Best possible: 19 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- neos1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job neos1.gms Stop 08/24/08 04:33:30 elapsed 0:01:11.621