MINLPLib
A Library of Mixed-Integer and Continuous Nonlinear Programming Instances
Home // Instances // Documentation // Download // Statistics
Instance st_test1
Formatsⓘ | ams gms lp mod nl osil pip py |
Primal Bounds (infeas ≤ 1e-08)ⓘ | |
Other points (infeas > 1e-08)ⓘ | |
Dual Boundsⓘ | 0.00000000 (ALPHAECP) -0.00000000 (ANTIGONE) -0.00000000 (BARON) 0.00000000 (BONMIN) 0.00000000 (COUENNE) 0.00000000 (CPLEX) 0.00000000 (GUROBI) 0.00000000 (LINDO) 0.00000000 (SCIP) 0.00000000 (SHOT) |
Referencesⓘ | Tawarmalani, M and Sahinidis, N V, Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, Kluwer, 2002. Shectman, J P, Finite Algorithms for Global Optimization of Concave Programs and General Quadratic Programs, PhD thesis, Department of Mechanical and Industrial Engineering, University of Illinois, Urbana Champagne, 1999. |
Sourceⓘ | BARON book instance iqp/test1 |
Added to libraryⓘ | 01 Sep 2002 |
Problem typeⓘ | IQP |
#Variablesⓘ | 5 |
#Binary Variablesⓘ | 0 |
#Integer Variablesⓘ | 5 |
#Nonlinear Variablesⓘ | 4 |
#Nonlinear Binary Variablesⓘ | 0 |
#Nonlinear Integer Variablesⓘ | 4 |
Objective Senseⓘ | min |
Objective typeⓘ | quadratic |
Objective curvatureⓘ | convex |
#Nonzeros in Objectiveⓘ | 5 |
#Nonlinear Nonzeros in Objectiveⓘ | 4 |
#Constraintsⓘ | 1 |
#Linear Constraintsⓘ | 1 |
#Quadratic Constraintsⓘ | 0 |
#Polynomial Constraintsⓘ | 0 |
#Signomial Constraintsⓘ | 0 |
#General Nonlinear Constraintsⓘ | 0 |
Operands in Gen. Nonlin. Functionsⓘ | |
Constraints curvatureⓘ | linear |
#Nonzeros in Jacobianⓘ | 5 |
#Nonlinear Nonzeros in Jacobianⓘ | 0 |
#Nonzeros in (Upper-Left) Hessian of Lagrangianⓘ | 4 |
#Nonzeros in Diagonal of Hessian of Lagrangianⓘ | 4 |
#Blocks in Hessian of Lagrangianⓘ | 4 |
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ⓘ | 5.0000e+01 |
Infeasibility of initial pointⓘ | 0 |
Sparsity Jacobianⓘ | |
Sparsity Hessian of Lagrangianⓘ |
$offlisting * * Equation counts * Total E G L N X C B * 2 1 0 1 0 0 0 0 * * Variable counts * x b i s1s s2s sc si * Total cont binary integer sos1 sos2 scont sint * 6 1 0 5 0 0 0 0 * FX 0 * * Nonzero counts * Total const NL DLL * 11 7 4 0 * * Solve m using MINLP minimizing objvar; Variables i1,i2,i3,i4,i5,objvar; Integer Variables i1,i2,i3,i4,i5; Equations e1,e2; e1.. 20*i1 + 12*i2 + 11*i3 + 7*i4 + 4*i5 =L= 40; e2.. -(50*i1*i1 + 42*i1 + 50*i2*i2 - 44*i2 + 50*i4*i4 - 47*i4 + 50*i5*i5 - 47.5 *i5) - 45*i3 + objvar =E= 0; * set non-default bounds i1.up = 1; i2.up = 1; i3.up = 1; i4.up = 1; i5.up = 1; Model m / all /; m.limrow=0; m.limcol=0; m.tolproj=0.0; $if NOT '%gams.u1%' == '' $include '%gams.u1%' $if not set MINLP $set MINLP MINLP Solve m using %MINLP% minimizing objvar;
Last updated: 2024-12-17 Git hash: 8eaceb91