流动含优面法──求解线性规划问题（LP）的一种快速算法

A NEW METHOD FOR LINEAR PROGRAMMING PROBLEM

流动含优面法──求解线性规划问题（ＬＰ）的一种快速算法阮国桢主题词线性规划，基点，含优面分类号Ｏ２２１，１流动含优面法简介考虑线性规划问题ｍａｘｆ＝ｅｘ（ＬＤ）ｓ．ｔ。ＡｘＣｂ．ｘＭＯ其中ｃ，ｘ６Ｒ”，ｈＥＲ”，Ａ是ｍＸｎ矩阵．Ｘ一｛ｘ６Ｒ叫Ａｘ＜ｂ...

Let x* be the optimal solution for the linear programming problem(LP),P be a face of X that the feasible set of(LP).If x' ∈p,then P is called the co-optimal face.Our method searches the basic point from the co-optimal face to a lower dimension co-optimal face,and so takes n steps at most to a optimal extreme.We obtain some criterions for the cooptimal face in the special tableau.