--- Job st_miqp1 Start 09/03/08 09:32:19
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_miqp1.gms(55) 2 Mb
--- Starting execution: elapsed 0:00:00.002
--- st_miqp1.gms(50) 3 Mb
--- Generating MINLP model m
--- st_miqp1.gms(55) 5 Mb
---   2 rows  6 columns  11 non-zeroes
---   83 nl-code  5 nl-non-zeroes
---   5 discrete-columns
--- st_miqp1.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         240.0656687899611       8        0.012001
NLP0013I     2        OPT         244.6200754717416       7        0.008
NLP0013I     3        OPT         271.0125283019762       7        0.008
NLP0013I     4        OPT         297.5015192308118       8        0.012001
NLP0013I     5        OPT         246.2503626943434       7        0.008001
NLP0013I     6        OPT         320.2500000000568       10       0.036002
NLP0013I     7        OPT         242.3998823529838       7        0.036002
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 240.066 (0.12 seconds)
NLP0013I     8        OPT         242.3998823529838       7        0.016001
NLP0013I     9        OPT         260.8250000105452       7        0.008
NLP0013I     10       INFEAS      383.4999999999972       13       0.028002
NLP0013I     11       OPT         281.00000000002         6        0.008001
NLP0013I     12       OPT         281.00000000002         6        0.008
NLP0012I 
              Num      Status      Obj             It       time
NLP0013I     1        OPT         281                     0        0
Cbc0004I Integer solution of 281 found after 20 iterations and 2 nodes (0.20 seconds)
NLP0013I     13       OPT         297.5015192307977       8        0.012001
NLP0013I     14       OPT         320.2500000000568       10       0.012001
Cbc0001I Search completed - best objective 281, took 38 iterations and 4 nodes (0.22 seconds)
Cbc0032I Strong branching done 4 times (65 iterations), fathomed 0 nodes and fixed 1 variables
Cbc0035I Maximum depth 1, 0 variables fixed on reduced cost

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

MINLP solution:                  281   (4 nodes, 0.24 seconds)
Best possible:                   281
Absolute gap:                      0
Relative gap:                      0

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