MINLPLib
A Library of Mixed-Integer and Continuous Nonlinear Programming Instances
Home // Instances // Documentation // Download // Statistics
Instance cvxnonsep_nsig30r
separable reformulation of convex MINLP test problem with non-separable signomial constraint function (cvxnonsep_nsig30) see also problem description (PDF).
Formatsⓘ | ams gms mod nl osil py |
Primal Bounds (infeas ≤ 1e-08)ⓘ | |
Other points (infeas > 1e-08)ⓘ | |
Dual Boundsⓘ | 155.41550170 (ALPHAECP) 156.42662690 (ANTIGONE) 156.42667270 (BARON) 156.42667230 (BONMIN) 156.42224830 (COUENNE) 156.42667290 (LINDO) 156.42593690 (SCIP) 156.42624410 (SHOT) |
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ⓘ | 60 |
#Binary Variablesⓘ | 0 |
#Integer Variablesⓘ | 15 |
#Nonlinear Variablesⓘ | 30 |
#Nonlinear Binary Variablesⓘ | 0 |
#Nonlinear Integer Variablesⓘ | 15 |
Objective Senseⓘ | min |
Objective typeⓘ | linear |
Objective curvatureⓘ | linear |
#Nonzeros in Objectiveⓘ | 30 |
#Nonlinear Nonzeros in Objectiveⓘ | 0 |
#Constraintsⓘ | 31 |
#Linear Constraintsⓘ | 1 |
#Quadratic Constraintsⓘ | 0 |
#Polynomial Constraintsⓘ | 0 |
#Signomial Constraintsⓘ | 0 |
#General Nonlinear Constraintsⓘ | 30 |
Operands in Gen. Nonlin. Functionsⓘ | log |
Constraints curvatureⓘ | convex |
#Nonzeros in Jacobianⓘ | 90 |
#Nonlinear Nonzeros in Jacobianⓘ | 30 |
#Nonzeros in (Upper-Left) Hessian of Lagrangianⓘ | 30 |
#Nonzeros in Diagonal of Hessian of Lagrangianⓘ | 30 |
#Blocks in Hessian of Lagrangianⓘ | 30 |
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-03 |
Maximal coefficientⓘ | 1.8800e+00 |
Infeasibility of initial pointⓘ | 1.772 |
Sparsity Jacobianⓘ | |
Sparsity Hessian of Lagrangianⓘ |
$offlisting * * Equation counts * Total E G L N X C B * 32 1 0 31 0 0 0 0 * * Variable counts * x b i s1s s2s sc si * Total cont binary integer sos1 sos2 scont sint * 61 46 0 15 0 0 0 0 * FX 0 * * Nonzero counts * Total const NL DLL * 121 91 30 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; 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; e1.. 1.29*i1 + 0.76*i2 + i3 + 1.62*i4 + 1.07*i5 + 0.7*i6 + 1.88*i7 + 1.75*i8 + 1.1*i9 + 1.24*i10 + 1.17*i11 + 0.82*i12 + 1.06*i13 + 0.94*i14 + 0.46*i15 + 1.69*x16 + 0.39*x17 + 0.45*x18 + 0.34*x19 + 0.46*x20 + 1.86*x21 + 1.46*x22 + 0.98*x23 + 1.16*x24 + 0.47*x25 + 0.92*x26 + 1.43*x27 + 1.81*x28 + 1.78*x29 + 0.67*x30 - objvar =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 =L= -1.77195684190188; e3.. -0.028*log(i1) - x32 =L= 0; e4.. -0.041*log(i2) - x33 =L= 0; e5.. -0.047*log(i3) - x34 =L= 0; e6.. -0.022*log(i4) - x35 =L= 0; e7.. -0.041*log(i5) - x36 =L= 0; e8.. -0.026*log(i6) - x37 =L= 0; e9.. -0.052*log(i7) - x38 =L= 0; e10.. -0.051*log(i8) - x39 =L= 0; e11.. -0.016*log(i9) - x40 =L= 0; e12.. -0.038*log(i10) - x41 =L= 0; e13.. -0.036*log(i11) - x42 =L= 0; e14.. -0.033*log(i12) - x43 =L= 0; e15.. -0.054*log(i13) - x44 =L= 0; e16.. -0.016*log(i14) - x45 =L= 0; e17.. -0.02*log(i15) - x46 =L= 0; e18.. -0.007*log(x16) - x47 =L= 0; e19.. -0.058*log(x17) - x48 =L= 0; e20.. -0.04*log(x18) - x49 =L= 0; e21.. -0.03*log(x19) - x50 =L= 0; e22.. -0.039*log(x20) - x51 =L= 0; e23.. -0.034*log(x21) - x52 =L= 0; e24.. -0.04*log(x22) - x53 =L= 0; e25.. -0.034*log(x23) - x54 =L= 0; e26.. -0.044*log(x24) - x55 =L= 0; e27.. -0.032*log(x25) - x56 =L= 0; e28.. -0.061*log(x26) - x57 =L= 0; e29.. -0.013*log(x27) - x58 =L= 0; e30.. -0.007*log(x28) - x59 =L= 0; e31.. -0.007*log(x29) - x60 =L= 0; e32.. -0.004*log(x30) - x61 =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 = 1E-5; x16.up = 10; x17.lo = 1E-5; x17.up = 10; x18.lo = 1E-5; x18.up = 10; x19.lo = 1E-5; x19.up = 10; x20.lo = 1E-5; x20.up = 10; x21.lo = 1E-5; x21.up = 10; x22.lo = 1E-5; x22.up = 10; x23.lo = 1E-5; x23.up = 10; x24.lo = 1E-5; x24.up = 10; x25.lo = 1E-5; x25.up = 10; x26.lo = 1E-5; x26.up = 10; x27.lo = 1E-5; x27.up = 10; x28.lo = 1E-5; x28.up = 10; x29.lo = 1E-5; x29.up = 10; x30.lo = 1E-5; x30.up = 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: 2024-12-17 Git hash: 8eaceb91