--- Job pb302095 Start 09/03/08 03:53:39 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 --- pb302095.gms(75800) 23 Mb --- Starting execution: elapsed 0:00:01.633 --- pb302095.gms(75795) 24 Mb --- Generating MINLP model m --- pb302095.gms(75800) 71 Mb --- 51 rows 601 columns 1,801 non-zeroes --- 3,639,603 nl-code 600 nl-non-zeroes --- 600 discrete-columns --- pb302095.gms(75800) 55 Mb --- Executing BONMIN: elapsed 0:00:04.415 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 4157652.726384871 19 953.316 NLP0013I 2 OPT 4165539.242642419 20 1006.14 NLP0013I 3 OPT 4164381.785150033 27 1357.28 NLP0013I 4 INFEAS 4164382.902411812 13 652.677 NLP0013I 5 INFEAS 6738132.0720609 0 0.180011 Cbc0003I Exiting on maximum nodes Cbc0005I Partial search - best objective 1e+50 (best possible 4.15765e+06), took 0 iterations and 0 nodes (3016.43 seconds) Cbc0032I Strong branching done 2 times (60 iterations), fathomed 1 nodes and fixed 0 variables Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost NLP0013I 6 INFEAS 0 0 0 Time limit exceeded. Bonmin finished. No feasible point found. Best possible: 4157652.726 GAMS/Bonmin finished. --- Restarting execution --- pb302095.gms(75800) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job pb302095.gms Stop 09/03/08 05:00:54 elapsed 1:07:14.558