线性规划的对偶基线算法

作     者：阮国桢 成央金 朱书尚 

作者机构：湘潭大学数学系 邵阳学院数学系湖南422000 中国科学院数学与系统科学研究院 

出 版 物：《计算数学》 (Mathematica Numerica Sinica)

年 卷 期：2002年第24卷第3期

页      面：257-264页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

基　　金：湖南省自然科学基金资助项目(97JJN-065) 

主　　题：线性规划 对偶线算法 保硬主元 约束方程组 

摘      要：In this paper,we studied the dual form of the basic line algorthm for linear *** can be easily implemented in tableau that similar to the primal/dual simplex *** from primal simplex method or dual simplex method,the dual basic line algorithm can keep primal feasibility and dual feasibility at the same time in a tableau,which makes it more efficient than the former *** and convergence of dual basic line algorthm were *** examplex and computational experience were given to illustrate the efficiency of our method.