Open AccessAlgorithm for solving one problem of optimal partition with fuzzy parameters in the target functional
Author(s) -
O. M. Kiselova,
O. M. Prytomanova,
Sergey V. Zhuravel,
В. В. Шаравара
Publication year - 2018
Publication title -
pitannâ prikladnoï matematiki ì matematičnogo modelûvannâ
Language(s) - English
Resource type - Journals
ISSN - 2074-5893
DOI - 10.15421/321809
Subject(s) - mathematical optimization , fuzzy logic , set (abstract data type) , computer science , mathematics , optimization problem , partition (number theory) , algorithm , field (mathematics) , mathematical theory , fuzzy set , artificial intelligence , physics , combinatorics , quantum mechanics , programming language , pure mathematics
The mathematical theory of optimal set partitioning (OSP) of the n-dimensional Eu-clidean space, which has been formed for todays, is the field of the modern theory of opti-mization, namely, the new section of non-classical infinite-dimensional mathematical pro-gramming. The theory is built based on a single, theoretically defined approach that sum up initial infinitedimensional optimization problems in a certain way (with the function of Lagrange) to nonsmooth, usually, finite-dimensional optimization problems, where lat-est numerical nondifferentiated optimization methods may be used - various variants r-algorithm of N.Shor, that was developed in V. Glushkov Institute of Cybernetics of the Na-tional Academy of Sciences of Ukraine. For now, the number of directions have been formed in the theory of continuous tasks of OSP, which are defined with different types of mathematical statements of partitioning problems, as well as various spheres of its application. For example, linear and nonlinear, single-product and multiproduct, deterministic and stochastic, in the conditions of com-plete and incomplete information about the initial data, static and dynamic tasks of the OSP without limitations and with limitations, both with the given position of the centers of subsets, and with definition the optimal variant of their location. Optimal set partitioning problems in uncertainty are the least developed for today is the direction of this theory, in particular, tasks where a number of parameters are fuzzy, inaccurate, or there are insuffi-cient mathematical description of some dependencies in the model. Such models refer to the fuzzy OSP problems, and special solutions and methods are needed to solve them. In this paper, we propose an algorithm for solving a continuous linear single-product problem of optimal set partitioning of n-dimensional Euclidean spaces Еn into a subset with searching of coordinates of the centers of these subsets with restrictions in the form of equalities and inequalities where target function has fuzzy parameters. The algorithm is built based on the application of neuro-fuzzy technologies and N.Shor r-algorithm