| 求解线性双层规划的一个全局收敛算法 |
| |
| 引用本文： | 邸振,查伟雄.求解线性双层规划的一个全局收敛算法[J].青岛大学学报(自然科学版),2010,23(1):25-27,31. |
| |
| 作者姓名： | 邸振 查伟雄 |
| |
| 作者单位： | 1. 南昌工程学院,理学系,江西,南昌330099;华东交通大学,交通运输与经济研究所,江西,南昌330013
2. 华东交通大学,交通运输与经济研究所,江西,南昌330013 |
| |
| 摘 要： | 基于线性双层规划的最优解在约束域极点上达到这一特性,得到了线性双层规划问题的一些性质。然后给出了一个求解线性双层规划的全局收敛算法,该算法从合理反应集的一个顶点开始进行搜索。最后通过一个算例说明这种算法的可行性和优越性。
|
| 关 键 词： | 运筹学 全局最优解 线性双层规划 合理反应集 |
A Global Convergent Algorithm for Solving Bi-level Linear Programming |
| |
| DI Zhen,ZHA Wei-xiong.A Global Convergent Algorithm for Solving Bi-level Linear Programming[J].Journal of Qingdao University(Natural Science Edition),2010,23(1):25-27,31. |
| |
| Authors: | DI Zhen ZHA Wei-xiong |
| |
| Institution: | 1. Department of Science, NanChang Institute of Technology, Jiangxi Nanchang 330099; 2. Institute of Transportation and Economics, East of China JiaoTong University, Jiangxi Nanchang 330013, China) |
| |
| Abstract: | Based on the characteristic of the BLP＇s optimal solution being reached on the pole of the constraint domain,some natures of this problem are obtained. Then a global convergent algorithm of BLP is given which itants the search from a vertex of the rational reaction set. Finally, a simple example is given to illustrate the feasibility and superiority of this algorithm. |
| |
| Keywords: | operations research global optimal solution Bi-level linear programming rational reaction set |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
