Solving a continuous nonlinear problem of optimal set partition with arrangement of subset centers in the case of a convex objective functional

Abstract

A continuous nonlinear single-commodity problem of optimal partition of a set ? in an n-measurable Euclidean space into disjoint subsets with arrangement of their centers is analyzed using equality and inequality constraints in the case of a convex objective functional. A method and algorithm are proposed to solve this problem.