Akademik Veri Yönetim Sistemi
12th INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND MATHEMATICAL MODELING, İstanbul, Türkiye, 19 Temmuz - 23 Ekim 2024, ss.185
In this study, an iterative method based on parameterization is developed to solve linear integer programming problems with linear constraints and a linear objective function, and a new efficient and reliable algorithm is presented. There are several methods used for solving LIP problems; however, most of these methods encounter difficulties in terms of computation and timing. In the proposed method, such computational and timing challenges are absent, providing significant advantages for the user. In our method, first, the original LIP problem is transformed into a new LIP problem using parameterization. Then, it is solved sequentially using interval arithmetic, graphical method, and Cartesian product. In this method, which is more better than the branch-and-bound and cutting plane methods, alternative solutions are also defined and presented to the decision-maker. Numerical examples are provided to demonstrate how the method is implemented and its effectiveness.