Bilevel linear programming
Bilevel linear programming
复制标题
DOI：
10.1016/0305-0548(93)90013-9
复制
发表时间：
1993-06
期刊：
影响因子：
--
通讯作者：
Omar Ben-Ayed
中科院分区：
文献类型：
--
作者：
Omar Ben-Ayed
本文综述了二层线性规划(BLP)的特点，给出了以前的结果，并提供了新的结果，包括该问题表示任意分段线性函数的能力及其与其他优化问题的联系。本文还对BLP的应用和算法进行了综述，BLP的NP难度并不妨碍该模型在实际问题中的成功应用。澄清了文献中某些令人困惑的表述。
This paper gives a review of the features of Bilevel Linear Programming (BLP) by presenting prior results as well as providing new results, including the capability of the problem to formulate any piecewise linear function and its connection to other optimization problems. The paper also surveys the applications and the algorithms of BLP; the NP-hardness of BLP did not prevent the success of several applications of the model to real world problems. Certain confusing representations in the literature are clarified.