Abstract
We will propose an algorithm for calculating a minimal sphere containing a polytope defined by a system of linear inequalities in low dimensional Euclidean space. This algorithm is a straightforward application of the algorithm for maximizing a convex quadratic function over a polytope. It will be shown that this algorithm successfully generates a minimal sphere when the dimensions of the underlying space is up to five.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas and C.A. Burdet (1973), “Maximizing a Convex Quadratic Functions Subject to Linear Constraints,” MSRR 299 GSIA, Carnegie-mellon University.
M.E. Dyer (1986), “On a Multidimensional Search Technique and its Applications to the Euclidean One-center Problem,”SIAM Journal on Computing,15, 725–738.
J. Elzinga and D.W. Hearn (1972), “The Minimum Covering Sphere Problem,”Management Science,19, 96–104.
J.E. Falk and K.R. Hoffman (1976), “A Successive Underestimation Method for Concave Minimization Problems,”Mathematics of Operations Research,1, 251–259.
C.G. Han, P.M. Pardalos, and Y. Ye (1992), “On a Solution of Indefinite Quadratic Problems using an Interior Point Algorithm,”Informatica,3, 474–496.
R. Horst (1976), “An Algorithm for Nonconvex Programming Problems,”Mathematical Programming,10, 312–321.
R. Horst and H. Tuy (1987), “On the Convergence of Global Methods in Multi-extremal Optimization,”JOTA,54, 253–271.
R. Horst and H. Tuy (1990),Global Optimization: Deterministic Approaches, Springer-Verlag.
H. Konno (1976), “A Cutting Plane Algorithm for Solving Bilinear Programs,”Mathematical Programming,11, 14–27.
A. Majthay and A.B. Whinston (1974), “Quasi-concave Minimization Subject to Linear Constraints,”Discrete Math.,9, 35–59.
N. Megiddo (1983), “Linear-time Algorithms for Linear Programming inR 3 and Related Problems,”SIAM Journal of Computing,12, 759–776.
K.P.K. Nair and R. Chandrasekaran (1971), “Optimal Location of Single-service Center of Certain Types,”Naval Research Logistics Quarterly,18, 503–510.
J.B. Rosen (1983), “Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain,”Mathematics of Operations Research,8, 215–230.
K. Sekitani and Y. Yamamoto (1993), “A Recursive Algorithm for Finding the Minimum Covering Sphere of a Polytope and the Minimum Covering Spheres of Several Polytopes,”Japan J. Indust. Appl. Math.,10, 255–273.
M.I. Shamos and D. Hoey (1975), “Closest Point Problems,” inProceedings of the 16th IEEE Symposium on the Foundations of Computer Science, 151–162.
S. Skyum (1991), “A Simple Algorithm for Computing the Smallest Enclosing Circle,”Information Processing Letters,37, 121–125.
J.J. Sylvester (1857), “A Quotient in the Geometry of Situation,”Quarterly Journal of Pure and Applied Mathematics,1, 79.
E. Welzl (1991),Smallest Enclosing Disks (Balls and Ellipsoid), Springer-Verlag, Lecture Notes in Computer Science, Vol. 555, 359–370.
Y. Yajima and H. Konno (1991), “Efficient Algorithms for Solving Rank Two and Rank Three Bilinear Programming Problems,”J. of Global Optimization,1, 155–171.
Y. Yajima and H. Konno (1992), “Outer Approximation Algorithms for Lower Rank Bilinear Programming Problems,” IHSS Report 92-44, Institute of Human and Social Sciences, Tokyo Institute of Technology.
P.B. Zwart (1974), “Global Minimization of a Convex Function with Linear inequality Constraints,”Operations Research,22, 602–609.
Author information
Authors and Affiliations
Additional information
International Digital Communication Inc.
Rights and permissions
About this article
Cite this article
Konno, H., Yajima, Y. & Ban, A. Calculating a minimal sphere containing a polytope defined by a system of linear inequalities. Comput Optim Applic 3, 181–191 (1994). https://doi.org/10.1007/BF01300973
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01300973