--- Job p0033 Start 08/22/08 01:34:26 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- p0033.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p0033.gdx --- p0033.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.004 --- p0033.gms(123) 4 Mb --- Generating MIP model m --- p0033.gms(124) 4 Mb --- 16 rows 34 columns 132 non-zeroes --- 33 discrete-columns --- Executing COINCBC: elapsed 0:00:00.007 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 33 columns and 15 rows. 33 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 2520.57 - -0.00 seconds 2 fixed, 0 tightened bounds, 0 strengthened rows, 1 substitutions 2 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 6 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions processed model has 13 rows, 24 columns (24 integer) and 72 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 0.38000 obj. 2984.67 iterations 6 Pass 2: suminf. 0.38750 obj. 3374.78 iterations 5 Pass 3: suminf. 0.43500 obj. 3359.67 iterations 1 Pass 4: suminf. 0.88500 obj. 3295.27 iterations 4 Pass 5: suminf. 1.74967 obj. 3098.22 iterations 10 Pass 6: suminf. 1.14663 obj. 3121.54 iterations 2 Pass 7: suminf. 0.35750 obj. 3293.38 iterations 5 Solution found of 3347 Before mini branch and bound, 7 integers at bound fixed and 0 continuous Full problem 13 rows 24 columns, reduced to 12 rows 16 columns Mini branch and bound improved solution from 3347 to 3302 (0.01 seconds) Round again with cutoff of 3262.4 Pass 8: suminf. 0.38000 obj. 2984.67 iterations 6 Pass 9: suminf. 0.61226 obj. 3262.4 iterations 5 Pass 10: suminf. 0.68500 obj. 2984.67 iterations 2 Pass 11: suminf. 0.63750 obj. 2999.77 iterations 1 Pass 12: suminf. 0.62955 obj. 3262.4 iterations 2 Pass 13: suminf. 1.47500 obj. 2973.22 iterations 4 Pass 14: suminf. 1.52500 obj. 3122.55 iterations 7 Pass 15: suminf. 0.47500 obj. 3141.45 iterations 3 Pass 16: suminf. 0.80955 obj. 3262.4 iterations 2 Pass 17: suminf. 0.71689 obj. 3262.4 iterations 1 Pass 18: suminf. 1.26247 obj. 3262.4 iterations 5 Pass 19: suminf. 0.44486 obj. 3262.4 iterations 4 Pass 20: suminf. 0.63750 obj. 2999.77 iterations 3 Pass 21: suminf. 0.49370 obj. 3262.4 iterations 2 Pass 22: suminf. 0.40250 obj. 3058 iterations 5 Pass 23: suminf. 0.40250 obj. 3057.99 iterations 1 Pass 24: suminf. 0.38750 obj. 3124.78 iterations 1 Pass 25: suminf. 0.63906 obj. 3262.4 iterations 9 Pass 26: suminf. 0.51960 obj. 3262.4 iterations 3 Pass 27: suminf. 0.03750 obj. 3199.93 iterations 3 Before mini branch and bound, 6 integers at bound fixed and 0 continuous Full problem 13 rows 24 columns, reduced to 13 rows 18 columns Mini branch and bound improved solution from 3302 to 3089 (0.02 seconds) After 0.02 seconds - Feasibility pump exiting with objective of 3089 - took 0.02 seconds Integer solution of 3089 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) Full problem 13 rows 24 columns, reduced to 5 rows 10 columns 9 added rows had average density of 6.33333 At root node, 50 cuts changed objective from 2905.97 to 3088.31 in 2 passes Cut generator 0 (Probing) - 18 row cuts (20 active), 2 column cuts in 0.000 seconds - new frequency is 1 Cut generator 1 (Gomory) - 12 row cuts (7 active), 0 column cuts in 0.000 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 13 row cuts (7 active), 0 column cuts in 0.000 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 7 row cuts (6 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 17 row cuts (10 active), 0 column cuts in 0.000 seconds - new frequency is -100 Search completed - best objective 3089, took 23 iterations and 0 nodes (0.02 seconds) Maximum depth 0, 5 variables fixed on reduced cost Cuts at root node changed objective from 2905.97 to 3088.31 Probing was tried 2 times and created 18 cuts of which 20 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 2 times and created 12 cuts of which 7 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 2 times and created 13 cuts of which 7 were active after adding rounds of cuts (0.000 seconds) Clique was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 2 times and created 7 cuts of which 6 were active after adding rounds of cuts (0.004 seconds) FlowCover was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 2 times and created 17 cuts of which 10 were active after adding rounds of cuts (0.000 seconds) Result - Finished objective 3089 after 0 nodes and 23 iterations - took 0.03 seconds (total time 0.03) Total time 0.03 Solved to optimality. MIP solution: 3089 (0 nodes, 0.03 seconds) Best possible: 3089 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- p0033.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p0033.gms Stop 08/22/08 01:34:26 elapsed 0:00:00.058