--- Job st_test6 Start 09/03/08 09:32:21 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 2 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- st_test6.gms(70) 2 Mb --- Starting execution: elapsed 0:00:00.004 --- st_test6.gms(65) 3 Mb --- Generating MINLP model m --- st_test6.gms(70) 5 Mb --- 6 rows 11 columns 57 non-zeroes --- 163 nl-code 10 nl-non-zeroes --- 10 discrete-columns --- st_test6.gms(70) 3 Mb --- Executing BONMIN: elapsed 0:00:00.006 GAMS/Bonmin MINLP Solver (Bonmin Library 0.99) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-BB 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 330.4811564114692 11 0.020002 NLP0013I 2 OPT 362.3664220866735 8 0.012 NLP0013I 3 OPT 375.6316337769791 8 0.012001 NLP0013I 4 OPT 369.5972797099961 11 0.016001 NLP0013I 5 OPT 339.1941386939938 10 0.012001 NLP0013I 6 OPT 411.9632888890191 9 0.012001 NLP0013I 7 OPT 334.8164435219695 9 0.012001 NLP0013I 8 OPT 424.785600000044 9 0.012001 NLP0013I 9 OPT 332.9430127513019 8 0.012001 NLP0013I 10 OPT 333.9716795474868 8 0.012 NLP0013I 11 OPT 431.4580231159085 9 0.012 NLP0013I 12 OPT 330.9381045034815 7 0.012001 NLP0013I 13 OPT 387.3645455218243 10 0.016001 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 330.481 (0.17 seconds) NLP0013I 14 OPT 362.3664220866735 8 0.012001 NLP0013I 15 OPT 375.9425962948126 9 0.016001 NLP0013I 16 OPT 443.7095388965972 9 0.012001 NLP0013I 17 OPT 365.1497163582965 10 0.012 NLP0013I 18 OPT 403.174196408178 7 0.012001 NLP0013I 19 OPT 375.9425962948126 9 0.016001 NLP0013I 20 INFEAS 455.1562499999908 16 0.028002 NLP0012I Num Status Obj It time NLP0013I 21 OPT 434.775702566889 8 0.012001 NLP0013I 22 OPT 437.0331950208194 9 0.016001 NLP0013I 23 OPT 479.0718518562168 7 0.008 NLP0013I 24 INFEAS 478.7812499999969 13 0.024002 NLP0013I 25 OPT 482.4219444450424 7 0.008001 NLP0013I 26 OPT 482.4219444450424 7 0.008 NLP0013I 27 OPT 492.5555555558233 6 0.012001 NLP0013I 28 INFEAS 490.9366087345172 13 0.024002 NLP0013I 29 OPT 443.3472222222946 9 0.012001 NLP0013I 30 INFEAS 428.2222222222235 16 0.036002 NLP0013I 31 INFEAS 483.031249999998 15 0.032002 NLP0013I 32 INFEAS 476.974868993144 13 0.028002 NLP0013I 33 OPT 443.7095388965972 9 0.012 NLP0013I 34 OPT 466.8396345029986 11 0.016001 NLP0013I 35 INFEAS 420.0555555555579 15 0.028001 NLP0013I 36 OPT 595.8629358655666 8 0.012 NLP0013I 37 OPT 616.0597566372055 9 0.012001 NLP0013I 38 OPT 618.9219444444775 8 0.012001 NLP0013I 39 INFEAS 572.9999999999989 14 0.028002 NLP0013I 40 INFEAS 535.6250000000042 17 0.036002 NLP0012I Num Status Obj It time NLP0013I 41 INFEAS 505.3192606595244 17 0.036002 NLP0013I 42 OPT 375.6316337769791 8 0.012001 NLP0013I 43 OPT 405.8765432099798 11 0.016001 NLP0013I 44 OPT 453.1577503430227 12 0.016001 NLP0013I 45 INFEAS 404.5432098765457 13 0.028002 NLP0013I 46 INFEAS 568.8293206941273 14 0.028002 NLP0013I 47 OPT 465.0574705882975 9 0.012001 NLP0013I 48 OPT 471.0000000000551 11 0.016001 NLP0012I Num Status Obj It time NLP0013I 1 OPT 471 0 0 Cbc0004I Integer solution of 471 found after 322 iterations and 28 nodes (0.85 seconds) NLP0013I 49 OPT 557.7541286828598 7 0.012001 NLP0013I 50 OPT 452.1845348306397 11 0.016001 NLP0013I 51 INFEAS 414.4765432098752 18 0.036002 NLP0013I 52 INFEAS 566.8622845981149 13 0.024002 Cbc0001I Search completed - best objective 471, took 371 iterations and 32 nodes (0.94 seconds) Cbc0032I Strong branching done 9 times (161 iterations), fathomed 0 nodes and fixed 1 variables Cbc0035I Maximum depth 6, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 471.000000. All variables are discrete. Dual variables for fixed problem will be not available. NLP0012I Num Status Obj It time NLP0013I 1 OPT 471 0 0 MINLP solution: 471 (32 nodes, 0.96 seconds) Best possible: 471 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- st_test6.gms(70) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_test6.gms Stop 09/03/08 09:32:22 elapsed 0:00:01.002