摘要
为了进一步完善解线性规划问题的单纯形法，本文给出了表达一类具有无穷多个最优解的线性规划问题通解的方法。该法是利用线性规划问题的最优基的单纯形表确定线性规划问题的全部最优基可行解及满足条件ＣＴＵ＝０的极齐次解。
To improve the method of solving linear programming problem by means of simplex method, this paper gives the method of linear programming problem general solution with infinite optimal solutions.This method utilizes the optimal basis simple tabuleau of linear programming problem to determine the all optimal basic feasible solution of linear programming problem,and the vertex homogeneous solution of meeting CTU=0.
出处
《东北林业大学学报》
CAS
CSCD
北大核心
1994年第4期120-127,共8页
Journal of Northeast Forestry University
关键词
线性规划
单纯形算法
通解
Linear programming
Simple algorithms
General solutions
