--- Job bk4x3 Start 08/24/08 00:22:30 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 --- bk4x3.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/bk4x3.gdx --- bk4x3.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- bk4x3.gms(123) 4 Mb --- Generating MIP model m --- bk4x3.gms(124) 4 Mb --- 20 rows 25 columns 73 non-zeroes --- 12 discrete-columns --- Executing Cbc: elapsed 0:00:00.007 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 24 columns and 19 rows. 12 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 321.667 - -0.00 seconds Optimal - objective value 321.667 processed model has 19 rows, 24 columns (12 integer) and 48 elements Pass 1: suminf. 0.58333 (2) obj. 324.167 iterations 6 Solution found of 360 Before mini branch and bound, 8 integers at bound fixed and 8 continuous Full problem 19 rows 24 columns, reduced to 4 rows 5 columns Mini branch and bound did not improve solution (-0.00 seconds) Round again with cutoff of 356.167 Pass 2: suminf. 0.58333 (2) obj. 324.167 iterations 5 Pass 3: suminf. 0.12778 (1) obj. 356.167 iterations 4 Pass 4: suminf. 0.25000 (1) obj. 337.5 iterations 3 Pass 5: suminf. 0.25000 (1) obj. 337.5 iterations 2 Pass 6: suminf. 0.25000 (1) obj. 337.5 iterations 2 Pass 7: suminf. 1.12126 (4) obj. 356.167 iterations 6 Pass 8: suminf. 0.58333 (2) obj. 344.167 iterations 3 Pass 9: suminf. 0.31667 (2) obj. 356.167 iterations 3 Pass 10: suminf. 0.31667 (2) obj. 356.167 iterations 0 Pass 11: suminf. 0.68333 (2) obj. 356.167 iterations 2 Pass 12: suminf. 0.79444 (2) obj. 356.167 iterations 5 Pass 13: suminf. 0.79444 (2) obj. 356.167 iterations 1 Pass 14: suminf. 0.79444 (2) obj. 356.167 iterations 1 Pass 15: suminf. 0.79444 (2) obj. 356.167 iterations 2 Pass 16: suminf. 1.65000 (4) obj. 356.167 iterations 3 Pass 17: suminf. 0.58333 (2) obj. 344.167 iterations 4 Pass 18: suminf. 0.31667 (2) obj. 356.167 iterations 5 Pass 19: suminf. 0.31667 (2) obj. 356.167 iterations 0 Pass 20: suminf. 0.68333 (2) obj. 356.167 iterations 3 Pass 21: suminf. 0.68333 (2) obj. 356.167 iterations 1 No solution found this major pass Before mini branch and bound, 4 integers at bound fixed and 6 continuous Full problem 19 rows 24 columns, reduced to 8 rows 9 columns Mini branch and bound did not improve solution (0.01 seconds) After 0.01 seconds - Feasibility pump exiting with objective of 360 - took 0.01 seconds Integer solution of 360 found by feasibility pump after 0 iterations and 0 nodes (0.01 seconds) Full problem 19 rows 24 columns, reduced to 0 rows 0 columns 3 added rows had average density of 6 At root node, 3 cuts changed objective from 321.667 to 350 in 2 passes Cut generator 0 (Probing) - 6 row cuts, 3 column cuts (2 active) in 0.000 seconds - new frequency is 1 Cut generator 1 (Gomory) - 3 row cuts, 0 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 6 row cuts, 0 column cuts (0 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) - 2 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) - 3 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Integer solution of 350 found after 11 iterations and 0 nodes (0.01 seconds) Optimal - objective value 350 Optimal - objective value 350 Search completed - best objective 350, took 11 iterations and 0 nodes (0.01 seconds) Maximum depth 0, 1 variables fixed on reduced cost Cuts at root node changed objective from 321.667 to 350 Probing was tried 2 times and created 9 cuts of which 2 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 2 times and created 3 cuts of which 1 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 2 times and created 6 cuts of which 0 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 2 cuts of which 0 were active after adding rounds of cuts (0.000 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 3 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 350 after 0 nodes and 11 iterations - took 0.02 seconds (total time 0.02) Total time 0.02 Solved to optimality. MIP solution: 350 (0 nodes, 0.02 seconds) Best possible: 350 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- bk4x3.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job bk4x3.gms Stop 08/24/08 00:22:30 elapsed 0:00:00.047