MINLPLib

A Library of Mixed-Integer and Continuous Nonlinear Programming Instances

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


Instance kall_congruentcircles_c32

A set of circles are to be cut from rectangular design plates to be produced, or from a set of stocked rectangles of known geometric dimensions.
The objective is to minimize the area of the design rectangles.
The design plates are subject to lower and upper bounds of their widths and lengths.
The objects are free of any orientation restrictions.
Formats ams gms lp mod nl osil pip py
Primal Bounds (infeas ≤ 1e-08)
1.37585632 p1 ( gdx sol )
(infeas: 3e-10)
Other points (infeas > 1e-08)  
Dual Bounds
1.37585559 (ANTIGONE)
1.37585615 (BARON)
1.37585632 (COUENNE)
1.37585536 (GUROBI)
1.37585632 (LINDO)
1.37585579 (SCIP)
References Kallrath, Josef, Cutting circles and polygons from area-minimizing rectangles, Journal of Global Optimization, 43:2-3, 2009, 299-328.
Source ANTIGONE test library model Other_MIQCQP/kall_congruentcircles_c32
Application Geometry
Added to library 15 Aug 2014
Problem type QCP
#Variables 10
#Binary Variables 0
#Integer Variables 0
#Nonlinear Variables 8
#Nonlinear Binary Variables 0
#Nonlinear Integer Variables 0
Objective Sense min
Objective type linear
Objective curvature linear
#Nonzeros in Objective 1
#Nonlinear Nonzeros in Objective 0
#Constraints 16
#Linear Constraints 12
#Quadratic Constraints 4
#Polynomial Constraints 0
#Signomial Constraints 0
#General Nonlinear Constraints 0
Operands in Gen. Nonlin. Functions  
Constraints curvature indefinite
#Nonzeros in Jacobian 37
#Nonlinear Nonzeros in Jacobian 14
#Nonzeros in (Upper-Left) Hessian of Lagrangian 20
#Nonzeros in Diagonal of Hessian of Lagrangian 6
#Blocks in Hessian of Lagrangian 3
Minimal blocksize in Hessian of Lagrangian 2
Maximal blocksize in Hessian of Lagrangian 3
Average blocksize in Hessian of Lagrangian 2.666667
#Semicontinuities 0
#Nonlinear Semicontinuities 0
#SOS type 1 0
#SOS type 2 0
Minimal coefficient 1.0000e+00
Maximal coefficient 1.0000e+00
Infeasibility of initial point 2.106
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
*         16        2        3       11        0        0        0        0
*  
*  Variable counts
*                   x        b        i      s1s      s2s       sc       si
*      Total     cont   binary  integer     sos1     sos2    scont     sint
*         10       10        0        0        0        0        0        0
*  FX      0
*  
*  Nonzero counts
*      Total    const       NL      DLL
*         37       23       14        0
*
*  Solve m using NLP minimizing objvar;


Variables  x1,x2,x3,x4,x5,x6,x7,x8,x9,objvar;

Positive Variables  x8,x9;

Equations  e1,e2,e3,e4,e5,e6,e7,e8,e9,e10,e11,e12,e13,e14,e15,e16;


e1..  - x1 + objvar =E= -2.35619449019234;

e2.. -x8*x9 + x1 =E= 0;

e3.. (x2 - x4)*(x2 - x4) + (x3 - x5)*(x3 - x5) =G= 1;

e4.. (x2 - x6)*(x2 - x6) + (x3 - x7)*(x3 - x7) =G= 1;

e5.. (x4 - x6)*(x4 - x6) + (x5 - x7)*(x5 - x7) =G= 1;

e6..    x2 - x8 =L= -0.5;

e7..    x3 - x9 =L= -0.5;

e8..    x4 - x8 =L= -0.5;

e9..    x5 - x9 =L= -0.5;

e10..    x6 - x8 =L= -0.5;

e11..    x7 - x9 =L= -0.5;

e12..    x2 =L= 1.25;

e13..    x3 =L= 1;

e14..    x2 - x4 =L= 0;

e15..    x2 - x6 =L= 0;

e16..    x4 - x6 =L= 0;

* set non-default bounds
x1.lo = 0.25; x1.up = 5;
x2.lo = 0.5; x2.up = 2;
x3.lo = 0.5; x3.up = 1.5;
x4.lo = 0.5; x4.up = 2;
x5.lo = 0.5; x5.up = 1.5;
x6.lo = 0.5; x6.up = 2;
x7.lo = 0.5; x7.up = 1.5;
x8.up = 2.5;
x9.up = 2;
objvar.lo = 0; objvar.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 NLP $set NLP NLP
Solve m using %NLP% minimizing objvar;


Last updated: 2022-04-26 Git hash: de668763
Imprint / Privacy Policy / License: CC-BY 4.0