The Emergence and Formation of the Theory of Optimal Set Partitioning for Sets of the n Dimensional Euclidean Space. Theory and Application

2018 ◽  
Vol 50 (9) ◽  
pp. 1-24 ◽  
Author(s):  
Elena M. Kiseleva
2020 ◽  
Vol 6 (2(71)) ◽  
pp. 30-35
Author(s):  
O.M. Kiseliova ◽  
O.M. Prytomanova ◽  
V.H. Padalko

An algorithm for constructing a multiplicatively weighted Voronoi diagram involving fuzzy parameters with the optimal location of a finite number of generator points in a limited set of n-dimensional Euclidean space 𝐸𝑛 has been suggested in the paper. The algorithm has been developed based on the synthesis of methods of solving the problems of optimal set partitioning theory involving neurofuzzy technologies modifications of N.Z. Shor 𝑟 -algorithm for solving nonsmooth optimization problems.


2020 ◽  
Vol 53 (1) ◽  
pp. 109-112
Author(s):  
E.M. Kiseleva ◽  
L.L. Hart ◽  
O.M. Prytomanova ◽  
S.V. Zhuravel

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.


Author(s):  
O. M. Kiselova ◽  
O. M. Prytomanova ◽  
S. V. Dzyuba ◽  
V. G. Padalko

An algorithm for constructing a multiplicatively weighted Voronoi diagram in the presence of fuzzy parameters with optimal location of a finite number of generator points in a bounded set of n-dimensional Euclidean space En is proposed in the paper. The algorithm is based on the formulation of a continuous set partitioning problem from En into non-intersecting subsets with a partitioning quality criterion providing the corresponding form of Voronoi diagram. Algorithms for constructing the classical Voronoi diagram and its various generalizations, which are based on the usage of the methods of the optimal set partitioning theory, have several advantages over the other used methods: they are out of thedependence of En space dimensions, which containing a partitioned bounded set into subsets, independent of the geometry of the partitioned sets, the algorithm’s complexity is not growing under increasing of number of generator points, it can be used for constructing the Voronoi diagram with optimal location of the points and others. The ability of easily construction not only already known Voronoi diagrams but also the new ones is the result of this general-purpose approach. The proposed in the paper algorithm for constructing a multiplicatively weighted Voronoi diagram in the presence of fuzzy parameters with optimal location of a finite number of generator points in a bounded set of n-dimensional Euclidean space En is developed using a synthesis of methods for solving optimal set partitioning problems, neurofuzzy technologies and modifications of the Shor’s r-algorithm for solving non-smooth optimization problems.


Author(s):  
O. M. Kiselova ◽  
O. M. Prytomanova ◽  
S. V. Dzyuba ◽  
V. G. Padalko

The theory of optimal set partitioning from an n-dimensional Euclidean space En is an important part of infinite-dimensional mathematical programming. The mostly reason of high interest in development of the theory of optimal set partitioning is that its results can be applied to solving the classes of different theoretical and applied optimization problems, which are transferred into continuous optimal set partitioning problem. This paper investigates the further development of the theory of optimal set partitioning from En in the case of a two-stage continuous-discrete problem of optimal partitioningdistribution with non-determined input data, which is frequently appear in solving practical problems. The two-stage continuous-discrete problem of optimal partition-distribution under constraints in the form of equations and determined position of centers of subsets is generalized by proposed continuous-discrete problem of optimal partition-distribution in case if some parameters are presented in incomplete, inaccurate or unreliable form. These parameters can be represented as linguistic variables and the method of neurolinguistic identification of unknown complex, nonlinear dependencies can be used in purpose to recovery them. A method for solving the two-stage continuous-discrete optimal partitioning-distribution problem with fuzzy parameters in target functional which based on usage of neurolinguistic identification of unknown dependencies for recovering precise values of fuzzy parameters, methods of the theory of optimal set partitioning and the method of potentials for solving a transportation problem is proposed.


2020 ◽  
Vol 10 (1) ◽  
pp. 124-136
Author(s):  
Elena Kiseleva ◽  
Olha Prytomanova ◽  
Liudmyla Hart

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.


Author(s):  
Rainer Picard

SynopsisThe classically well-known relation between the number of linearly independent solutions of the electro- and magnetostatic boundary value problems (harmonic Dirichlet and Neumann vector fields) and topological characteristics (genus and number of boundaries) of the underlying domain in 3-dimensional euclidean space is investigated in the framework of Hilbert space theory. It can be shown that this connection is still valid for a large class of domains with not necessarily smooth boundaries (segment property). As an application the inhomogeneous boundary value problems of electro- and magnetostatics are discussed.


1999 ◽  
Vol 6 (4) ◽  
pp. 323-334
Author(s):  
A. Kharazishvili

Abstract We give a characterization of all those groups of isometric transformations of a finite-dimensional Euclidean space, for which an analogue of the classical Vitali theorem [Sul problema della misura dei gruppi di punti di una retta, 1905] holds true. This characterization is formulated in purely geometrical terms.


Author(s):  
A. P. Stone

ABSTRACTGeneral shift operators for angular momentum are obtained and applied to find closed expressions for some Wigner coefficients occurring in a transformation between two equivalent representations of the four-dimensional rotation group. The transformation gives rise to analytical relations between hyperspherical harmonics in a four-dimensional Euclidean space.


Author(s):  
J. F. C. Kingman

1. A type of problem which frequently occurs in probability theory and statistics can be formulated in the following way. We are given real-valued functions f(x), gi(x) (i = 1, 2, …, k) on a space (typically finite-dimensional Euclidean space). Then the problem is to set bounds for Ef(X), where X is a random variable taking values in , about which all we know is the values of Egi(X). For example, we might wish to set bounds for P(X > a), where X is a real random variable with some of its moments given.


SIMULATION ◽  
1973 ◽  
Vol 21 (5) ◽  
pp. 145-149 ◽  
Author(s):  
John Rees Jones

Sign in / Sign up

Export Citation Format

Share Document