MINLPLib

A Library of Mixed-Integer and Continuous Nonlinear Programming Instances

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

Instance cvxnonsep_pcon30r

separable reformulation of convex MINLP test problem with non-separable power constraint (cvxnonsep_pcon30)
see also problem description (PDF).

Formatsⓘ	ams gms mod nl osil py
Primal Bounds (infeas ≤ 1e-08)ⓘ	-35.98684230 p1 ( gdx sol ) (infeas: 7e-15)
Other points (infeas > 1e-08)ⓘ
Dual Boundsⓘ	-35.98690869 (ALPHAECP) -35.98684250 (ANTIGONE) -35.98684234 (BARON) -35.98684230 (BONMIN) -35.98723384 (COUENNE) -35.98684230 (LINDO) -35.98684242 (SCIP) -35.98684451 (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ⓘ	59
#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ⓘ	30
#Linear Constraintsⓘ	1
#Quadratic Constraintsⓘ	0
#Polynomial Constraintsⓘ	0
#Signomial Constraintsⓘ	0
#General Nonlinear Constraintsⓘ	29
Operands in Gen. Nonlin. Functionsⓘ	cvpower
Constraints curvatureⓘ	convex
#Nonzeros in Jacobianⓘ	116
#Nonlinear Nonzeros in Jacobianⓘ	58
#Nonzeros in (Upper-Left) Hessian of Lagrangianⓘ	88
#Nonzeros in Diagonal of Hessian of Lagrangianⓘ	30
#Blocks in Hessian of Lagrangianⓘ	1
Minimal blocksize in Hessian of Lagrangianⓘ	30
Maximal blocksize in Hessian of Lagrangianⓘ	30
Average blocksize in Hessian of Lagrangianⓘ	30.0
#Semicontinuitiesⓘ	0
#Nonlinear Semicontinuitiesⓘ	0
#SOS type 1ⓘ	0
#SOS type 2ⓘ	0
Minimal coefficientⓘ	1.0000e-02
Maximal coefficientⓘ	2.0000e+00
Infeasibility of initial pointⓘ	1
Sparsity Jacobianⓘ
Sparsity Hessian of Lagrangianⓘ

$offlisting
*  
*  Equation counts
*      Total        E        G        L        N        X        C        B
*         31        1        0       30        0        0        0        0
*  
*  Variable counts
*                   x        b        i      s1s      s2s       sc       si
*      Total     cont   binary  integer     sos1     sos2    scont     sint
*         60       45        0       15        0        0        0        0
*  FX      0
*  
*  Nonzero counts
*      Total    const       NL      DLL
*        147       89       58        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;

Positive Variables  x16,x17,x18,x19,x20,x21,x22,x23,x24,x25,x26,x27,x28,x29
          ,x30;

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;


e1..    0.52*i1 + 0.94*i2 + 0.64*i3 + 0.96*i4 + 0.24*i5 + 0.68*i6 + 0.29*i7
      + 0.67*i8 + 0.7*i9 + 0.07*i10 + 0.25*i11 + 0.22*i12 + 0.67*i13 + 0.84*i14
      + 0.34*i15 + 0.78*x16 + 0.68*x17 + 0.01*x18 + 0.6*x19 + 0.39*x20
      + 0.92*x21 + 0.1*x22 + 0.46*x23 + 0.77*x24 + 0.32*x25 + 0.78*x26
      + 0.37*x27 + 0.78*x28 + 0.47*x29 + 0.04*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 =L= 360;

e3.. 2**(i1 + i2) - x32 =L= 0;

e4.. 2**(i2 + i3) - x33 =L= 0;

e5.. 2**(i3 + i4) - x34 =L= 0;

e6.. 2**(i4 + i5) - x35 =L= 0;

e7.. 2**(i5 + i6) - x36 =L= 0;

e8.. 2**(i6 + i7) - x37 =L= 0;

e9.. 2**(i7 + i8) - x38 =L= 0;

e10.. 2**(i8 + i9) - x39 =L= 0;

e11.. 2**(i9 + i10) - x40 =L= 0;

e12.. 2**(i10 + i11) - x41 =L= 0;

e13.. 2**(i11 + i12) - x42 =L= 0;

e14.. 2**(i12 + i13) - x43 =L= 0;

e15.. 2**(i13 + i14) - x44 =L= 0;

e16.. 2**(i14 + i15) - x45 =L= 0;

e17.. 2**(i15 + x16) - x46 =L= 0;

e18.. 2**(x16 + x17) - x47 =L= 0;

e19.. 2**(x17 + x18) - x48 =L= 0;

e20.. 2**(x18 + x19) - x49 =L= 0;

e21.. 2**(x19 + x20) - x50 =L= 0;

e22.. 2**(x20 + x21) - x51 =L= 0;

e23.. 2**(x21 + x22) - x52 =L= 0;

e24.. 2**(x22 + x23) - x53 =L= 0;

e25.. 2**(x23 + x24) - x54 =L= 0;

e26.. 2**(x24 + x25) - x55 =L= 0;

e27.. 2**(x25 + x26) - x56 =L= 0;

e28.. 2**(x26 + x27) - x57 =L= 0;

e29.. 2**(x27 + x28) - x58 =L= 0;

e30.. 2**(x28 + x29) - x59 =L= 0;

e31.. 2**(x29 + x30) - x60 =L= 0;

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

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;