MINLPLib

A Library of Mixed-Integer and Continuous Nonlinear Programming Instances

Home // Instances // Documentation // Download // Statistics


Instance: ex14_1_3

Formats ams gms mod nl osil
Primal Bounds
-0.00000000 p1 ( gdx sol )
(infeas: 2e-14)
Dual Bounds
-0.00000000 (ANTIGONE)
-0.00000000 (BARON)
-0.00000000 (COUENNE)
-0.00000000 (LINDO)
-0.00000007 (SCIP)
References Floudas, C A, Pardalos, Panos M, Adjiman, C S, Esposito, W R, Gumus, Zeynep H, Harding, S T, Klepeis, John L, Meyer, Clifford A, and Schweiger, C A, Handbook of Test Problems in Local and Global Optimization, Kluwer Academic Publishers, 1999.
Bullard, L G and Biegler, L T, Iterative Linear-Programming Strategies for Constrained Simulation, Computers and Chemical Engineering, 15:4, 1991, 239-254.
Source Test Problem ex14.1.3 of Chapter 14 of Floudas e.a. handbook
Added to library 31 Jul 2001
Problem type NLP
#Variables 3
#Binary Variables 0
#Integer Variables 0
#Nonlinear Variables 2
#Nonlinear Binary Variables 0
#Nonlinear Integer Variables 0
Objective Sense min
Objective type linear
Objective curvature linear
#Nonzeros in Objective 1
#Nonlinear Nonzeros in Objective 0
#Constraints 4
#Linear Constraints 0
#Quadratic Constraints 2
#Polynomial Constraints 0
#Signomial Constraints 0
#General Nonlinear Constraints 2
Operands in Gen. Nonlin. Functions exp
Constraints curvature indefinite
#Nonzeros in Jacobian 12
#Nonlinear Nonzeros in Jacobian 8
#Nonzeros in (Upper-Left) Hessian of Lagrangian 4
#Nonzeros in Diagonal of Hessian of Lagrangian 2
#Blocks in Hessian of Lagrangian 1
Minimal blocksize in Hessian of Lagrangian 2
Maximal blocksize in Hessian of Lagrangian 2
Average blocksize in Hessian of Lagrangian 2.0
#Semicontinuities 0
#Nonlinear Semicontinuities 0
#SOS type 1 0
#SOS type 2 0
Infeasibility of initial point 0.9999
Sparsity Jacobian Sparsity of Objective Gradient and Jacobian
Sparsity Hessian of Lagrangian Sparsity of Hessian of Lagrangian

$offlisting
*  
*  Equation counts
*      Total        E        G        L        N        X        C        B
*          5        1        0        4        0        0        0        0
*  
*  Variable counts
*                   x        b        i      s1s      s2s       sc       si
*      Total     cont   binary  integer     sos1     sos2    scont     sint
*          4        4        0        0        0        0        0        0
*  FX      0
*  
*  Nonzero counts
*      Total    const       NL      DLL
*         14        6        8        0
*
*  Solve m using NLP minimizing objvar;


Variables  x1,x2,x3,objvar;

Equations  e1,e2,e3,e4,e5;


e1..  - x3 + objvar =E= 0;

e2.. 10000*x1*x2 - x3 =L= 1;

e3.. -10000*x1*x2 - x3 =L= -1;

e4.. exp(-x1) + exp(-x2) - x3 =L= 1.001;

e5.. (-exp(-x1)) - exp(-x2) - x3 =L= -1.001;

* set non-default bounds
x1.lo = 5.49E-6; x1.up = 4.553;
x2.lo = 0.0021961; x2.up = 18.21;

Model m / all /;

m.limrow=0; m.limcol=0;
m.tolproj=0.0;

$if NOT '%gams.u1%' == '' $include '%gams.u1%'

$if not set NLP $set NLP NLP
Solve m using %NLP% minimizing objvar;


Last updated: 2018-09-14 Git hash: ac5a5314
Imprint / Privacy Policy