bench 4 - BARON

VARIABLES             ff;
POSITIVE VARIABLES   a,b,c,d,e,f;
EQUATIONS     OBJ,ineq1,ineq2,ineq3;
OBJ..  ff =E= a/(b+1E-15) + c/(d+1E-15) + e/(f+1E-15) + f/(a+1E-15) + 1e-7*(a+b+c+d+e+f);
ineq1.. a*b =G=0.001;
ineq2.. b*c =G=0.002;
ineq3.. c*d =G=0.003;


MODEL exactGlobalOpt /ALL/;
a.up = 1;
b.up = 1;
c.up = 1;
d.up = 1;
e.up = 1;
f.up = 1;

SOLVE exactGlobalOpt USING NLP MINIMIZING ff;


Output:
GAMS Rev 236  LEX-LEI 23.6.0 x86_64/Linux              08/15/11 12:35:22 Page 1
G e n e r a l   A l g e b r a i c   M o d e l i n g   S y s t e m
C o m p i l a t i o n


COMPILATION TIME     =        0.000 SECONDS      2 Mb  LEX236-236 Nov  4, 2010
GAMS Rev 236  LEX-LEI 23.6.0 x86_64/Linux              08/15/11 12:35:22 Page 2
G e n e r a l   A l g e b r a i c   M o d e l i n g   S y s t e m
Model Statistics    SOLVE exactGlobalOpt Using NLP From line 22


MODEL STATISTICS

BLOCKS OF EQUATIONS           4     SINGLE EQUATIONS            4
BLOCKS OF VARIABLES           7     SINGLE VARIABLES            7
NON ZERO ELEMENTS            13     NON LINEAR N-Z             12
DERIVATIVE POOL               6     CONSTANT POOL              18
CODE LENGTH                  53


GENERATION TIME      =        0.001 SECONDS      3 Mb  LEX236-236 Nov  4, 2010


EXECUTION TIME       =        0.002 SECONDS      3 Mb  LEX236-236 Nov  4, 2010
GAMS Rev 236  LEX-LEI 23.6.0 x86_64/Linux              08/15/11 12:35:22 Page 3
G e n e r a l   A l g e b r a i c   M o d e l i n g   S y s t e m
Solution Report     SOLVE exactGlobalOpt Using NLP From line 22


               S O L V E      S U M M A R Y

     MODEL   exactGlobalOpt      OBJECTIVE  ff
     TYPE    NLP                 DIRECTION  MINIMIZE
     SOLVER  BARON               FROM LINE  22

**** SOLVER STATUS     3 Resource Interrupt
**** MODEL STATUS      2 Locally Optimal
**** OBJECTIVE VALUE                0.0111

 RESOURCE USAGE, LIMIT       1000.000      1000.000
 ITERATION COUNT, LIMIT         0    2000000000
 EVALUATION ERRORS              0             0

GAMS/BARON       BETA  6Nov10 23.6.0 LEX 21006.21007 LEI x86_64/Linux

Branch And Reduce Optimization Navigator
Nikolaos Sahinidis and Mohit Tawarmalani
The Optimization Firm, LLC.

  Total time elapsed:        000:16:40,    in seconds:       1000.00
       on parsing:           000:00:00,    in seconds:          0.00
       on preprocessing:     000:00:00,    in seconds:          0.00
       on navigating:        000:03:13,    in seconds:        193.46
       on relaxed:           000:09:55,    in seconds:        594.68
       on local:             000:02:03,    in seconds:        122.50
       on tightening:        000:01:13,    in seconds:         72.57
       on marginals:         000:00:06,    in seconds:          5.63
       on probing:           000:00:11,    in seconds:         11.16

  Total no. of BaR iterations:21160686
  Best solution found at node:     195
  Max. no. of nodes in memory:     567


===========================================================================
 BARON version 9.0.7. Built: LNX Mon Oct 4 13:04:39 EDT 2010

 Reference:
 Tawarmalani, M. and N. V. Sahinidis, A polyhedral
 branch-and-cut approach to global optimization,
 Mathematical Programming, 103(2), 225-249, 2005.

 BARON is a product of The Optimization Firm, LLC.
 Parts of the BARON software were created at the

Solution      = 0.0111106080672  found at node 195
Best possible = 0.0040002004
Absolute gap  = 0.0071104076672  optca = 1E-9
Relative gap  = 1.77751  optcr = 0.1


                       LOWER     LEVEL     UPPER    MARGINAL

---- EQU OBJ             .         .         .        1.000
---- EQU ineq1          0.001     0.001     +INF       .
---- EQU ineq2          0.002     0.003     +INF       .
---- EQU ineq3          0.003     0.003     +INF       .

                       LOWER     LEVEL     UPPER    MARGINAL

---- VAR ff             -INF      0.011     +INF       .
---- VAR a               .        0.001     1.000      .
---- VAR b               .        1.000     1.000      .
---- VAR c               .        0.003     1.000      .
---- VAR d               .        1.000     1.000      .
---- VAR e               .         .        1.000      .
---- VAR f               .    7.1104E-6     1.000      .


**** REPORT SUMMARY :        0     NONOPT
                             0 INFEASIBLE
                             0  UNBOUNDED
                             0     ERRORS


EXECUTION TIME       =        0.015 SECONDS      2 Mb  LEX236-236 Nov  4, 2010


USER: NEOS Server                                    G100907:1412AS-LNX
      University of Wisconsin-Madison                            DC8499
      License for teaching and research at degree granting institutions

**** ************* BETA release
**** GAMS Base Module BETA  6Nov10 23.6.0 LEX 21006.21007 LEI x86_64/Linux

**** ************* BETA release


**** FILE SUMMARY

Input      /scratch/neos/solver/jobs/2402974/MODEL.gms
Output     /scratch/neos/solver/jobs/2402974/solve.out