AbstractA two-stage continuous-discrete optimal partitioning-allocation problem is studied, and a method and an algorithm for its solving are proposed. This problem is a generalization of a classical transportation problem to the case when coordinates of the production points (collection, storage, processing) of homogeneous products are continuously allocated in the given domain and the production volumes at these points are unknown. These coordinates are found as a solution of the corresponding continuous optimal set-partitioning problem in a finite-dimensional Euclidean space with the placement (finding coordinates) of these subsets’ centers. Also, this problem generalizes discrete two-stage production-transportation problems to the case of continuously allocated consumers. The method and algorithm are illustrated by solving two model problems.
We consider the problem of existence and location of a solution of a nonlinear operator equation with a Fréchet differentiable operator in a Banach space and present the convergence results for a projection-iteration method based on a Newton-like method under the Cauchy's conditions, which generalize the results for the projection-iteration realization of the Newton-Kantorovich method. The proposed method unlike the traditional interpretation is based on the idea of whatever approximation of the original equation by a sequence of approximate operator equations defined on subspaces of the basic space with the subsequent application of the Newton-like method to their approximate solution. We prove the convergence theorem, obtain the error estimate and discuss the advantages of the proposed approach and some of its modifications.
The problem of construction of a generalized Voronoi diagram with optimal placement of a finite number of generator points in a bounded set of \textit{n}-dimensional Euclidean space is considered. A method is proposed for solving such a problem based on the formulation of the corresponding continuous problem of optimal partitioning of a set in \textit{n}-dimensional Euclidean space with a partition quality criterion that provides the corresponding form of the Voronoi diagram. Further, to solve such a problem, the developed mathematical and algorithmic apparatus is used, the part of which is Shor's \textit{r}-algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.