MINLPLib

A Library of Mixed-Integer and Continuous Nonlinear Programming Instances

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

Instance ex4_1_6

Formatsⓘ	ams gms mod nl osil pip py
Primal Bounds (infeas ≤ 1e-08)ⓘ	7. p1 ( gdx sol ) (infeas: 0)
Other points (infeas > 1e-08)ⓘ
Dual Boundsⓘ	6.99999999 (ANTIGONE) 6.99999999 (BARON) 6.99988295 (COUENNE) 7. (LINDO) 6.9999992 (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. Goldstein, A and Price, J, On Descent From Local Minima, Mathematics of Computation, 25, 1971, 569-574.
Sourceⓘ	Test Problem ex4.1.6 of Chapter 4 of Floudas e.a. handbook
Added to libraryⓘ	31 Jul 2001
Problem typeⓘ	NLP
#Variablesⓘ	1
#Binary Variablesⓘ	0
#Integer Variablesⓘ	0
#Nonlinear Variablesⓘ	1
#Nonlinear Binary Variablesⓘ	0
#Nonlinear Integer Variablesⓘ	0
Objective Senseⓘ	min
Objective typeⓘ	polynomial
Objective curvatureⓘ	nonconcave
#Nonzeros in Objectiveⓘ	1
#Nonlinear Nonzeros in Objectiveⓘ	1
#Constraintsⓘ	0
#Linear Constraintsⓘ	0
#Quadratic Constraintsⓘ	0
#Polynomial Constraintsⓘ	0
#Signomial Constraintsⓘ	0
#General Nonlinear Constraintsⓘ	0
Operands in Gen. Nonlin. Functionsⓘ
Constraints curvatureⓘ	linear
#Nonzeros in Jacobianⓘ	0
#Nonlinear Nonzeros in Jacobianⓘ	0
#Nonzeros in (Upper-Left) Hessian of Lagrangianⓘ	1
#Nonzeros in Diagonal of Hessian of Lagrangianⓘ	1
#Blocks in Hessian of Lagrangianⓘ	1
Minimal blocksize in Hessian of Lagrangianⓘ	1
Maximal blocksize in Hessian of Lagrangianⓘ	1
Average blocksize in Hessian of Lagrangianⓘ	1.0
#Semicontinuitiesⓘ	0
#Nonlinear Semicontinuitiesⓘ	0
#SOS type 1ⓘ	0
#SOS type 2ⓘ	0
Minimal coefficientⓘ	4.0000e+00
Maximal coefficientⓘ	2.7000e+01
Infeasibility of initial pointⓘ	0
Sparsity Jacobianⓘ
Sparsity Hessian of Lagrangianⓘ

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


Variables  x1,objvar;

Equations  e1;


e1.. -(POWER(x1,6) - 15*POWER(x1,4) + 27*sqr(x1)) + objvar =E= 250;

* set non-default bounds
x1.lo = -5; x1.up = 5;

* set non-default levels
x1.l = -3;

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;