--- Job gen Start 08/24/08 02:13:36 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 --- gen.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/gen.gdx --- gen.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.011 --- gen.gms(123) 4 Mb --- Generating MIP model m --- gen.gms(124) 4 Mb --- 781 rows 871 columns 3,175 non-zeroes --- 150 discrete-columns --- gen.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.029 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 870 columns and 780 rows. 150 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 112130 - 0.01 seconds Optimal - objective value 112130 36 fixed, 0 tightened bounds, 9 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 6 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 6 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions processed model has 473 rows, 644 columns (108 integer) and 1659 elements Pass 1: suminf. 0.58491 (2) obj. 112333 iterations 33 Solution found of 112597 Before mini branch and bound, 100 integers at bound fixed and 488 continuous Full problem 473 rows 644 columns, reduced to 19 rows 30 columns Mini branch and bound improved solution from 112597 to 112393 (0.02 seconds) Freeing continuous variables gives a solution of 112347 Round again with cutoff of 112339 Pass 2: suminf. 0.58491 (2) obj. 112304 iterations 44 Pass 3: suminf. 0.00000 (0) obj. 112339 iterations 30 Solution found of 112339 Before mini branch and bound, 100 integers at bound fixed and 484 continuous Full problem 473 rows 644 columns, reduced to 19 rows 32 columns Mini branch and bound improved solution from 112339 to 112337 (0.03 seconds) After 0.03 seconds - Feasibility pump exiting with objective of 112337 - took 0.03 seconds Integer solution of 112337 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) Full problem 473 rows 644 columns, reduced to 60 rows 207 columns 8 added rows had average density of 6.25 At root node, 8 cuts changed objective from 112271 to 112313 in 4 passes Cut generator 0 (Probing) - 1 row cuts, 7 column cuts (1 active) in 0.004 seconds - new frequency is 1 Cut generator 1 (Gomory) - 5 row cuts, 0 column cuts (4 active) in 0.000 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 15 row cuts, 0 column cuts (3 active) in 0.000 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 14 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 24 row cuts, 0 column cuts (0 active) in -0.000 seconds - new frequency is -100 Integer solution of 112313 found after 70 iterations and 0 nodes (0.06 seconds) Optimal - objective value 112313 Optimal - objective value 112313 Search completed - best objective 112313.362718, took 70 iterations and 0 nodes (0.06 seconds) Maximum depth 0, 55 variables fixed on reduced cost Cuts at root node changed objective from 112271 to 112313 Probing was tried 4 times and created 8 cuts of which 1 were active after adding rounds of cuts (0.004 seconds) Gomory was tried 2 times and created 5 cuts of which 4 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 4 times and created 15 cuts of which 3 were active after adding rounds of cuts (0.000 seconds) Clique was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 4 times and created 14 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 2 times and created 24 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) implication was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts 100 bounds tightened after postprocessing Result - Finished objective 112313.362718 after 0 nodes and 70 iterations - took 0.14 seconds (total time 0.16) Total time 0.19 Solved to optimality. MIP solution: 112313.3627 (0 nodes, 0.19 seconds) Best possible: 112313.3627 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- gen.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job gen.gms Stop 08/24/08 02:13:37 elapsed 0:00:00.273