摘要
本文讨论用单纯形表实现求解线性二级规划的高点法，给出了在单纯形表中检验当前极点的可行性的原理和方法．
This paper suggests a simplex method for soluing the linear bilevel programming prlblem and employing 'Kth - Best'rule to make choice the variate to enter basis.The recognizing principle of feasibility in simplex tableau is obtained,that gives us a convenient way to test the feasibility of the present extreme-point.
出处
《湘潭大学自然科学学报》
CAS
CSCD
1996年第1期37-39,共3页
Natural Science Journal of Xiangtan University
关键词
线性规划
线性二级规划
单纯形法
linear programming, linear bileuel programming,simplex method
