摘要
讨论的是上层不带约束的二层线性规划模型,给出了求其所有顶点的算法,此算法为进行二层线性规划的灵敏度分析打下了坚实的基础.
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.
出处
《通化师范学院学报》
2007年第4期8-9,34,共3页
Journal of Tonghua Normal University
关键词
二层线性规划
顶点
最小下降量
bilevel linear programming
vertex
minimum descent
