二层线性规划求顶点的算法  

Algorithm on Finding Vertex of Bilevel Linear Programming

作　　者：陶玉杰[1] 张永[2] 杨杰[1] 

机构地区：[1]通化师范学院数学系,吉林通化134002 [2]廊坊师范学院教育系,河北廊坊065000

出　　处：《通化师范学院学报》2007年第4期8-9,34,共3页Journal of Tonghua Normal University

摘　　要：讨论的是上层不带约束的二层线性规划模型,给出了求其所有顶点的算法,此算法为进行二层线性规划的灵敏度分析打下了坚实的基础.The model of bilevel linear progranuning which upper lever has without constraint is discussed in this paper,the algorithm which can find all vertexes of the programming is given. This algorithm provides a good foundation for sensitivity analysis of bilevel linear progranuning.

关 键 词：二层线性规划 顶点 最小下降量 

分 类 号：O221[理学—运筹学与控制论]