M.N. Belozerov1, E.A. Kalashnikov2, A.N. Smirnov3
1, 2 National Research Technological University «MISIS» (Moscow, Russia)
3 SberBank of Russia (Moscow, Russia)
1 mnbelozyorov@gmail.com, 2 e.a.kalashnikov@mail.ru, 3 asmirnov889@yandex.ru
Problem statement. Calculating the optimal charge in the production of secondary aluminum alloys is a multi-criteria task due to many factors and limitations. One of the ways to solve this problem is to calculate using linear programming. The purpose of the study is to develop an algorithm for finding the optimal charge option in the production of secondary aluminum alloys based on the duality theory. Results. A comparison of algorithms for finding solutions using the simplex method for a different number of available technological options for alloy production is carried out. To do this, we used theorems that establish a strict relationship between direct and dual linear programming problems. Practical significance. The developed algorithm makes it possible to find a variant of the alloy production technology that is close to the best in terms of cost, found among the variety of possible compositions. The algorithm significantly speeds up the process of finding a solution by using an iterative approach, which makes it useful for operational planning of production processes.
Belozerov M.N., Kalashnikov E.A., Smirnov A.N. An algorithm for finding the optimal charge option in the production of secondary aluminum alloys. Dynamics of complex systems. 2026. V. 20. № 3. P. 56−66. DOI: 10.18127/j19997493-202603-06 (in Russian).
- Takbaev D.K. Programmnaya realizaciya proizvodstvennogo processa na baze simpleks-metoda. Teoreticheskie i prakticheskie aspekty` formirovaniya i razvitiya «novoj nauki». 2022. S. 13–26.
- Yakubova U.Sh., Mirxodzhaeva N.Sh., Parpieva N.T. Nekotory`e primeneniya teorii dvojstvennosti pri reshenii zadach linejnogo programmirovaniya. Byulleten` nauki i praktiki. 2022. T. 8. № 5. S. 621–628.
- Smagin B.I. Dvojstvenny`j simpleksny`j metod resheniya zadachi linejnogo programmirovaniya (s ispol`zovaniem sistemy` Maple). Nauka i Obrazovanie. 2023. T. 6. № 2.
- Kudryashova O.M., Dvoreczkaya P.S. Ispol`zovanie metoda celochislennogo programmirovaniya v zadache raskroya materiala. Informacionny`e texnologii v upravlenii i e`konomike. 2021. № 2. S. 37–43.
- Pikul` V.V., Eroshenko A.E. Snizhenie zatrat na legirovanie i raskislenie stali ferrosplavami putem optimizacii texnologii dvojstvenny`m simpleks-metodom s ispol`zovaniem programmny`x sredstv v usloviyax RUP «BMZ». Lit`yo i metallurgiya. 2008. № 2 (46). S. 93–96.
- Karashaev M.M. i dr. Texnologicheskie osnovy` sozdaniya metallicheskix kompozicionny`x materialov, armirovanny`x oksidny`mi i intermetallidny`mi chasticzami. Aviacionny`e materialy` i texnologii. 2020. № 3 (60). S. 29–36.
- Buincev V.N., Ry`benko I.A. Matematicheskaya model` i trenazher processa polucheniya aglomerata. Algoritm poiska optimal`nogo varianta shixtovki pri proizvodstve vtorichny`x alyuminievy`x splavov. Tvorcheskoe nasledie VE Grum-Grzhimajlo: istoriya, sovremennoe sostoyanie, budushhee. Ch. 1. Ekaterinburg, 2014. 2014.
- Rogozhin P.I., Brusov A.L. Raschyot shixty` dlya vy`plavki mednogo splava iz mednogo loma. Metallurgiya XXI stoletiya glazami molody`x. 2017. S. 77–78.
- Martusevich E.A., Buincev V.N. Poisk resheniya texnologicheskix zadach metodom posledovatel`noj optimizacii. Innovacionny`e texnologii nauchnogo razvitiya: sb. statej Mezhdunar. nauchno-prakt. konf. 2017. S. 282.
- Dhote M., Dhote G. Solution of goal programming using alternative approach of dual simplex method. Recent Advances in Material, Manufacturing, and Machine Learning. CRC Press. 2024. S. 21–26.
- Huang M. et al. Simplex initialization: A survey of techniques and trends. arXiv preprint arXiv:2111.03376. 2021.
- Dorfman R. Application of linear programming to the theory of the firm: including an analysis of monopolistic firms by non-linear programming. Univ of California Press. 2022.
- Ahmed Mohammed Zubair S. et al. On the Simplex-based methods for Neutrosophic linear programming problems. Journal of Fuzzy Extension and Applications. 2024. T. 5. № 4. S. 573–593.

