摘要
对于复杂的线性规划问题 ,求解第一个可行基与对应的单纯形表时 ,可引入人工变量 ,构造原问题的辅助问题并进行处理 .当辅助问题为非退化时 ,问题已得到解决 ;当辅助问题为退化的线性规划时 ,利用代数理论及单纯形方法 ,寻找原问题的第一个可行基和对应的单纯形表 .
When it comes to the complicated linear programming,the first feasible base and its corresponding simple tableau can be found with the help of artificial variables and the construction of auxiliary problems related to the original ones.When the auxiliary problem is non-degenerate,the original one is solved.This paper,by means of algebraic theory and simple method,mainly deals with how to find the first feasible base of the original problem and its corresponding simple tableau,when the auxiliary problem is degenerate linear programming.
出处
《郑州工业大学学报》
2000年第2期37-39,共3页
Journal of Zhengzhou University of Technology
关键词
人工变量
基可行解
最优基
线性规划
artificial variable
base
basic feasible solution
optimal base
