.png){kind=icon}
.png){kind=icon}
Return
An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2013.07.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present an exact algorithm for the bilevel mixed integer linear programming (BMILP) problem under three simplifying assumptions. Although BMILP has been studied for decades and widely applied to various real world problems, there are only a few BMILP algorithms. Compared to these existing ones, our new algorithm relies on fewer and weaker assumptions, explicitly considers finite optimal, infeasible, and unbounded cases, and is proved to terminate finitely and correctly. We report results of our computational experiments on a small library of BMILP test instances, which we created and made publicly available online. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Bilevel optimization
Bilevel mixed integer linear programming
Branch-and-bound
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W