Generalization of the mathematical problem of the assignment model
Article Sidebar
Main Article Content
Abstract
The article considers the construction of a generalized mathematical model of the assignment problem and its solution, followed by computer implementation in the symbolic mathematics environments Maple and Mathematica. The effective method of solving the generalized assignment problem was developed. The theoretical justification of the developed technique was performed and it was interpreted from the standpoint of the concept of dynamic optimization. Model examples of solutions are provided. Based on the packages of symbolic mathematics Maple and Mathematica, that implements the developed algorithm. An alternative computer calculation of model examples was performed and the results were compared with manual calculations. Computer calculations were performed in the environments of the computer packages Maple and Mathematica, using the core routines library packages. The results of the model solution were compared with the previous results. The algorithm of using the proposed model in project planning procedures was developed.
Article Details
References
2. Zaichenko, Yu.P., (1975). Isledovanie operaciy [Operations Research]: Uchebnik dlya vuzov ‒ A Textbook for High Schools. ‒ Kyiv: Vishcha schkola [in Russian].
3. Kuhn, H.V. (1955), The Hungarian method for the assignment problems. Naval. Res. Logist. Quart. 2, (83-97) [in English].
4. Kuhn, H.V. (1956), Variants of the Hungarian method for the assignment problems. Naval. Res. Logist. Quart. 3, (253-258) [in English].
5. Konig, D. (1990), Theory of finite and infinite graphs. Boston: Birkhauser, doi: 10.1007/978-1-4684-8971-2 [in English].
6. Bondarenko, M.F., Bilous N.V., Rutkas A.G., (2004). Computerna diskretna matematika [Computer discrete mathematics]: ‒ Kharkiv [in Ukrainian]
7. Kenneth, H. Rosen Discrete Mathematics and Its Applications 2002 by McGrawHill Science [in English].
8. Kuzmenko, I.M.(2020), … Kyiv: KPI im. Igor Sikorsky [in Ukrainian].
9. Nikolsky, Yu.V., Pasichnik V.V., Shcherbina Yu.M. (2007). Diskretna matematika [Discrete mathematics]. ‒ Kyiv.: Vidavnicha gruppa BHV [in Ukrainian].
10. Burkard, Rainer; M. Dell'Amico, S. Martello (2012). Assignment Problems (Revised reprint). SIAM. ISBN 978-1-61197-222-1. [in English].
11. Bekh, O.V. (2014). Matematichne programyvannya [Mathematical programming]: ‒ Lviv: Magnolia-2006 [in Ukrainian].
12. Dzyuban, I.Yu.(2005). Metodi doslidzhennya operatciy [Methods of follow-up operations]: Kyiv: IVC Vydavnitstvo «Polytekhnika» [in Ukrainian].
13. Doslidzhennya operatciy v economitci [Recent operations in the economy]:– Kyiv: Knowledge, (2007) [in Ukrainian].
14. Krushevsky, A.V. (2001). Matematichne programuvannya v ekonomitci ta upravlinni [Mathematical programming in economics and management]: Kyiv: IMMB [in Ukrainian].
15. Tolbatov, Yu.A.(2008). Matematichne programuvannya [Mathematical programming]: ‒ Ternopil: Assistants and assistants [in Ukrainian].
16. Kutkovetsky, V.Ya. (2004). Doslidzhennya operatcii [Follow-up operations]: ‒ Kyiv: Type «Professional» [in Ukrainian].
17. Tarakanov, V.E.(1985) Kombinatornie zadachi i (0,1) – matritsi [Combinatorial problems and (0,1) matrices]. − M.: Nauka [in Russian].