Solving a two-stage continuous-discrete optimal partitioning-allocation problem with a given position of the subsets centers / Kiseleva, / Prytomanova, / Us. (2020)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2020, 56 (1))

Kiseleva Å.Ì., Prytomanova O.M., Us S.A.
Solving a two-stage continuous-discrete optimal partitioning-allocation problem with a given position of the subsets centers

A method and algorithm of solving a two-stage continuous-discrete problem of optimal partition–allocation are proposed. On the one hand, the problem is a generalization of the classical transportation problem in the case where production (storage and recycling) amounts at given points are unknown in advance, and are sought as a solution of the corresponding continuous problem of optimal partitioning of a set of continuously allocated consumers (suppliers) onto their service areas by these points. On the other hand, the problem generalizes discrete two-stage production–transportation problems to the case of a continuously allocated consumer. Operation of the proposed algorithm is demonstrated by solving a model problem. © 2020, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: infinite-dimensional mathematical programming, non-differentiable optimization, optimal partition–allocation, transportation problem, Mathematical programming, Continuous problems, Continuous-discrete, Infinite dimensional, Non-differentiable optimization, Optimal partitioning, Optimal partitions, Transportation problem, Two-stage production, Storage as a service (STaaS)


Cite:
Kiseleva Å.Ì., Prytomanova O.M., Us S.A. (2020). Solving a two-stage continuous-discrete optimal partitioning-allocation problem with a given position of the subsets centers. Cybernetics and Systems Analysis, 56 (1), 3–15. doi: https://doi.org/10.1007/s10559-020-00215-y http://jnas.nbuv.gov.ua/article/UJRN-0001074958 [In Russian].


 

Institute of Information Technologies of VNLU


+38 (044) 525-36-24
Ukraine, 03039, Kyiv, Holosiivskyi Ave, 3, room 209