摘要
本文提出一类线性规划问题。在[1],[2]中刘周二位教授给出了单纯形算法,在[3]中我们给出了递推算法,它比单纯形算法简单,在[4]中我们给出了Flood's算法,更进一步提高计算速度。在这篇文章中提出饱和布局的概念,证明最优解的充分必要条件是饱和布局,这一结论保证了[3]、[4]的计算方法是正确的。
In this paper, we will give a class of linear programming problem. In [1] & [2], Prof. Liu and Prof. Zhou had given the simplex algorithm. In [3], we had given the recursive algorithm, it is simpler than the simplex algorithm. In [4], we had given the Flood's algorithm, it will simplify further the algorithm and raise its calculating speed. In this paper we will give the concept of the saturate disposition, and proof that the feasible solution is optimal solution if and only if it is saturate disposition. This result can assure the algorithm of [3] & [4] is true.
出处
《系统工程》
CSCD
1992年第2期52-61,共10页
Systems Engineering
关键词
最优解
线性规划
饱和布局
Linear programming
Saturate disposition
Disposition problem
Disposition transform
