MINLPLib

A Library of Mixed-Integer and Continuous Nonlinear Programming Instances

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


Instance: st_fp7c

Formats ams gms lp mod nl osil pip
Primal Bounds (infeas ≤ 1e-08)
-6012.66396700 p1 ( gdx sol )
(infeas: 3e-14)
-8695.01224800 p2 ( gdx sol )
(infeas: 4e-15)
Other points (infeas > 1e-08)  
Dual Bounds
-8695.01225700 (ANTIGONE)
-8695.01226600 (BARON)
-8695.01225100 (COUENNE)
-8695.01224900 (LINDO)
-8695.01346800 (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 and Sahinidis, N V, A finite algorithm for global minimization of separable concave programs, Journal of Global Optimization, 12:1, 1998, 1-36.
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.
Added to library 03 Sep 2002
Problem type QP
#Variables 20
#Binary Variables 0
#Integer Variables 0
#Nonlinear Variables 20
#Nonlinear Binary Variables 0
#Nonlinear Integer Variables 0
Objective Sense min
Objective type quadratic
Objective curvature concave
#Nonzeros in Objective 20
#Nonlinear Nonzeros in Objective 20
#Constraints 10
#Linear Constraints 10
#Quadratic Constraints 0
#Polynomial Constraints 0
#Signomial Constraints 0
#General Nonlinear Constraints 0
Operands in Gen. Nonlin. Functions  
Constraints curvature linear
#Nonzeros in Jacobian 164
#Nonlinear Nonzeros in Jacobian 0
#Nonzeros in (Upper-Left) Hessian of Lagrangian 20
#Nonzeros in Diagonal of Hessian of Lagrangian 20
#Blocks in Hessian of Lagrangian 20
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
Infeasibility of initial point 5
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
*         11        1        0       10        0        0        0        0
*  
*  Variable counts
*                   x        b        i      s1s      s2s       sc       si
*      Total     cont   binary  integer     sos1     sos2    scont     sint
*         21       21        0        0        0        0        0        0
*  FX      0
*  
*  Nonzero counts
*      Total    const       NL      DLL
*        185      165       20        0
*
*  Solve m using NLP minimizing objvar;


Variables  x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13,x14,x15,x16,x17,x18,x19
          ,x20,objvar;

Positive Variables  x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13,x14,x15,x16,x17
          ,x18,x19,x20;

Equations  e1,e2,e3,e4,e5,e6,e7,e8,e9,e10,e11;


e1..  - 3*x1 + 7*x2 - 5*x4 + x5 + x6 + 2*x8 - x9 - x10 - 9*x11 + 3*x12 + 5*x13
      + x16 + 7*x17 - 7*x18 - 4*x19 - 6*x20 =L= -5;

e2..    7*x1 - 5*x3 + x4 + x5 + 2*x7 - x8 - x9 - 9*x10 + 3*x11 + 5*x12 + x15
      + 7*x16 - 7*x17 - 4*x18 - 6*x19 - 3*x20 =L= 2;

e3..  - 5*x2 + x3 + x4 + 2*x6 - x7 - x8 - 9*x9 + 3*x10 + 5*x11 + x14 + 7*x15
      - 7*x16 - 4*x17 - 6*x18 - 3*x19 + 7*x20 =L= -1;

e4..  - 5*x1 + x2 + x3 + 2*x5 - x6 - x7 - 9*x8 + 3*x9 + 5*x10 + x13 + 7*x14
      - 7*x15 - 4*x16 - 6*x17 - 3*x18 + 7*x19 =L= -3;

e5..    x1 + x2 + 2*x4 - x5 - x6 - 9*x7 + 3*x8 + 5*x9 + x12 + 7*x13 - 7*x14
      - 4*x15 - 6*x16 - 3*x17 + 7*x18 - 5*x20 =L= 5;

e6..    x1 + 2*x3 - x4 - x5 - 9*x6 + 3*x7 + 5*x8 + x11 + 7*x12 - 7*x13 - 4*x14
      - 6*x15 - 3*x16 + 7*x17 - 5*x19 + x20 =L= 4;

e7..    2*x2 - x3 - x4 - 9*x5 + 3*x6 + 5*x7 + x10 + 7*x11 - 7*x12 - 4*x13
      - 6*x14 - 3*x15 + 7*x16 - 5*x18 + x19 + x20 =L= -1;

e8..    2*x1 - x2 - x3 - 9*x4 + 3*x5 + 5*x6 + x9 + 7*x10 - 7*x11 - 4*x12
      - 6*x13 - 3*x14 + 7*x15 - 5*x17 + x18 + x19 =L= 0;

e9..  - x1 - x2 - 9*x3 + 3*x4 + 5*x5 + x8 + 7*x9 - 7*x10 - 4*x11 - 6*x12
      - 3*x13 + 7*x14 - 5*x16 + x17 + x18 + 2*x20 =L= 9;

e10..    x1 + x2 + x3 + x4 + x5 + x6 + x7 + x8 + x9 + x10 + x11 + x12 + x13
       + x14 + x15 + x16 + x17 + x18 + x19 + x20 =L= 40;

e11.. -(-10*sqr(x1) - 10*sqr(x2) - 10*sqr(x3) - 10*sqr(x4) - 10*sqr(x5) - 10*
      sqr(x6) - 10*sqr(x7) - 10*sqr(x8) - 10*sqr(x9) - 10*sqr(x10) - 10*sqr(x11
      ) - 10*sqr(x12) - 10*sqr(x13) - 10*sqr(x14) - 10*sqr(x15) - 10*sqr(x16)
       - 10*sqr(x17) - 10*sqr(x18) - 10*sqr(x19) - 10*sqr(x20)) + 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: 2019-06-04 Git hash: 78444eaa
Imprint / Privacy Policy