期刊
JOURNAL OF GLOBAL OPTIMIZATION
卷 67, 期 1-2, 页码 151-185出版社
SPRINGER
DOI: 10.1007/s10898-015-0348-6
关键词
Global optimization; Non-convex nonlinear programming; Packing problem; Ellipsoid representation; Non-overlap constraints; Computational geometry
A set of tri-axial ellipsoids, with given semi-axes, is to be packed into a rectangular box; its widths, lengths and height are subject to lower and upper bounds. We want to minimize the volume of this box and seek an overlap-free placement of the ellipsoids which can take any orientation. We present closed non-convex NLP formulations for this ellipsoid packing problem based on purely algebraic approaches to represent rotated and shifted ellipsoids. We consider the elements of the rotation matrix as variables. Separating hyperplanes are constructed to ensure that the ellipsoids do not overlap with each other. For up to 100 ellipsoids we compute feasible points with the global solvers available in GAMS. Only for special cases of two ellipsoids we are able to reach gaps smaller than 10(-4).
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据