SOLVING THE DYNAMIC OPTIMAL SET PARTITIONING PROBLEM WITH ARRANGEMENT OF CENTERS OF SUBSETS

摘要

A mathematical model is presented for the dynamic problem of optimal partitioning of a set from a space R~n with arrangement of centers of subsets under joint constraints on the partition and phase variable. A method is described that solves this problem and synthesizes the essentials of the theory of continuous partitioning problems and optimal control theory for dynamic systems. A numerical algorithm for solving the problem and an analysis of the results of computational experiments are presented.