Minkowski function in packing problems
AbstractThe problem of packing, which consists in the most rational placement of group of given objects, is considered. Since in modeling of the placement of goods, cutout of material and similar processes a question arises about non-intersection of objects so a new approach to construction of non-intersection conditions is offered through an inequality specified by the Minkowski function. Analytical formulas that describe the Minkowski functions from the difference/sum of various objects are constructed.
New methods in system analysis, computer science and theory of decision making