--- Job st_test5 Start 09/03/08 09:32:20 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_test5.gms(82) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- st_test5.gms(77) 3 Mb --- Generating MINLP model m --- st_test5.gms(82) 5 Mb --- 12 rows 11 columns 112 non-zeroes --- 110 nl-code 7 nl-non-zeroes --- 10 discrete-columns --- st_test5.gms(82) 3 Mb --- Executing BONMIN: elapsed 0:00:00.005 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 -224.664613741445 16 0.024002 NLP0013I 2 OPT -191.7559248998844 11 0.016001 NLP0013I 3 OPT -216.7826480780448 9 0.016001 NLP0013I 4 OPT -188.6197530862571 10 0.024001 NLP0013I 5 INFEAS -233.4516765285962 15 0.080005 NLP0013I 6 OPT -188.6197530862571 10 0.016001 NLP0013I 7 OPT -184.1358024690673 12 0.020001 NLP0013I 8 OPT -185.7555555554756 11 0.016001 NLP0013I 9 OPT -177.9591836733896 10 0.016001 NLP0013I 10 OPT -185.2118334549967 9 0.016001 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -188.62 (0.23 seconds) NLP0013I 11 OPT -185.2118334549967 9 0.012001 NLP0013I 12 INFEAS -188.5271911029496 16 0.032002 NLP0013I 13 OPT -141.1577263955555 11 0.016001 NLP0013I 14 INFEAS -142.9061143984212 16 0.036002 NLP0013I 15 OPT -136.6666666624398 18 0.028002 NLP0013I 16 OPT -136.6666666624398 18 0.024002 NLP0013I 17 INFEAS -133.3470507544569 15 0.032002 NLP0013I 18 OPT -136.6666666666066 10 0.016001 NLP0013I 19 OPT -136.6666666666066 10 0.016001 NLP0013I 20 INFEAS -131.8827160493799 15 0.032002 NLP0012I Num Status Obj It time NLP0013I 21 INFEAS -112.7040036867875 14 0.024002 NLP0013I 22 OPT -177.9591836733896 10 0.012001 NLP0013I 23 OPT -175.5555555535918 18 0.024001 NLP0013I 24 OPT -169.3914782696407 10 0.012 NLP0013I 25 OPT -175.5555555555036 9 0.012 NLP0013I 26 OPT -174.0728945505516 10 0.016001 NLP0013I 27 INFEAS -174.9112426035365 17 0.032002 NLP0013I 28 OPT -131.9065010956404 8 0.012 NLP0013I 29 OPT -131.9065010956404 8 0.012001 NLP0013I 30 INFEAS -155.8641975308659 19 0.040003 NLP0013I 31 OPT -113.333333330936 18 0.028002 NLP0013I 32 OPT -109.99999999997 7 0.012 NLP0012I Num Status Obj It time NLP0013I 1 OPT -110 0 0 Cbc0004I Integer solution of -110 found after 193 iterations and 11 nodes (0.75 seconds) NLP0013I 33 INFEAS -111.1111111111106 16 0.032002 NLP0013I 34 OPT -174.5679012345068 9 0.012 NLP0013I 35 INFEAS -125.0000000000023 13 0.028002 NLP0013I 36 OPT -165.2118334550267 9 0.012001 NLP0013I 37 INFEAS -141.2345679012378 14 0.028002 NLP0013I 38 INFEAS -111.260404280616 13 0.024002 NLP0013I 39 INFEAS -138.7086133333299 16 0.032002 Cbc0001I Search completed - best objective -110, took 283 iterations and 18 nodes (0.93 seconds) Cbc0032I Strong branching done 8 times (190 iterations), fathomed 0 nodes and fixed 4 variables Cbc0035I Maximum depth 4, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = -110.000000. All variables are discrete. Dual variables for fixed problem will be not available. NLP0012I Num Status Obj It time NLP0013I 1 OPT -110 0 0 MINLP solution: -110 (18 nodes, 0.96 seconds) Best possible: -110 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- st_test5.gms(82) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_test5.gms Stop 09/03/08 09:32:21 elapsed 0:00:00.992