摘要
运用线性规划的理论．分析了多目标BLP（Bileve lLinear Programming，二层线性规划）问题的最优解、有效极点集的笛卡尔积与下层问题的对偶问题的三者关系，进而提出了求解多目标BLP的一种新算法，并用实例证明了算法的可行性。
The relations of the optimal solution,the Descartes Product of Efficient Extreme point sets and the duality problem of substract problem of multi-objective bilevel linear programming were analysed by taking advantage of theorem of the linear programming.Then a new algorithm for multi-objective bilevel linear programming was presented.The feasiblity of the new algorithm is proved by using an example.
出处
《长江大学学报（自科版）（上旬）》
CAS
2008年第03X期113-115,共3页
JOURNAL OF YANGTZE UNIVERSITY (NATURAL SCIENCE EDITION) SCI ＆ ENG
关键词
多目标
BLP
对偶定理
极点集
笛卡尔积
multi-objective
bilevel linear programming
duality theorem
extreme point sets
the Descartes product
