Mathematical Methods of Operations Research

, Volume 84, Issue 1, pp 3–57

Computing tight bounds via piecewise linear functions through the example of circle cutting problems


DOI: 10.1007/s00186-016-0546-0

Cite this article as:
Rebennack, S. Math Meth Oper Res (2016) 84: 3. doi:10.1007/s00186-016-0546-0


This paper discusses approximations of continuous and mixed-integer non-linear optimization problems via piecewise linear functions. Various variants of circle cutting problems are considered, where the non-overlap of circles impose a non-convex feasible region. While the paper is written in an “easy-to-understand” and “hands-on” style which should be accessible to graduate students, also new ideas are presented. Specifically, piecewise linear functions are employed to yield mixed-integer linear programming problems which provide lower and upper bounds on the original problem, the circle cutting problem. The piecewise linear functions are modeled by five different formulations, containing the incremental and logarithmic formulations. Another variant of the cutting problem involves the assignment of circles to pre-defined rectangles. We introduce a new global optimization algorithm, based on piecewise linear function approximations, which converges in finitely many iterations to a globally optimal solution. The discussed formulations are implemented in GAMS. All GAMS-files are available for download in the Electronic supplementary material. Extensive computational results are presented with various illustrations.


Piecewise linear functions Circle cutting Non-convex optimization Global optimization Non-linear programming (NLP) Quadratically constrained programming (QCP) Mixed-integer linear programming (MILP) Outer approximation Inner approximation Incremental formulation Logarithmic formulation 

Supplementary material

186_2016_546_MOESM1_ESM.txt (5 kb)
Supplementary material 1 (txt 5 KB)
186_2016_546_MOESM2_ESM.txt (5 kb)
Supplementary material 2 (txt 5 KB)
186_2016_546_MOESM3_ESM.txt (32 kb)
Supplementary material 3 (txt 31 KB)
186_2016_546_MOESM4_ESM.txt (10 kb)
Supplementary material 4 (txt 9 KB)
186_2016_546_MOESM5_ESM.txt (6 kb)
Supplementary material 5 (txt 6 KB)
186_2016_546_MOESM6_ESM.txt (30 kb)
Supplementary material 6 (txt 29 KB)
186_2016_546_MOESM7_ESM.txt (17 kb)
Supplementary material 7 (txt 16 KB)

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Division of Economics and BusinessColorado School of MinesGoldenUSA

Personalised recommendations