MATHEMATICAL FOUNDATIONS OF METHODS FOR SOLVING CONTINUOUS PROBLEMS OF OPTIMAL MULTIPLEX PARTITIONING OF SETS
DOI:
https://doi.org/10.15588/1607-3274-2025-2-6Keywords:
continuous set, multiplex partitioning, optimization, LP-relaxation, optimality conditions, location-allocation problemsAbstract
Context. The research object is the process of placing service centers (e.g., social protection services, emergency supply storage) and allocating demand for services continuously distributed across a given area. Mathematical models and optimization methods for location-allocation problems are presented, considering the overlap of service zones to address cases when the nearest center cannot provide the required service. The relevance of the study stems from the need to solve problems related to territorial distribution of logistics system facilities, early planning of preventive measures in potential areas of technological disasters, organizing evacuation processes, or providing primary humanitarian assistance to populations in emergencies.
Objective. The rational organization of a network of service centers to ensure the provision of guaranteed service in the shortest possible time by assigning clients to multiple nearest centers and developing the corresponding mathematical and software support.
Method. The concept of a characteristic vector-function of a k-th order partition of a continuous set is introduced. Theoretical justification is provided for using the LP-relaxation procedure to solve the problem, formulated in terms of such characteristic functions. The mathematical framework is developed using elements of functional analysis, duality theory, and nonsmooth optimization.
Results. A mathematical model of optimal territorial zoning with center placement, subject to capacity constraints, is presented and studied as a continuous problem of optimal multiplex partitioning of sets. Unlike existing models, this approach describes distribution processes in logistics systems by minimizing the distance to several nearest centers while considering their capacities. Several propositions and theorems regarding the properties of the functional and the set of admissible solutions are proven. Necessary and sufficient optimality conditions are derived, forming the basis for methods of optimal multiplex partitioning of sets.
Conclusions. Theoretical findings and computational experiment results presented in the study confirm the validity of the developed mathematical framework, which can be readily applied to special cases of the problem. The proven propositions and theorems underpin computational methods for optimal territorial zoning with center placement. These methods are recommended for logistics systems to organize the distribution of material flows while assessing the capacity of centers and the fleet of transportation vehicles involved.
References
Stanina O. D., Us S. A., Koriashkina L. S. Modeli ta metody rozv’jazannja zadach opymal’noho rozmishchennja dvoetapnoho vyrobnyctva z neperervno rozpodilenym resursom : monografija. Dnipro : vydets “Svidler A. L.”, 2021, 200 p.
Marianov V., Eiselt H. A. Fifty Years of Location Theory – A Selective Review, European Journal of Operational Research, 2024, Vol. 318, № 3, pp. 701–718. DOI: 10.1016/j.ejor.2024.01.036.
Drezner Z., Eiselt H. A. Competitive location models: A review, European Journal of Operational Research, 2024, Vol. 316, № 1, pp. 5–18. DOI: 10.1016/j.ejor.2023.10.030.
Koriashkina L. S. Rozshyrennja odnogo klasu neskinchenno-vymirnykh optymizacijnykh zadach, Visn. Cherkas’koho un-tu. Ser. Prykl. matem. Inf., 2015, № 18 (351), pp. 28–36.
Koriashkina L. S., Lubenets D. Matematychni modeli ta metody mul’typleksnoho rozbyttja i bahatokratnoho pokryttja mnozhyn dlya zadach rozmishchennja-rozpodilu, Information Technology: Computer Science, Software Engineering and Cyber Security, 2023,№ 4, pp. 12–25.
Drezner Z. In: Salhi S., Boylan J. (eds) Continuous Facility Location Problems, The Palgrave Handbook of OperationsResearch. Cham, Palgrave Macmillan, 2022. DOI: 10.1007/978-3-030-96935-6_9.
Wolf G. W. Solving location-allocation problems with professional optimization software, Transactions in GIS, 2022, Vol. 26, № 7, pp. 2741–2775. DOI: 10.1111/tgis.12997.
Alumur S. A. Hub location and related models, Contributions to Location Analysis – In Honor of Zvi Drezner’s 75th Birthday. Switzerland, Springer, 2019, pp. 237–252.
Callaghan B., Salhi S., Brimberg J. Optimal solutions for the continuous p-centre problem and related-neighbour and conditional problems: A relaxation-based algorithm, Journal of the Operational Research Society, 2019, Vol. 70, № 2, pp. 192–211.
Brimberg J., Maier A., Schöbel A. When closest is not always the best: The distributed p-median problem, Journal of the Operational Research Society, 2021, Vol. 72, № 2, pp. 200–216.
Yao J., Murray A. T. A Spatial Optimization Approach for Solving a Multi-facility Location Problem with Continuously Distributed Demand, 2020. DOI: 10.1007/978-3-030- 43694-0_6.
Koriashkina L. S., Cherevatenko A. R. Continuous problems of optimal multiplex-partitioning of sets without constraints and solving methods, Journal of Computational & Applied Mathematics, 2015, № 2 (119), pp. 15–32.
Koriashkina L. S., Cherevatenko A. P. Neperervni linijni zadachi opymal’noho mul’typleksnoho rozbyttja mnozhyn z obmezhenniamy, Visnyk Har’kivs’koho nacional’noho universytetu imeni V. N. Karazina. Serija «Matematychne modeljuvannja. Informacijni tehnologii. Avtomatyzovani systemy upravlinnja», 2015, Vyp. 28, pp. 77–91.
Royden H. L., Fitzpatrick P. M. Real analysis. 4th ed. Boston, Pearson, 2010.
Rudin W. Functional analysis, 2nd ed. New York, McGrawHill, 1991.
Boyd S., Vandenberghe L. Convex optimization. Cambridge, Cambridge University Press, 2004.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 L. S. Koriashkina, D. E. Lubenets, O. S. Minieiev, M. S. Sazonova

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
-
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
-
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
-
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.