TY - JOUR
ID - 11214
TI - Enhancing the solution method of linear Bi – level programming problem based on enumeration method and dual method
JO - Journal of Advanced Mathematical Modeling
JA - JAMM
LA - en
SN - 2251-8088
AU - Nakhai Kamalabadi, Isa
AU - Hosseini, Eghbal
AU - Fathi, Mohammad
AD - Department of Industrial Engineering, University of Kurdistan
AD - Payamenur University of Tehran, Department of Mathematics
AD - Department of Power Engineering, University of Kurdistan
Y1 - 2014
PY - 2014
VL - 4
IS - 1
SP - 27
EP - 53
KW - Bi-level programming problem
KW - KKT conditions
KW - Enumeration method
KW - Dual problem
DO -
N2 - In the recent years, the bi-level programming problem (BLPP) is known as an appropriate approach for solving the real problems in applicable areas such as traffic, transportation, economics and supply chain management. There are several known algorithms to solve BLPP as an NP-hard problem. Almost all proposed algorithms in references have been used the Karush-Kuhn–Tucker to convert the BLPP into the single level problem which the obtained problem is complicated. In this paper, we attempt to develop two effective approaches, one based on enumeration method and the other based on duality characteristic for solving the linear BLPP. In these approaches, the BLPP is solved without using the Karush-Kuhn–Tucker conditions. The presented approaches achieve an efficient and feasible solution in an appropriate time which has been evaluated by comparing to references and test problems.
UR - https://jamm.scu.ac.ir/article_11214.html
L1 - https://jamm.scu.ac.ir/article_11214_7e521bae700ef0bc5815247aceba9186.pdf
ER -