TY - JOUR
T1 - A simplex-based branch-and-cut method for solving integer tri-level programming problems
AU - Awraris, Ashenafi
AU - Wordofa, Berhanu Guta
AU - Kassa, Semu Mitiku
N1 - Funding Information:
The research of the first author was supported by the International Science Program (ISP) of Sweden, through a research project at the Department of Mathematics, Addis Ababa University.
Publisher Copyright:
© 2021 Global Research Online. All rights reserved.
PY - 2022
Y1 - 2022
N2 - Optimization problems involving three decision makers at three hierarchical decision levels are referred to as tri-level decision making problems. In particular in the case where all objective functions and constraints are linear, and all involved variables are required to take integer values is known as integer tri-level programming problems (T-ILP). It has been known that the general T-ILP is an NP-hard problem. So far there are very few attempts in the literature that finds an exact global solution for integer programming hierarchical problems beyond two levels. This paper proposes a novel approach based on a branch-and-cut (B&C) framework for solving T-ILP. The convergence of the algorithm is proved. Numerical examples are used to demonstrate the performance of the proposed algorithm. Finally, the results of this study show that the proposed algorithm is promising and more efficient to solve T-ILP. Moreover, it has been indicated in the remark that the proposed algorithm can be modified and used to solve discrete multilevel programming problems of any number of levels.
AB - Optimization problems involving three decision makers at three hierarchical decision levels are referred to as tri-level decision making problems. In particular in the case where all objective functions and constraints are linear, and all involved variables are required to take integer values is known as integer tri-level programming problems (T-ILP). It has been known that the general T-ILP is an NP-hard problem. So far there are very few attempts in the literature that finds an exact global solution for integer programming hierarchical problems beyond two levels. This paper proposes a novel approach based on a branch-and-cut (B&C) framework for solving T-ILP. The convergence of the algorithm is proved. Numerical examples are used to demonstrate the performance of the proposed algorithm. Finally, the results of this study show that the proposed algorithm is promising and more efficient to solve T-ILP. Moreover, it has been indicated in the remark that the proposed algorithm can be modified and used to solve discrete multilevel programming problems of any number of levels.
UR - http://www.scopus.com/inward/record.url?scp=85112385593&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85112385593&partnerID=8YFLogxK
U2 - 10.22436/JMCS.025.03.03
DO - 10.22436/JMCS.025.03.03
M3 - Article
AN - SCOPUS:85112385593
SN - 2008-949X
VL - 25
SP - 232
EP - 250
JO - Journal of Mathematics and Computer Science
JF - Journal of Mathematics and Computer Science
IS - 3
ER -