MINLPLib

A Library of Mixed-Integer and Continuous Nonlinear Programming Instances

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


Removed Instance st_cqpjk1

Formats ams gms lp mod nl osil pip py
Primal Bounds (infeas ≤ 1e-08)
-12.44444222 p1 ( gdx sol )
(infeas: 4e-16)
Other points (infeas > 1e-08)  
Dual Bounds
-12.44444222 (ANTIGONE)
-12.44444223 (BARON)
-12.44444222 (COUENNE)
-12.44444222 (CPLEX)
-12.44444222 (LINDO)
-12.44444234 (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/cqpjk1
Added to library 03 Sep 2002
Removed from library 16 Feb 2022
Removed because Instance is continuous and convex.
Problem type QP
#Variables 4
#Binary Variables 0
#Integer Variables 0
#Nonlinear Variables 4
#Nonlinear Binary Variables 0
#Nonlinear Integer Variables 0
Objective Sense min
Objective type quadratic
Objective curvature convex
#Nonzeros in Objective 4
#Nonlinear Nonzeros in Objective 4
#Constraints 2
#Linear Constraints 2
#Quadratic Constraints 0
#Polynomial Constraints 0
#Signomial Constraints 0
#General Nonlinear Constraints 0
Operands in Gen. Nonlin. Functions  
Constraints curvature linear
#Nonzeros in Jacobian 8
#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 5.0000e-01
Maximal coefficient 1.0000e+01
Infeasibility of initial point 1
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
*          3        1        0        2        0        0        0        0
*  
*  Variable counts
*                   x        b        i      s1s      s2s       sc       si
*      Total     cont   binary  integer     sos1     sos2    scont     sint
*          5        5        0        0        0        0        0        0
*  FX      0
*  
*  Nonzero counts
*      Total    const       NL      DLL
*         13        9        4        0
*
*  Solve m using NLP minimizing objvar;


Variables  x1,x2,x3,x4,objvar;

Positive Variables  x1;

Equations  e1,e2,e3;


e1..  - x1 - x2 - x3 - x4 =L= -1;

e2..    x1 + x2 + x3 + x4 =L= 1;

e3.. -(2*x1*x1 - 1.33333*x1 + 4*x2*x2 - 2.66667*x2 + 6*x3*x3 - 4*x3 + 0.5*x4*x4
      - 10*x4) + objvar =E= 0;

* set non-default bounds
x3.lo = -10000; x3.up = 10000;
x4.lo = -10000; x4.up = 10000;

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: 2024-12-17 Git hash: 8eaceb91
Imprint / Privacy Policy / License: CC-BY 4.0