期刊
COMPUTERS & OPERATIONS RESEARCH
卷 41, 期 -, 页码 309-318出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2013.07.016
关键词
Bilevel optimization; Bilevel mixed integer linear programming; Branch-and-bound
类别
资金
- National Science Foundation [EFRI-0835989]
- Electric Power Research Center at Iowa State University
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据