摘要
针对求解二维线性规划问题的几何算法—图解法,给出了一个二维线性规划问题最优解的性质定理,得到了求解二维线性规划问题的一个直接的代数性算法。利用该算法,可得到一般性规划问题的加速算法,其迭代过程至少是按二维迭代的,迭代速度快于单纯形法。
Aim at the chart solution of two-dimensional linear programming questions, a property theorem about optimum solution of two-dimensional linear programming questions was given, and a alglebraic algorithm of two-dimensional linear programming questions was gained. Then generalize the algorithm, a new algorithm of linear programming questions can gain.The new algorithmrapidity of convergence is faster than simplex method.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2004年第1期94-97,共4页
Journal of University of Electronic Science and Technology of China
关键词
线性规划
图解法
基平面
单纯形法
linear programming
chart solution
base plane
simplex method
