APPLICATION OF THE GENERAL ALGORITHM OF LINEARIZATION IN LINEAR FRACTIONAL OPTIMIZATION PROBLEMS IN PROJECT MANAGEMENT
DOI:
https://doi.org/10.20998/2413-3000.2024.9.10Keywords:
linear fractional optimization, project management, resources, linearization algorithm, risk managementAbstract
Effective planning of resources and optimization of the work schedule allows you to minimize costs and adhere to project deadlines, which ensures the quality of results. Many real projects include complex interdependencies and constraints that can be described by nonlinear models, complicating the process of their optimization. The use of a general linearization algorithm for nonlinear optimization problems offers an innovative approach to simplifying and solving complex planning problems. Linearization makes it possible to transform non-linear models into linear forms that are more convenient for calculation, which facilitates the application of linear programming methods. This is especially important in conditions of limited resources and strict constraints on the time and budget of the project. If the project has a complex schedule with many interdependent tasks, as well as limited resources, we believe that the original model contains nonlinear constraints, for example, dependencies between different tasks that affect the duration and use of resources. Using linearization techniques, such as replacing nonlinear constraints with linear approximations or using partial derivatives for local linearization, the problem can be simplified to a linear form. After linearization, linear optimization methods, such as linear programming, are used to determine the optimal resource allocation and task execution schedule.One of the most common examples of using the linear fractional optimization in project management is given by a problem of minimizing the expense per a unit of time or resource while maximizing the tasks completion quality. For example, in planning of a construction project, managers can use linear fractional models for optimizing the expense for construction materials and manpower with ensuring a high quality of works and good meeting of the schedule milestones at the same time.
References
Goyer O. Modern view of project management problems. Actual problems of international relations. 2012. Issue 111(2), pp. 125–135. URL: http://nbuv.gov.ua/UJRN/apmv_2012_111(2)__17.
Oghirko O., Krap-Spisak N. Information technology of project management. Bulletin of the Lviv Polytechnic National University. Computer Science and Information Technology. 2016. No. 843, pp. 57–64. URL: http://nbuv.gov.ua/UJRN/VNULPKNIT_2016_843_10.
Pandian P., Natarajan. A new method for finding an optimal solution for transportation problems. International Journal of Mathematical Sciences and Engineering Applications. 2010. 4(2), pp. 59–65.
Rodashchuk G., Kontseba S., Lischuk R., Skurtol S. Network planning in IT project management. Taurian Scientific Bulletin. Series: Technical Sciences. 2023. No. 1, pp. 42–56.
Tripathi M., Kumar A. Systematic literature review of software project management performance measurement. Journal of Software Engineering Research and Development. 2019. No. 7(1).
Smetaniuk O., Bondarchuk A. Peculiarities of the project management system in IT companies. Agrosvit. 2020. URL: http://www.agrosvit.info/index.php?op=1&z=3205&i=14.
Bushuyev S., Ivko A. Construction of models and application of syncretic innovation project management in the era of artificial intelligence. Eastern-European Journal of Enterprise Technologies. 2024. 3(3(129)), pp. 44–54.
Bushuyev S., Ivko A. Values Spiral Development Method in the Implementation of Digitalization Projects in Syncretic Methodology. International Journal of Computing. 2024. 23(2), pp. 177–186.
Bushuyev S., Onyshchenko S., Bushuyeva N., Bondar A. Modelling projects portfolio structure dynamics of the organization development with a resistance of information entropy. International Scientific and Technical Conference on Computer Sciences and Information Technologies. 2021. Vol. 2, pp. 293–298. doi: 10.1109/CSIT52700.2021.
Abd-Elhameed W., Ali A. New Specific and General Linearization Formulas of Some Classes of Jacobi Polynomials. Mathematics. 2021. 9(1), p. 74. doi: 10.3390/math9010074.
Hahnloser R. Learning algorithms based on linearization network. Computation in Neural Systems. 1998. 9(3), pp. 363–380. doi: 10.1088/0954-898X_9_3_006.
Ghaoui L., Oustry F., AitRami M. A cone complementarity linearization algorithm for static output-feedback and related problems. IEEE Transactions on Automatic Control. 1997. Vol. 42, No. 8, pp. 1171–1176. doi: 10.1109/9.618250.
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Our journal abides by the Creative Commons copyright rights and permissions for open access journals.
Authors who publish with this journal agree to the following terms:
Authors hold the copyright without restrictions and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (CC BY-NC-SA 4.0) 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-commercial and 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 published work online (e.g., in institutional repositories or on their website) as it can lead to productive exchanges, as well as earlier and greater citation of published work.