--- Job nvs03 Start 09/03/08 01:43:32
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
--- nvs03.gms(55) 2 Mb
--- Starting execution: elapsed 0:00:00.002
--- nvs03.gms(50) 3 Mb
--- Generating MINLP model m
--- nvs03.gms(55) 5 Mb
---   3 rows  3 columns  7 non-zeroes
---   28 nl-code  3 nl-non-zeroes
---   2 discrete-columns
--- nvs03.gms(55) 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

******************************************************************************
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         8.152139989297531       12       0.016001
NLP0013I     2        OPT         12.44582472002673       6        0.008
NLP0013I     3        OPT         13.25000000001997       10       0.016001
NLP0013I     4        OPT         9.250000000020002       6        0.008001
NLP0013I     5        INFEAS      4.606953465325419       8        0.020001
NLP0013I     6        OPT         9.250000000020002       6        0.012001
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 9.25 (0.07 seconds)
NLP0013I     7        OPT         12.44582472002673       7        0.008
NLP0013I     8        OPT         16.00000000146628       11       0.016001
NLP0013I     9        OPT         16.00000000001          5        0.008001
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         16                      0        0
Cbc0004I Integer solution of 16 found after 29 iterations and 3 nodes (0.10 seconds)
NLP0013I     10       INFEAS      9                       7        0.016001
NLP0013I     11       OPT         13.25000000001997       10       0.012001
NLP0013I     12       OPT         17.00000000002001       6        0.012001
NLP0013I     13       INFEAS      10.0000000000001        8        0.016001
Cbc0001I Search completed - best objective 16, took 60 iterations and 7 nodes (0.16 seconds)
Cbc0032I Strong branching done 2 times (30 iterations), fathomed 0 nodes and fixed 1 variables
Cbc0035I Maximum depth 2, 0 variables fixed on reduced cost

Bonmin finished. Found feasible point. Objective function = 16.000000.
All variables are discrete. Dual variables for fixed problem will be not available.
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         16                      0        0

MINLP solution:                   16   (7 nodes, 0.19 seconds)
Best possible:                    16
Absolute gap:                      0
Relative gap:                      0

GAMS/Bonmin finished.
--- Restarting execution
--- nvs03.gms(55) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job nvs03.gms Stop 09/03/08 01:43:32 elapsed 0:00:00.209