MINLPLib
A Library of Mixed-Integer and Continuous Nonlinear Programming Instances
Home // Instances // Documentation // Download // Statistics
Instance st_qpk2
| Formatsⓘ | ams gms lp mod nl osil pip py |
| Primal Bounds (infeas ≤ 1e-08)ⓘ | |
| Other points (infeas > 1e-08)ⓘ | |
| Dual Boundsⓘ | -12.25000001 (ANTIGONE) -12.25000001 (BARON) -12.25000000 (COUENNE) -12.25000000 (CPLEX) -12.25000000 (GUROBI) -12.25000000 (LINDO) -12.25000000 (SCIP) |
| 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/qpk2 |
| Added to libraryⓘ | 03 Sep 2002 |
| Problem typeⓘ | QP |
| #Variablesⓘ | 6 |
| #Binary Variablesⓘ | 0 |
| #Integer Variablesⓘ | 0 |
| #Nonlinear Variablesⓘ | 6 |
| #Nonlinear Binary Variablesⓘ | 0 |
| #Nonlinear Integer Variablesⓘ | 0 |
| Objective Senseⓘ | min |
| Objective typeⓘ | quadratic |
| Objective curvatureⓘ | concave |
| #Nonzeros in Objectiveⓘ | 6 |
| #Nonlinear Nonzeros in Objectiveⓘ | 6 |
| #Constraintsⓘ | 12 |
| #Linear Constraintsⓘ | 12 |
| #Quadratic Constraintsⓘ | 0 |
| #Polynomial Constraintsⓘ | 0 |
| #Signomial Constraintsⓘ | 0 |
| #General Nonlinear Constraintsⓘ | 0 |
| Operands in Gen. Nonlin. Functionsⓘ | |
| Constraints curvatureⓘ | linear |
| #Nonzeros in Jacobianⓘ | 72 |
| #Nonlinear Nonzeros in Jacobianⓘ | 0 |
| #Nonzeros in (Upper-Left) Hessian of Lagrangianⓘ | 16 |
| #Nonzeros in Diagonal of Hessian of Lagrangianⓘ | 6 |
| #Blocks in Hessian of Lagrangianⓘ | 1 |
| Minimal blocksize in Hessian of Lagrangianⓘ | 6 |
| Maximal blocksize in Hessian of Lagrangianⓘ | 6 |
| Average blocksize in Hessian of Lagrangianⓘ | 6.0 |
| #Semicontinuitiesⓘ | 0 |
| #Nonlinear Semicontinuitiesⓘ | 0 |
| #SOS type 1ⓘ | 0 |
| #SOS type 2ⓘ | 0 |
| Minimal coefficientⓘ | 5.0000e-01 |
| Maximal coefficientⓘ | 6.0000e+00 |
| Infeasibility of initial pointⓘ | 0 |
| Sparsity Jacobianⓘ | ![]() |
| Sparsity Hessian of Lagrangianⓘ | ![]() |
$offlisting
*
* Equation counts
* Total E G L N X C B
* 13 1 0 12 0 0 0 0
*
* Variable counts
* x b i s1s s2s sc si
* Total cont binary integer sos1 sos2 scont sint
* 7 7 0 0 0 0 0 0
* FX 0
*
* Nonzero counts
* Total const NL DLL
* 79 73 6 0
*
* Solve m using NLP minimizing objvar;
Variables x1,x2,x3,x4,x5,x6,objvar;
Positive Variables x1,x2,x3,x4,x5,x6;
Equations e1,e2,e3,e4,e5,e6,e7,e8,e9,e10,e11,e12,e13;
e1.. - x1 - 2*x2 - 3*x3 - 4*x4 - 5*x5 - 6*x6 =L= 0;
e2.. - 2*x1 - 3*x2 - 4*x3 - 5*x4 - 6*x5 - x6 =L= 0;
e3.. - 3*x1 - 4*x2 - 5*x3 - 6*x4 - x5 - 2*x6 =L= 0;
e4.. - 4*x1 - 5*x2 - 6*x3 - x4 - 2*x5 - 3*x6 =L= 0;
e5.. - 5*x1 - 6*x2 - x3 - 2*x4 - 3*x5 - 4*x6 =L= 0;
e6.. - 6*x1 - x2 - 2*x3 - 3*x4 - 4*x5 - 5*x6 =L= 0;
e7.. x1 + 2*x2 + 3*x3 + 4*x4 + 5*x5 + 6*x6 =L= 21;
e8.. 2*x1 + 3*x2 + 4*x3 + 5*x4 + 6*x5 + x6 =L= 21;
e9.. 3*x1 + 4*x2 + 5*x3 + 6*x4 + x5 + 2*x6 =L= 21;
e10.. 4*x1 + 5*x2 + 6*x3 + x4 + 2*x5 + 3*x6 =L= 21;
e11.. 5*x1 + 6*x2 + x3 + 2*x4 + 3*x5 + 4*x6 =L= 21;
e12.. 6*x1 + x2 + 2*x3 + 3*x4 + 4*x5 + 5*x6 =L= 21;
e13.. -(0.5*x1*x2 - x1*x1 + 0.5*x2*x1 - x2*x2 + 0.5*x2*x3 + 0.5*x3*x2 - x3*x3
+ 0.5*x3*x4 + 0.5*x4*x3 - x4*x4 + 0.5*x4*x5 + 0.5*x5*x4 - x5*x5 + 0.5*x5
*x6 + 0.5*x6*x5 - x6*x6) + objvar =E= 0;
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: 2025-08-07 Git hash: e62cedfc

