--- Job m6 Start 09/06/08 10:38:03 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 5 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- m6.gms(392) 2 Mb --- Starting execution: elapsed 0:00:00.004 --- m6.gms(387) 3 Mb --- Generating MINLP model m --- m6.gms(392) 5 Mb --- 158 rows 87 columns 635 non-zeroes --- 85 nl-code 12 nl-non-zeroes --- 30 discrete-columns --- m6.gms(392) 3 Mb --- Executing BONMIN: elapsed 0:00:00.010 GAMS/Bonmin MINLP Solver (Bonmin Library 0.99) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-Hyb yes ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Common Public License (CPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** NLP0012I Num Status Obj It time NLP0013I 1 OPT 1.700074022813877e-10 22 0.040003 Cbc0031I 20 added rows had average density of 44.1 Cbc0013I At root node, 20 cuts changed objective from 0 to 0 in 10 passes Cbc0014I Cut generator 0 (NLP solution based oa cuts) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Mixed Integer Gomory) - 233 row cuts, 0 column cuts (20 active) Cbc0014I Cut generator 2 (Probing) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 3 (Mixed Integer Rounding) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 4 (Cover) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 5 (Clique) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 6 (Flow Covers) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 7 (Outer Approximation decomposition.) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 8 (Outer Approximation feasibility check.) - 0 row cuts, 0 column cuts (0 active) Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.37 seconds) NLP0013I 2 OPT 36.24338298100825 15 0.032002 NLP0013I 3 OPT 74.66879711447399 17 0.036002 NLP0013I 4 OPT 12.24338298098229 16 0.032002 NLP0013I 5 OPT 61.80000000037933 15 0.032002 NLP0013I 6 OPT 25.27950711893824 19 0.040003 NLP0013I 7 OPT 37.80000000031004 13 0.024002 NLP0013I 8 OPT 27.42857142888224 12 0.024002 NLP0013I 9 OPT 19.56483753224249 14 0.032002 NLP0013I 10 OPT 12.24338298098651 17 0.032002 Cbc0010I After 100 nodes, 50 on tree, 1e+50 best solution, best possible 10.606 (2.44 seconds) NLP0013I 11 OPT 45.42857144369935 13 0.024002 NLP0013I 12 OPT 1.700027814356367e-10 11 0.024001 NLP0013I 13 OPT 63.69473684253848 16 0.032002 OA0003I New best feasible of 252.276 found after 2.89218 sec. Cbc0012I Integer solution of 252.276 found by noonlinear programm after 8439 iterations and 172 nodes (2.89 seconds) OA0003I New best feasible of 249.945 found after 2.93218 sec. Cbc0012I Integer solution of 249.945 found by noonlinear programm after 8447 iterations and 174 nodes (2.93 seconds) Cbc0010I After 200 nodes, 71 on tree, 249.945 best solution, best possible 34.6673 (2.99 seconds) OA0003I New best feasible of 223.196 found after 3.09219 sec. Cbc0012I Integer solution of 223.196 found by noonlinear programm after 9179 iterations and 230 nodes (3.09 seconds) OA0003I New best feasible of 218.396 found after 3.1442 sec. Cbc0012I Integer solution of 218.396 found by noonlinear programm after 9201 iterations and 233 nodes (3.14 seconds) Cbc0010I After 300 nodes, 69 on tree, 218.396 best solution, best possible 34.6673 (3.28 seconds) OA0003I New best feasible of 159.386 found after 3.41621 sec. Cbc0012I Integer solution of 159.386 found by noonlinear programm after 10722 iterations and 341 nodes (3.42 seconds) Cbc0010I After 400 nodes, 81 on tree, 159.386 best solution, best possible 34.6673 (3.69 seconds) OA0003I New best feasible of 100.405 found after 3.86424 sec. Cbc0012I Integer solution of 100.405 found by noonlinear programm after 12751 iterations and 459 nodes (3.87 seconds) Cbc0010I After 500 nodes, 70 on tree, 100.405 best solution, best possible 34.6673 (4.11 seconds) Cbc0010I After 600 nodes, 77 on tree, 100.405 best solution, best possible 34.6711 (4.44 seconds) Cbc0010I After 700 nodes, 83 on tree, 100.405 best solution, best possible 34.6711 (4.76 seconds) Cbc0010I After 800 nodes, 81 on tree, 100.405 best solution, best possible 34.6711 (5.10 seconds) Cbc0010I After 900 nodes, 78 on tree, 100.405 best solution, best possible 34.8277 (5.48 seconds) Cbc0010I After 1000 nodes, 82 on tree, 100.405 best solution, best possible 36.2434 (5.85 seconds) Cbc0010I After 1100 nodes, 83 on tree, 100.405 best solution, best possible 36.2434 (6.26 seconds) Cbc0010I After 1200 nodes, 80 on tree, 100.405 best solution, best possible 52.2615 (6.64 seconds) Cbc0010I After 1300 nodes, 84 on tree, 100.405 best solution, best possible 52.2615 (7.04 seconds) Cbc0010I After 1400 nodes, 95 on tree, 100.405 best solution, best possible 52.2615 (7.37 seconds) Cbc0010I After 1500 nodes, 91 on tree, 100.405 best solution, best possible 52.2615 (7.79 seconds) Cbc0010I After 1600 nodes, 98 on tree, 100.405 best solution, best possible 52.2615 (8.24 seconds) Cbc0010I After 1700 nodes, 104 on tree, 100.405 best solution, best possible 52.2615 (8.72 seconds) Cbc0010I After 1800 nodes, 107 on tree, 100.405 best solution, best possible 52.2615 (9.16 seconds) Cbc0010I After 1900 nodes, 116 on tree, 100.405 best solution, best possible 52.2615 (9.54 seconds) Cbc0010I After 2000 nodes, 123 on tree, 100.405 best solution, best possible 52.2615 (9.98 seconds) Cbc0010I After 2100 nodes, 127 on tree, 100.405 best solution, best possible 52.2615 (10.39 seconds) Cbc0010I After 2200 nodes, 131 on tree, 100.405 best solution, best possible 52.2615 (10.76 seconds) OA0003I New best feasible of 82.2569 found after 11.0007 sec. Cbc0012I Integer solution of 82.2569 found by noonlinear programm after 49562 iterations and 2258 nodes (11.00 seconds) Cbc0010I After 2300 nodes, 56 on tree, 82.2569 best solution, best possible 52.2615 (11.11 seconds) Cbc0010I After 2400 nodes, 59 on tree, 82.2569 best solution, best possible 57.4286 (11.71 seconds) Cbc0010I After 2500 nodes, 56 on tree, 82.2569 best solution, best possible 57.4286 (12.09 seconds) Cbc0010I After 2600 nodes, 60 on tree, 82.2569 best solution, best possible 57.4286 (12.74 seconds) Cbc0010I After 2700 nodes, 60 on tree, 82.2569 best solution, best possible 57.4286 (13.06 seconds) Cbc0010I After 2800 nodes, 55 on tree, 82.2569 best solution, best possible 57.4286 (13.37 seconds) Cbc0010I After 2900 nodes, 50 on tree, 82.2569 best solution, best possible 59.8255 (13.75 seconds) Cbc0010I After 3000 nodes, 42 on tree, 82.2569 best solution, best possible 59.8255 (14.12 seconds) Cbc0010I After 3100 nodes, 39 on tree, 82.2569 best solution, best possible 65.2448 (14.48 seconds) Cbc0010I After 3200 nodes, 35 on tree, 82.2569 best solution, best possible 66.8282 (15.02 seconds) Cbc0010I After 3300 nodes, 28 on tree, 82.2569 best solution, best possible 66.8282 (15.49 seconds) Cbc0010I After 3400 nodes, 24 on tree, 82.2569 best solution, best possible 66.8282 (15.88 seconds) Cbc0010I After 3500 nodes, 19 on tree, 82.2569 best solution, best possible 67.0985 (16.41 seconds) Cbc0010I After 3600 nodes, 14 on tree, 82.2569 best solution, best possible 74.6688 (16.97 seconds) Cbc0010I After 3700 nodes, 10 on tree, 82.2569 best solution, best possible 74.6688 (17.55 seconds) Cbc0001I Search completed - best objective 82.25687691424582, took 80472 iterations and 3784 nodes (17.93 seconds) Cbc0032I Strong branching done 458 times (11385 iterations), fathomed 1 nodes and fixed 6 variables Cbc0035I Maximum depth 24, 0 variables fixed on reduced cost NLP solution based oa cuts was tried 218 times and created 1272 cuts of which 69 were active after adding rounds of cuts Mixed Integer Gomory was tried 481 times and created 5623 cuts of which 1498 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 7 times and created 100 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible point. Objective function = 82.256877. Resolve with fixed discrete variables to get dual values. MINLP solution: 82.25687691 (3784 nodes, 17.96 seconds) Best possible: 82.25687691 Absolute gap: 2.1316e-13 Relative gap: 2.5914e-15 GAMS/Bonmin finished. --- Restarting execution --- m6.gms(392) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job m6.gms Stop 09/06/08 10:38:22 elapsed 0:00:18.337