Olga Prytomanova
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Olga Prytomanova has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Elena M. Kiseleva
Oles Honchar Dnipro National University, Dnipro, Ukraine
9 shared publications - Danylo Lebediev
Kyiv National Economic University named after Vadym Hetman, Kyiv, Ukraine
2 shared publications - Lyudmila L. Hart
Oles Honchar Dnipro National University
2 shared publications - Olexandr O. Kuzenkov
Oles Honchar Dnipro National University
2 shared publications - Sergiy Yakovlev
Institute of Computer Science and Artificial Intelligence, V.N. Karazin Kharkiv National University, 61022 Kharkiv, Ukraine
2 shared publications - Anatolii Bulat
M. S. Poliakov Institute of Geotechnical Mechanics, National Academy of Sciences of Ukraine, Dnipro, Ukraine
1 shared publication
Latest Publications
- 1 August 2026
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 62 (4) , 600-611
Fuzzy Two-Stage Continuous–Discrete Optimal Set Partitioning Problem. I. Theoretical Foundations
- 1 August 2026
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 62 (4) , 600-611
Fuzzy Two-Stage Continuous–Discrete Optimal Set Partitioning Problem. I. Theoretical Foundations
- 22 December 2025
- Published by Oles Honchar Dnipropetrovsk National University in Problems of applied mathematics and mathematic modeling
- p. 86-103
Optimal set partitioning and discrete-continuous transportation problems: a review of theoretical and applied approaches
This article presents a narrative review of the current state of the theory of optimal set partitioning and its applications to discrete-continuous transportation problems. The review highlights the connection between optimal set partitioning methods and classical Monge-Kantorovich transportation models, location-allocation problems, and continuous optimization on bounded subsets of Euclidean spaces. Particular attention is given to approaches that reduce infinite-dimensional formulations to finite-dimensional nondifferenti-able optimization problems solved via modern nonsmooth optimization techniques, such as Shor’s r-algorithm. The article outlines key research directions, including dynamic, multi-stage, and fuzzy models, as well as applications related to Voronoi diagrams and geometric optimization. Practical domains are summarized where optimal set partitioning methods prove effective – such as logistics, territorial planning, classification, ecology, and medical physics. The review consolidates existing results and identifies promising avenues for future development.
- 22 December 2025
- Published by Oles Honchar Dnipropetrovsk National University in Problems of applied mathematics and mathematic modeling
- p. 86-103
Optimal set partitioning and discrete-continuous transportation problems: a review of theoretical and applied approaches
This article presents a narrative review of the current state of the theory of optimal set partitioning and its applications to discrete-continuous transportation problems. The review highlights the connection between optimal set partitioning methods and classical Monge-Kantorovich transportation models, location-allocation problems, and continuous optimization on bounded subsets of Euclidean spaces. Particular attention is given to approaches that reduce infinite-dimensional formulations to finite-dimensional nondifferenti-able optimization problems solved via modern nonsmooth optimization techniques, such as Shor’s r-algorithm. The article outlines key research directions, including dynamic, multi-stage, and fuzzy models, as well as applications related to Voronoi diagrams and geometric optimization. Practical domains are summarized where optimal set partitioning methods prove effective – such as logistics, territorial planning, classification, ecology, and medical physics. The review consolidates existing results and identifies promising avenues for future development.
- 12 November 2025
- Published by Springer Nature
- p. 205-224
Solving Two-Stage Logistic Problem of Optimal Location-Allocation
- 12 November 2025
- Published by Springer Nature
- p. 205-224
Solving Two-Stage Logistic Problem of Optimal Location-Allocation
- 9 November 2025
- Published by Kyiv National Economic University named after Vadym Hetman in Scientific notes
- Vol. 40(3), 179-193
Modeling the macroeconomic factorsʼ impact on the sales dynamics of a distribution company
- 9 November 2025
- Published by Kyiv National Economic University named after Vadym Hetman in Scientific notes
- Vol. 40(3), 179-193
Modeling the macroeconomic factorsʼ impact on the sales dynamics of a distribution company
- Open Access
- 26 September 2025
- Published by Ukrainian State University of Science and Technologies in Science and Transport Progress
- No. 3(111),p. 59-67
Software Implementation of an Algorithm for Solving a Dynamic Problem of Optimal Set Partitioning Under Uncertainty
Purpose. Among various formulations of the optimal set partitioning (OSP) problem, dynamic variants—where optimization conditions change over time—are of particular interest due to their relevance for real-world applications. Such systems often operate under uncertainty, which may arise from imprecise or incomplete input data, vague parameters, or unreliable mathematical representations of system behavior. This study develops a comprehensive mathematical and computational framework for solving dynamic OSP problems under uncertainty. The aim of the study is to develop software for solving a novel dynamic optimal set partitioning problem under uncertainty, specifically including the formulation of a numerical experiment, the applied interpretation of the obtained results, and a comparative analysis of the numerical experiment outcomes with the analytical results of the model investigation. Methodology. The methodological basis of the study consists of the principles of optimal set partitioning theory and fuzzy set theory. Modern numerical methods were used to solve systems of ordinary differential equations necessary for determining the parameters of the dynamic model. Findings. The formulation of dynamic optimal set partitioning problems under uncertainty allows including fuzzy model parameters and obtaining results even with incomplete information about the system. The work presents a clearly defined algorithm for solving the problem, determined by its mathematical formulation. Originality. The proposed models represent a significant contribution to the development of mathematical modeling, particularly in dynamic and fuzzy problem formulations. Methods and algorithms for solving the formalized problems are presented, and the results of comparative analysis allow assessing the analytical and numerical advantages of both models and the dynamic approach to solving such problems. Practical value. The practical value of the results obtained in this study lies in the formulation of a novel dynamic optimal set partitioning problem under uncertainty, the development of software for the numerical implementation of the experiment, and the visualization of the obtained results. The formalized mathematical model and the developed software can be applied to a wide range of practical problems, such as logistics, facility location, partitioning of communities into administrative service centers, and others.
- 26 September 2025
- Published by Ukrainian State University of Science and Technologies in Science and Transport Progress
- No. 3(111),p. 59-67
Open AccessSoftware Implementation of an Algorithm for Solving a Dynamic Problem of Optimal Set Partitioning Under Uncertainty
Purpose. Among various formulations of the optimal set partitioning (OSP) problem, dynamic variants—where optimization conditions change over time—are of particular interest due to their relevance for real-world applications. Such systems often operate under uncertainty, which may arise from imprecise or incomplete input data, vague parameters, or unreliable mathematical representations of system behavior. This study develops a comprehensive mathematical and computational framework for solving dynamic OSP problems under uncertainty. The aim of the study is to develop software for solving a novel dynamic optimal set partitioning problem under uncertainty, specifically including the formulation of a numerical experiment, the applied interpretation of the obtained results, and a comparative analysis of the numerical experiment outcomes with the analytical results of the model investigation. Methodology. The methodological basis of the study consists of the principles of optimal set partitioning theory and fuzzy set theory. Modern numerical methods were used to solve systems of ordinary differential equations necessary for determining the parameters of the dynamic model. Findings. The formulation of dynamic optimal set partitioning problems under uncertainty allows including fuzzy model parameters and obtaining results even with incomplete information about the system. The work presents a clearly defined algorithm for solving the problem, determined by its mathematical formulation. Originality. The proposed models represent a significant contribution to the development of mathematical modeling, particularly in dynamic and fuzzy problem formulations. Methods and algorithms for solving the formalized problems are presented, and the results of comparative analysis allow assessing the analytical and numerical advantages of both models and the dynamic approach to solving such problems. Practical value. The practical value of the results obtained in this study lies in the formulation of a novel dynamic optimal set partitioning problem under uncertainty, the development of software for the numerical implementation of the experiment, and the visualization of the obtained results. The formalized mathematical model and the developed software can be applied to a wide range of practical problems, such as logistics, facility location, partitioning of communities into administrative service centers, and others.
- Open Access
- 4 August 2025
- Published by MDPI AG in Computation
- Vol. 13 (8) , 187
Mathematical Modeling of Regional Infectious Disease Dynamics Based on Extended Compartmental Models
This study presents an extended approach to compartmental modeling of infectious disease spread, focusing on regional heterogeneity within affected areas. Using classical SIS, SIR, and SEIR frameworks, we simulate the dynamics of COVID-19 across two major regions of Ukraine—Dnipropetrovsk and Kharkiv—during the period 2020–2024. The proposed mathematical model incorporates regionally distributed subpopulations and applies a system of differential equations solved using the classical fourth-order Runge–Kutta method. The simulations are validated against real-world epidemiological data from national and international sources. The SEIR model demonstrated superior performance, achieving maximum relative errors of 4.81% and 5.60% in the Kharkiv and Dnipropetrovsk regions, respectively, outperforming the SIS and SIR models. Despite limited mobility and social contact data, the regionally adapted models achieved acceptable accuracy for medium-term forecasting. This validates the practical applicability of extended compartmental models in public health planning, particularly in settings with constrained data availability. The results further support the use of these models for estimating critical epidemiological indicators such as infection peaks and hospital resource demands. The proposed framework offers a scalable and computationally efficient tool for regional epidemic forecasting, with potential applications to future outbreaks in geographically heterogeneous environments.
- 4 August 2025
- Published by MDPI AG in Computation
- Vol. 13 (8) , 187
Open AccessMathematical Modeling of Regional Infectious Disease Dynamics Based on Extended Compartmental Models
This study presents an extended approach to compartmental modeling of infectious disease spread, focusing on regional heterogeneity within affected areas. Using classical SIS, SIR, and SEIR frameworks, we simulate the dynamics of COVID-19 across two major regions of Ukraine—Dnipropetrovsk and Kharkiv—during the period 2020–2024. The proposed mathematical model incorporates regionally distributed subpopulations and applies a system of differential equations solved using the classical fourth-order Runge–Kutta method. The simulations are validated against real-world epidemiological data from national and international sources. The SEIR model demonstrated superior performance, achieving maximum relative errors of 4.81% and 5.60% in the Kharkiv and Dnipropetrovsk regions, respectively, outperforming the SIS and SIR models. Despite limited mobility and social contact data, the regionally adapted models achieved acceptable accuracy for medium-term forecasting. This validates the practical applicability of extended compartmental models in public health planning, particularly in settings with constrained data availability. The results further support the use of these models for estimating critical epidemiological indicators such as infection peaks and hospital resource demands. The proposed framework offers a scalable and computationally efficient tool for regional epidemic forecasting, with potential applications to future outbreaks in geographically heterogeneous environments.
- Open Access
- 3 October 2024
- Published by MDPI AG in Computation
- Vol. 12 (10) , 199
Solving the Problem of Fuzzy Partition-Distribution with Determination of the Location of Subset Centers
A large number of real-world problems from various fields of human activity can be reduced to optimal partitioning-allocation problems with the purpose of minimizing the partitioning quality criterion. A typical representative of such problem is an infinite-dimensional transportation problem and more generalized problems—infinite-dimensional problems of production centers placement along with the partitioning of the area of continuously distributed consumers with the purpose of minimizing transportation and production costs. The relevant problems are characterized by some kind of uncertainty level of a not-probabilistic nature. A method is proposed to solve an optimal fuzzy partitioning-allocation problem with the subsets centers placement for sets of n-dimensional Euclidean space. The method is based on the synthesis of the methods of fuzzy theory and optimal partitioning-allocation theory, which is a new science field in infinite-dimensional mathematical programming with Boolean variables. A theorem was proved that determines the form of the optimal solution of the corresponding optimal fuzzy partitioning-allocation problem with the subsets centers placement for sets of n-dimensional Euclidean space. An algorithm for solving fuzzy partitioning-allocation problems is proposed, which is based on the proved theorem and on a variant of Shor’s r-algorithm—a non-differential optimization method. The application of the proposed method is demonstrated on model tasks, where the coefficient of mistrust is integrated to interpret the obtained result—the minimum value of the membership function, which allows each point of the set partition to be assigned to a specific fuzzy subset.
- 3 October 2024
- Published by MDPI AG in Computation
- Vol. 12 (10) , 199
Open AccessSolving the Problem of Fuzzy Partition-Distribution with Determination of the Location of Subset Centers
A large number of real-world problems from various fields of human activity can be reduced to optimal partitioning-allocation problems with the purpose of minimizing the partitioning quality criterion. A typical representative of such problem is an infinite-dimensional transportation problem and more generalized problems—infinite-dimensional problems of production centers placement along with the partitioning of the area of continuously distributed consumers with the purpose of minimizing transportation and production costs. The relevant problems are characterized by some kind of uncertainty level of a not-probabilistic nature. A method is proposed to solve an optimal fuzzy partitioning-allocation problem with the subsets centers placement for sets of n-dimensional Euclidean space. The method is based on the synthesis of the methods of fuzzy theory and optimal partitioning-allocation theory, which is a new science field in infinite-dimensional mathematical programming with Boolean variables. A theorem was proved that determines the form of the optimal solution of the corresponding optimal fuzzy partitioning-allocation problem with the subsets centers placement for sets of n-dimensional Euclidean space. An algorithm for solving fuzzy partitioning-allocation problems is proposed, which is based on the proved theorem and on a variant of Shor’s r-algorithm—a non-differential optimization method. The application of the proposed method is demonstrated on model tasks, where the coefficient of mistrust is integrated to interpret the obtained result—the minimum value of the membership function, which allows each point of the set partition to be assigned to a specific fuzzy subset.
- 26 March 2022
- Published by Springer Nature
- p. 287-313
Application of the Theory of Optimal Set Partitioning for Constructing Fuzzy Voronoi Diagrams
- 26 March 2022
- Published by Springer Nature
- p. 287-313
Application of the Theory of Optimal Set Partitioning for Constructing Fuzzy Voronoi Diagrams
- Open Access
- 22 December 2021
- Published by Igor Sikorsky Kyiv Polytechnic Institute in System research and information technologies
- No. 4,p. 91-101
Application of optimal set partitioning theory to solving problems of artificial intelligence and pattern recognition
The paper substantiates the possibility of applying the mathematical theory of continuous problems of optimal partitioning of sets of n-dimensional Euclidean space, which belong to the non-classical problems of infinite-dimensional mathematical programming, to the solution of problems of artificial intelligence and pattern recognition. The problems of pattern recognition both in conditions of certainty and in conditions of uncertainty are formulated. A particular attention is paid to the application of methods of the theory of optimal partitioning for the construction of fuzzy Voronoi diagrams. Examples of constructing fuzzy Voronoi diagrams with the optimal placement of generating points are given.
- 22 December 2021
- Published by Igor Sikorsky Kyiv Polytechnic Institute in System research and information technologies
- No. 4,p. 91-101
Open AccessApplication of optimal set partitioning theory to solving problems of artificial intelligence and pattern recognition
The paper substantiates the possibility of applying the mathematical theory of continuous problems of optimal partitioning of sets of n-dimensional Euclidean space, which belong to the non-classical problems of infinite-dimensional mathematical programming, to the solution of problems of artificial intelligence and pattern recognition. The problems of pattern recognition both in conditions of certainty and in conditions of uncertainty are formulated. A particular attention is paid to the application of methods of the theory of optimal partitioning for the construction of fuzzy Voronoi diagrams. Examples of constructing fuzzy Voronoi diagrams with the optimal placement of generating points are given.
- 26 July 2020
- Published by Springer Nature
- p. 714-727
An Algorithm for Constructing Additive and Multiplicative Voronoi Diagrams Under Uncertainty
- 26 July 2020
- Published by Springer Nature
- p. 714-727
An Algorithm for Constructing Additive and Multiplicative Voronoi Diagrams Under Uncertainty