MINLPLib
A Library of Mixed-Integer and Continuous Nonlinear Programming Instances
Home // Instances // Documentation // Download // Statistics
Instance fac1
| Formatsⓘ | ams gms mod nl osil py |
| Primal Bounds (infeas ≤ 1e-08)ⓘ | |
| Other points (infeas > 1e-08)ⓘ | |
| Dual Boundsⓘ | 160912612.40000001 (ALPHAECP) 160912612.40000001 (ANTIGONE) 160912612.40000001 (BARON) 160912612.40000001 (BONMIN) 160912612.40000001 (COUENNE) 160912612.40000001 (LINDO) 160912612.40000001 (SCIP) 160912612.40000001 (SHOT) |
| Sourceⓘ | MINOPT Model Library model facility1.dat |
| Applicationⓘ | Multi-commodity capacity facility location-allocation |
| Added to libraryⓘ | 01 May 2001 |
| Problem typeⓘ | MBNLP |
| #Variablesⓘ | 22 |
| #Binary Variablesⓘ | 6 |
| #Integer Variablesⓘ | 0 |
| #Nonlinear Variablesⓘ | 16 |
| #Nonlinear Binary Variablesⓘ | 0 |
| #Nonlinear Integer Variablesⓘ | 0 |
| Objective Senseⓘ | min |
| Objective typeⓘ | nonlinear |
| Objective curvatureⓘ | convex |
| #Nonzeros in Objectiveⓘ | 18 |
| #Nonlinear Nonzeros in Objectiveⓘ | 16 |
| #Constraintsⓘ | 18 |
| #Linear Constraintsⓘ | 18 |
| #Quadratic Constraintsⓘ | 0 |
| #Polynomial Constraintsⓘ | 0 |
| #Signomial Constraintsⓘ | 0 |
| #General Nonlinear Constraintsⓘ | 0 |
| Operands in Gen. Nonlin. Functionsⓘ | vcpower |
| Constraints curvatureⓘ | linear |
| #Nonzeros in Jacobianⓘ | 56 |
| #Nonlinear Nonzeros in Jacobianⓘ | 0 |
| #Nonzeros in (Upper-Left) Hessian of Lagrangianⓘ | 128 |
| #Nonzeros in Diagonal of Hessian of Lagrangianⓘ | 16 |
| #Blocks in Hessian of Lagrangianⓘ | 2 |
| Minimal blocksize in Hessian of Lagrangianⓘ | 8 |
| Maximal blocksize in Hessian of Lagrangianⓘ | 8 |
| Average blocksize in Hessian of Lagrangianⓘ | 8.0 |
| #Semicontinuitiesⓘ | 0 |
| #Nonlinear Semicontinuitiesⓘ | 0 |
| #SOS type 1ⓘ | 0 |
| #SOS type 2ⓘ | 0 |
| Minimal coefficientⓘ | 1.0000e+00 |
| Maximal coefficientⓘ | 3.2000e+03 |
| Infeasibility of initial pointⓘ | 1 |
| Sparsity Jacobianⓘ | ![]() |
| Sparsity Hessian of Lagrangianⓘ | ![]() |
$offlisting
*
* Equation counts
* Total E G L N X C B
* 19 11 2 6 0 0 0 0
*
* Variable counts
* x b i s1s s2s sc si
* Total cont binary integer sos1 sos2 scont sint
* 23 17 6 0 0 0 0 0
* FX 0
*
* Nonzero counts
* Total const NL DLL
* 75 59 16 0
*
* Solve m using MINLP minimizing objvar;
Variables x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13,x14,x15,x16,b17,b18,b19
,b20,b21,b22,objvar;
Positive Variables x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13,x14,x15,x16;
Binary Variables b17,b18,b19,b20,b21,b22;
Equations e1,e2,e3,e4,e5,e6,e7,e8,e9,e10,e11,e12,e13,e14,e15,e16,e17,e18,e19;
e1.. -(50*(x1 + x2 + x3 + x4 + x9 + x10 + x11 + x12)**2.5 + 70*(x5 + x6 + x7 +
x8 + x13 + x14 + x15 + x16)**2.5 + 10*x1 + 15*x2 + 20*x3 + 10*x4 + 5*x5 +
5*x6 + 30*x7 + 10*x8 + 25*x9 + 20*x10 + 15*x11 + 20*x12 + 30*x13 + 10*x14
+ 10*x15 + 30*x16) - 2000*b21 - 2500*b22 + objvar =E= 0;
e2.. x1 + x3 + x5 + x7 =L= 100;
e3.. x2 + x4 + x6 + x8 =L= 200;
e4.. x9 + x11 + x13 + x15 =L= 150;
e5.. x10 + x12 + x14 + x16 =L= 120;
e6.. x1 + x9 - 120*b17 =E= 0;
e7.. x2 + x10 - 140*b17 =E= 0;
e8.. x3 + x11 - 130*b18 =E= 0;
e9.. x4 + x12 - 180*b18 =E= 0;
e10.. x5 + x13 - 120*b19 =E= 0;
e11.. x6 + x14 - 140*b19 =E= 0;
e12.. x7 + x15 - 130*b20 =E= 0;
e13.. x8 + x16 - 180*b20 =E= 0;
e14.. 260*b17 + 310*b18 - 2500*b21 =L= 0;
e15.. 260*b19 + 310*b20 - 3200*b22 =L= 0;
e16.. 260*b17 + 310*b18 - 50*b21 =G= 0;
e17.. 260*b19 + 310*b20 - 50*b22 =G= 0;
e18.. b17 + b19 =E= 1;
e19.. b18 + b20 =E= 1;
* set non-default bounds
x1.up = 300;
x2.up = 300;
x3.up = 300;
x4.up = 300;
x5.up = 300;
x6.up = 300;
x7.up = 300;
x8.up = 300;
x9.up = 300;
x10.up = 300;
x11.up = 300;
x12.up = 300;
x13.up = 300;
x14.up = 300;
x15.up = 300;
x16.up = 300;
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: 2025-08-07 Git hash: e62cedfc

