An Algorithm for Solving the Optimal Set Partitioning Problem with Constraints on the Centers Location

摘要

An algorithm for solving the continuous optimal sets partitioning problem with constrains for the centers location, which is based on usage of the optimal partitioning theory from n-dimensional Euclidean space for subsets and Shor’s r-algorithm modification is suggested for solving nonsmooth finite-dimensional optimization problems. The algorithm is illustrated with solving the model tasks using application software.