--- Job pb351535 Start 09/03/08 05:00:54 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 --- pb351535.gms(57055) 18 Mb --- Starting execution: elapsed 0:00:01.205 --- pb351535.gms(57050) 18 Mb --- Generating MINLP model m --- pb351535.gms(57055) 55 Mb --- 51 rows 526 columns 1,576 non-zeroes --- 2,751,528 nl-code 525 nl-non-zeroes --- 525 discrete-columns --- pb351535.gms(57055) 42 Mb --- Executing BONMIN: elapsed 0:00:03.199 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 4352354.960020379 22 632.248 NLP0013I 2 OPT 4355891.400909591 26 743.494 NLP0013I 3 OPT 4365608.663110145 59 1689.63 NLP0013I 4 INFEAS 4366031.028445234 32 915.877 NLP0013I 5 INFEAS 6794766.040336621 0 0.136009 Cbc0003I Exiting on maximum nodes Cbc0005I Partial search - best objective 1e+50 (best possible 4.35235e+06), took 0 iterations and 0 nodes (3349.25 seconds) Cbc0032I Strong branching done 2 times (117 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: 4352354.96 GAMS/Bonmin finished. --- Restarting execution --- pb351535.gms(57055) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job pb351535.gms Stop 09/03/08 06:07:56 elapsed 1:07:02.399