--- Job synthes3 Start 09/06/08 02:43:40 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 --- synthes3.gms(108) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- synthes3.gms(103) 3 Mb --- Generating MINLP model m --- synthes3.gms(108) 5 Mb --- 24 rows 18 columns 91 non-zeroes --- 130 nl-code 12 nl-non-zeroes --- 8 discrete-columns --- synthes3.gms(108) 3 Mb --- Executing BONMIN: elapsed 0:00:00.004 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 bonmin.max_consecutive_infeasible = 3 yes bonmin.nlp_failure_behavior = fathom yes bonmin.num_resolve_at_infeasibles = 1 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 15.08218453602923 16 0.024002 NLP0013I 2 OPT 44.15615151526576 16 0.024001 NLP0013I 3 OPT 35.06158193714533 13 0.024002 NLP0013I 4 OPT 35.06158193714589 15 0.024001 NLP0013I 5 OPT 44.15615151526585 14 0.024002 NLP0013I 6 OPT 73.67482452254515 32 0.048003 NLP0013I 7 OPT 24.71102078003692 13 0.020001 NLP0013I 8 OPT 56.55729051603917 10 0.016001 NLP0013I 9 OPT 45.7997185423954 31 0.052003 NLP0013I 10 OPT 30.66640501642819 25 0.036003 NLP0013I 11 OPT 19.47942481572811 6 0.012 NLP0013I 12 OPT 32.19971854254258 17 0.024002 NLP0013I 13 OPT 68.98612676014261 22 0.036002 NLP0013I 14 OPT 17.77506258563528 22 0.028002 NLP0013I 15 OPT 25.06705207350929 13 0.020001 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 15.0822 (0.39 seconds) NLP0013I 16 OPT 45.7997185423954 31 0.052004 NLP0013I 17 OPT 62.85121983034073 23 0.036002 NLP0013I 18 OPT 67.37288595913158 27 0.040002 NLP0013I 19 OPT 68.00974052144549 34 0.060004 NLP0012I Num Status Obj It time NLP0013I 1 OPT 68.00974052143506 7 0.012001 Cbc0004I Integer solution of 68.0097 found after 115 iterations and 4 nodes (0.60 seconds) NLP0013I 20 OPT 73.27798302472752 22 0.032002 NLP0012I Num Status Obj It time NLP0013I 21 OPT 76.4193805407113 35 0.100006 NLP0013I 22 OPT 71.94578940846034 24 0.040003 NLP0013I 23 OPT 56.55729051603917 10 0.016001 NLP0013I 24 OPT 73.67482452254517 30 0.044003 NLP0013I 25 OPT 68.98612676015205 24 0.036002 Cbc0001I Search completed - best objective 68.00974052143506, took 260 iterations and 10 nodes (0.86 seconds) Cbc0032I Strong branching done 7 times (249 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 3, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 68.009741. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 68.00974052143505 7 0.012001 MINLP solution: 68.00974052 (10 nodes, 0.91 seconds) Best possible: 68.00974052 Absolute gap: 1.4211e-14 Relative gap: 2.0895e-16 GAMS/Bonmin finished. --- Restarting execution --- synthes3.gms(108) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job synthes3.gms Stop 09/06/08 02:43:41 elapsed 0:00:01.094