multiplex-partitioning of sets

About communication of many-multiple covering optimization problems of bounded sets and problems of multiplex-partitioning

There is proposed a modification of optimality criterion in the continuous problem of optimal multiplex-partitioning of a bounded set from n-dimensional Euclidean space, which allows in the result of its solving receive the smallest radius of the multiple covering by balls of this set