| 两层广义线性规划 |
| |
| 引用本文： | 刘红英,刘三阳,周水生. 两层广义线性规划[J]. 系统工程学报, 2000, 15(2): 131-135 |
| |
| 作者姓名： | 刘红英 刘三阳 周水生 |
| |
| 作者单位： | 西安电子科技大学应用数学系,西安,710071 |
| |
| 摘 要： | 给出二层广义线性规划最优解极点可达性的一个充分条件 .此外 ,利用容许集的极点与下层问题可行集的极点间的关系给出“第 k最好”算法的一种快捷、方便的实现 .算例表明算法是有效的 .
|
| 关 键 词： | 两层广义线性规划 “第k最好”算法 修正单纯形法 |
Bilevel generalized linear programming problem |
| |
| LIU Hong-ying,LIU San-yang,ZHOU Shui-sheng. Bilevel generalized linear programming problem[J]. Journal of Systems Engineering, 2000, 15(2): 131-135 |
| |
| Authors: | LIU Hong-ying LIU San-yang ZHOU Shui-sheng |
| |
| Abstract: | A sufficient condition under which the optimal solution of the bilevel generalized linear programming problem occurs at a vertex of it's constraints set is presented. Based on that, a quickly and conveniently implement of the " k th best" algorithm is proposed, with a numerical example to illustrate the performance of the algorithm developed. |
| |
| Keywords: | bilevel generalized linear programming problem,the " k th best" algorithm,revised simplex method |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
