--- Job mod010 Start 08/24/08 04:28:42 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 --- mod010.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mod010.gdx --- mod010.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.019 --- mod010.gms(123) 4 Mb --- Generating MIP model m --- mod010.gms(124) 5 Mb --- 147 rows 2,656 columns 13,859 non-zeroes --- 2,655 discrete-columns --- mod010.gms(124) 5 Mb --- Executing Cbc: elapsed 0:00:00.059 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 2655 columns and 146 rows. 2655 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 6532.08 - 0.05 seconds Optimal - objective value 6532.08 27 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 83 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 144 rows, 2572 columns (2572 integer) and 10760 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 6.00000 (12) obj. 6729 iterations 200 Pass 2: suminf. 5.00000 (10) obj. 6727.5 iterations 103 Pass 3: suminf. 0.00000 (0) obj. 6921 iterations 255 Solution found of 6921 Before mini branch and bound, 2520 integers at bound fixed and 0 continuous Full problem 144 rows 2572 columns, reduced to 18 rows 22 columns Mini branch and bound did not improve solution (0.10 seconds) Round again with cutoff of 6881 Reduced cost fixing fixed 85 variables on major pass 2 Pass 4: suminf. 2.28571 (17) obj. 6623.29 iterations 251 Pass 5: suminf. 1.00000 (8) obj. 6588.5 iterations 69 Pass 6: suminf. 1.00000 (8) obj. 6588.5 iterations 0 Pass 7: suminf. 9.89991 (48) obj. 6881 iterations 499 Solution found of 6769 Before mini branch and bound, 2465 integers at bound fixed and 0 continuous Full problem 144 rows 2572 columns, reduced to 40 rows 64 columns Mini branch and bound improved solution from 6769 to 6548 (0.22 seconds) After 0.22 seconds - Feasibility pump exiting with objective of 6548 - took 0.22 seconds Integer solution of 6548 found by feasibility pump after 0 iterations and 0 nodes (0.22 seconds) Full problem 144 rows 2572 columns, reduced to 0 rows 0 columns Full problem 144 rows 2572 columns, reduced to 44 rows 362 columns 2 added rows had average density of 81 At root node, 6 cuts changed objective from 6532.08 to 6548 in 1 passes Cut generator 0 (Probing) - 2 row cuts, 85 column cuts (6 active) in 0.008 seconds - new frequency is 1 Cut generator 1 (Gomory) - 39 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in -0.000 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in -0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in -0.000 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in -0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 2 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Optimal - objective value 6548 Optimal - objective value 6548 Search completed - best objective 6548, took 10 iterations and 0 nodes (0.30 seconds) Maximum depth 0, 2055 variables fixed on reduced cost Cuts at root node changed objective from 6532.08 to 6548 Probing was tried 1 times and created 87 cuts of which 6 were active after adding rounds of cuts (0.008 seconds) Gomory was tried 1 times and created 39 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Knapsack was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) Clique was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) TwoMirCuts was tried 1 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Result - Finished objective 6548 after 0 nodes and 10 iterations - took 0.66 seconds (total time 0.71) Total time 0.72 Solved to optimality. MIP solution: 6548 (0 nodes, 0.73 seconds) Best possible: 6548 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- mod010.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job mod010.gms Stop 08/24/08 04:28:43 elapsed 0:00:00.849