摘要
提出了一个新算法,取名为广义单纯形算法,它可被看作是单纯形法的扩展算法.新算法可行解定义范围增大,求解过程检验数不局限为一种符号.阐述了新算法机理并发表了新方法计算线性规划例题结果.
The paper presents a new algorithm which is named Generalized Simplex Algorithm. It is an extended algorithm of the Simplex Algorithm. The definition of feasibility solution in the new algorithm is expended. The checkout number does not need to be same sign in the process of finding solution. The paper explain the principle of the new algorithm and refer results of LP problems calculated by the new algorithm.
出处
《沈阳化工学院学报》
2004年第1期27-29,共3页
Journal of Shenyang Institute of Chemical Technolgy
关键词
线性规划
单纯形法
优化方法
linear programming
simplex method
optimal process
