--- Job p0033 Start 08/24/08 05:20:15 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 --- 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 Cbc: elapsed 0:00:00.007 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 2520.57 - -0.00 seconds Optimal - objective value 2520.57 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, 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 0 fixed, 0 tightened bounds, 1 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 (2) obj. 2984.67 iterations 6 Pass 2: suminf. 0.38750 (1) obj. 3374.78 iterations 5 Pass 3: suminf. 0.43500 (1) obj. 3359.67 iterations 1 Pass 4: suminf. 0.88500 (2) obj. 3295.27 iterations 4 Pass 5: suminf. 1.74967 (5) obj. 3098.22 iterations 10 Pass 6: suminf. 1.14663 (6) obj. 3121.54 iterations 2 Pass 7: suminf. 0.35750 (2) 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 3261 Pass 8: suminf. 0.38000 (2) obj. 2984.67 iterations 6 Pass 9: suminf. 0.61505 (2) obj. 3261 iterations 5 Pass 10: suminf. 0.68500 (2) obj. 2984.67 iterations 2 Pass 11: suminf. 0.63750 (2) obj. 2999.77 iterations 1 Pass 12: suminf. 0.63234 (2) obj. 3261 iterations 2 Pass 13: suminf. 1.47500 (4) obj. 2973.23 iterations 4 Pass 14: suminf. 1.52500 (4) obj. 3122.55 iterations 5 Pass 15: suminf. 0.47500 (2) obj. 3141.45 iterations 3 Pass 16: suminf. 0.81234 (2) obj. 3261 iterations 2 Pass 17: suminf. 0.71410 (2) obj. 3261 iterations 1 Pass 18: suminf. 1.26526 (5) obj. 3261 iterations 5 Pass 19: suminf. 0.44765 (2) obj. 3261 iterations 4 Pass 20: suminf. 0.63750 (2) obj. 2999.77 iterations 3 Pass 21: suminf. 0.49649 (2) obj. 3261 iterations 2 Pass 22: suminf. 0.40250 (1) obj. 3058 iterations 5 Pass 23: suminf. 0.40250 (1) obj. 3057.99 iterations 1 Pass 24: suminf. 0.38750 (1) obj. 3124.78 iterations 1 Pass 25: suminf. 0.63294 (3) obj. 3261 iterations 10 Pass 26: suminf. 0.52292 (2) obj. 3261 iterations 4 Pass 27: suminf. 0.03750 (1) obj. 3199.93 iterations 3 No solution found this major pass 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 did not improve solution (0.02 seconds) After 0.02 seconds - Feasibility pump exiting with objective of 3302 - took 0.02 seconds Integer solution of 3302 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) Full problem 13 rows 24 columns, reduced to 4 rows 9 columns 11 added rows had average density of 5.81818 At root node, 11 cuts changed objective from 2905.97 to 3089 in 4 passes Cut generator 0 (Probing) - 11 row cuts, 0 column cuts (3 active) in 0.004 seconds - new frequency is 1 Cut generator 1 (Gomory) - 17 row cuts, 0 column cuts (5 active) in 0.000 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 19 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) - 9 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.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 26 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Integer solution of 3089 found after 25 iterations and 0 nodes (0.03 seconds) Optimal - objective value 3089 Optimal - objective value 3089 Search completed - best objective 3089, took 25 iterations and 0 nodes (0.03 seconds) Maximum depth 0, 1 variables fixed on reduced cost Cuts at root node changed objective from 2905.97 to 3089 Probing was tried 4 times and created 11 cuts of which 3 were active after adding rounds of cuts (0.004 seconds) Gomory was tried 4 times and created 17 cuts of which 5 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 4 times and created 19 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 9 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.000 seconds) TwoMirCuts was tried 4 times and created 26 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 Result - Finished objective 3089 after 0 nodes and 25 iterations - took 0.04 seconds (total time 0.04) Total time 0.04 Solved to optimality. MIP solution: 3089 (0 nodes, 0.04 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/24/08 05:20:15 elapsed 0:00:00.068