Summation of the Enumerators in the Discrete Optimization Problems
Author(s):
Sergey Kuznetsov
Unidata LLC
Saint-Petersburg State University
sergey.kouznetsov@gmail.com
Abstract:
The publication presents an approach to the use of discrete optimization algorithms,
in particular, the search for suboptimal solutions. The theory of enumerators,
proposed by the famous Leningrad mathematician I.V. Romanovsky, and the operation of
their summation, which is proposed to be used to create multi-domain suboptimal algorithms,are considered. The paper presents an efficient algorithm to sum enumerators based on the recalculation of the Pareto boundary. Motivations for using the proposed algorithm within the framework of a well–known task in the field of Master Data Management are given.
Keywords
- discrete optimization
- enumerators
- master data management
- Pareto boundary
- suboptimal problems
References:
- Kantorovich L. V. " Mathematical methods of organizing and planning production. " Management science 6. 4, 1960, pp. 366-422 (in Russian)
- Romanovsky J. V. Suboptimal solutions. Petrozavodsk: Petrozavodsk University Publishing House. 1998 (in Russian)
- Romanovsky J. V., Kuznetsov S. V. A generalized algorithm for summing enumerators of suboptimal solutions // Vestnik of Saint Petersburg University. Series 1. Mathematics. Mechanics. Astronomy, 2005, 2, pp. 74-87 (in Russian)
- Romanovsky J. V. Search of suboptimal solutions in discrete optimization problems //Computer tools in education, 2012, 6, pp. 25-34
- Brumstein Y. M., Tarkov D. A., Dyudikov I. A. The models and methods analysis of optimum choice for decisions sets in conditions of resource restrictions and risks // Caspian Journal: Management and High Technologies, 2013, 3 (23), 169-180
- Lukicheva N. M. On mathematical approaches in planning, forecasting and management //Topical issues of the development of modern society, 2019, pp. 306-309
- Kirillov Y. V. Multicriteria modeling as the basis of information technologies for decision support // Fundamental research. - 2004. - No. 6. - pp. 85-97
- Marler R. T., Arora J. S. Survey of multi-objective optimization methods for engineering //Structural and multidisciplinary optimization, 2004, 26, pp. 369-395
- Kuznetsov S., Konstantinov A., Skvortsov N. The value of your data, Alpina PRO Publishing House, 2022 (in Russian)
- DAMA-DMBOK: A body of knowledge on data management. Second edition. Moscow: Olymp-Business, 2020
- Minieka E., Shier D. A note on an algebra for the k best routes in a network// Journ. Inst. Math. Appl. 1973. Vol. 11. P. 145-149
- O. E. Maikova. Suboptimal regimes in the Fuller problem // Proc. Steklov Inst. Math., 236 (2002), pp. 214-217
- Dzh. A. Babaev, K. Sh. Mamedov, M. G. Mekhtiev, “Methods of constructing suboptimal solutions of the multi-dimensional rucksack problem”, U. S. S. R. Comput. Math. Math. Phys., 18:6 (1978), pp. 82-91
- Mohanta K. et al. Comprehensive study on computational methods for k-shortest paths problem // International Journal of Computer Applications. 2012. 40 (140), pp. 22-26
- Koznov D. V. Methodology and tools of subject-oriented modeling. Dissertation for the degree of Doctor of Technical Sciences / St. Petersburg State University. St. Petersburg, 2016 (in Russian)
- Koznov D. V., Peregudov A. F., Bugaychenko D. Yu., Chernyatchik R. I., Kazakova A. S., Pavlinov A. A. Visual environment for designing broadcasting systems. System programming, 2006, 2 (1), pp. 142-168 (in Russian)