MINLPLib

A Library of Mixed-Integer and Continuous Nonlinear Programming Instances

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


Instance: cvxnonsep_psig30r

separable reformulation of convex MINLP test problem with non-separable signomial objective function (cvxnonsep_psig30)
see also problem description (PDF).
Formats ams gms mod nl osil
Primal Bounds
78.99885434 p1 ( gdx sol )
(infeas: 6e-17)
Dual Bounds
78.95269508 (ALPHAECP)
68.21423168 (ANTIGONE)
78.99095507 (BARON)
78.99885434 (BONMIN)
78.99698949 (COUENNE)
78.99885434 (LINDO)
78.99881309 (SCIP)
References Kronqvist, Jan, Lundell, Andreas, and Westerlund, Tapio, Reformulations for utilizing separability when solving convex MINLP problems, submitted, 2017.
Application Test Problem
Added to library 11 Sep 2017
Problem type MINLP
#Variables 62
#Binary Variables 0
#Integer Variables 15
#Nonlinear Variables 31
#Nonlinear Binary Variables 0
#Nonlinear Integer Variables 15
Objective Sense min
Objective type linear
Objective curvature linear
#Nonzeros in Objective 31
#Nonlinear Nonzeros in Objective 0
#Constraints 32
#Linear Constraints 1
#Quadratic Constraints 0
#Polynomial Constraints 0
#Signomial Constraints 0
#General Nonlinear Constraints 31
Operands in Gen. Nonlin. Functions log
Constraints curvature convex
#Nonzeros in Jacobian 93
#Nonlinear Nonzeros in Jacobian 31
#Nonzeros in (Upper-Left) Hessian of Lagrangian 31
#Nonzeros in Diagonal of Hessian of Lagrangian 31
#Blocks in Hessian of Lagrangian 31
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 23.03
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
*         33        1        0       32        0        0        0        0
*  
*  Variable counts
*                   x        b        i      s1s      s2s       sc       si
*      Total     cont   binary  integer     sos1     sos2    scont     sint
*         63       48        0       15        0        0        0        0
*  FX      0
*  
*  Nonzero counts
*      Total    const       NL      DLL
*        125       94       31        0
*
*  Solve m using MINLP minimizing objvar;


Variables  i1,i2,i3,i4,i5,i6,i7,i8,i9,i10,i11,i12,i13,i14,i15,x16,x17,x18,x19
          ,x20,x21,x22,x23,x24,x25,x26,x27,x28,x29,x30,objvar,x32,x33,x34,x35
          ,x36,x37,x38,x39,x40,x41,x42,x43,x44,x45,x46,x47,x48,x49,x50,x51,x52
          ,x53,x54,x55,x56,x57,x58,x59,x60,x61,x62,x63;

Negative Variables  x32,x33,x34,x35,x36,x37,x38,x39,x40,x41,x42,x43,x44,x45
          ,x46,x47,x48,x49,x50,x51,x52,x53,x54,x55,x56,x57,x58,x59,x60,x61;

Integer Variables  i1,i2,i3,i4,i5,i6,i7,i8,i9,i10,i11,i12,i13,i14,i15;

Equations  e1,e2,e3,e4,e5,e6,e7,e8,e9,e10,e11,e12,e13,e14,e15,e16,e17,e18,e19
          ,e20,e21,e22,e23,e24,e25,e26,e27,e28,e29,e30,e31,e32,e33;


e1..    i1 + i2 + i3 + i4 + i5 + i6 + i7 + i8 + i9 + i10 + i11 + i12 + i13
      + i14 + i15 + x16 + x17 + x18 + x19 + x20 + x21 + x22 + x23 + x24 + x25
      + x26 + x27 + x28 + x29 + x30 - objvar + 30000*x63 =E= 0;

e2..    x32 + x33 + x34 + x35 + x36 + x37 + x38 + x39 + x40 + x41 + x42 + x43
      + x44 + x45 + x46 + x47 + x48 + x49 + x50 + x51 + x52 + x53 + x54 + x55
      + x56 + x57 + x58 + x59 + x60 + x61 + x62 =L= 0;

e3.. -0.48*log(i1) - x32 =L= 0;

e4.. -0.275*log(i2) - x33 =L= 0;

e5.. -0.26*log(i3) - x34 =L= 0;

e6.. -0.215*log(i4) - x35 =L= 0;

e7.. -0.245*log(i5) - x36 =L= 0;

e8.. -0.31*log(i6) - x37 =L= 0;

e9.. -0.34*log(i7) - x38 =L= 0;

e10.. -0.2*log(i8) - x39 =L= 0;

e11.. -0.185*log(i9) - x40 =L= 0;

e12.. -0.495*log(i10) - x41 =L= 0;

e13.. -0.02*log(i11) - x42 =L= 0;

e14.. -0.445*log(i12) - x43 =L= 0;

e15.. -0.455*log(i13) - x44 =L= 0;

e16.. -0.4*log(i14) - x45 =L= 0;

e17.. -0.05*log(i15) - x46 =L= 0;

e18.. -0.13*log(x16) - x47 =L= 0;

e19.. -0.17*log(x17) - x48 =L= 0;

e20.. -0.34*log(x18) - x49 =L= 0;

e21.. -0.07*log(x19) - x50 =L= 0;

e22.. -0.36*log(x20) - x51 =L= 0;

e23.. -0.05*log(x21) - x52 =L= 0;

e24.. -0.325*log(x22) - x53 =L= 0;

e25.. -0.245*log(x23) - x54 =L= 0;

e26.. -0.39*log(x24) - x55 =L= 0;

e27.. -0.36*log(x25) - x56 =L= 0;

e28.. -0.45*log(x26) - x57 =L= 0;

e29.. -0.445*log(x27) - x58 =L= 0;

e30.. -0.165*log(x28) - x59 =L= 0;

e31.. -0.35*log(x29) - x60 =L= 0;

e32.. -0.1*log(x30) - x61 =L= 0;

e33.. -log(x63) - x62 =L= 0;

* set non-default bounds
i1.lo = 1; i1.up = 10;
i2.lo = 1; i2.up = 10;
i3.lo = 1; i3.up = 10;
i4.lo = 1; i4.up = 10;
i5.lo = 1; i5.up = 10;
i6.lo = 1; i6.up = 10;
i7.lo = 1; i7.up = 10;
i8.lo = 1; i8.up = 10;
i9.lo = 1; i9.up = 10;
i10.lo = 1; i10.up = 10;
i11.lo = 1; i11.up = 10;
i12.lo = 1; i12.up = 10;
i13.lo = 1; i13.up = 10;
i14.lo = 1; i14.up = 10;
i15.lo = 1; i15.up = 10;
x16.lo = 1; x16.up = 10;
x17.lo = 1; x17.up = 10;
x18.lo = 1; x18.up = 10;
x19.lo = 1; x19.up = 10;
x20.lo = 1; x20.up = 10;
x21.lo = 1; x21.up = 10;
x22.lo = 1; x22.up = 10;
x23.lo = 1; x23.up = 10;
x24.lo = 1; x24.up = 10;
x25.lo = 1; x25.up = 10;
x26.lo = 1; x26.up = 10;
x27.lo = 1; x27.up = 10;
x28.lo = 1; x28.up = 10;
x29.lo = 1; x29.up = 10;
x30.lo = 1; x30.up = 10;
x63.lo = 1E-10;

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: 2018-09-14 Git hash: ac5a5314
Imprint / Privacy Policy