摘要
为减少转换次数，节省计算时间及工作量。
In this paper a new method of solving linear programming problem is given which can be regarded as an improved method of simplex method. Generally, this method needs few of number of rotation and computation time can be saved largely.
出处
《曲阜师范大学学报（自然科学版）》
CAS
1999年第2期14-16,共3页
Journal of Qufu Normal University(Natural Science)
基金
陕西省教委专项科研基金
陕西省科委自然科学研究计划项目
关键词
线性规划
单纯形法
基可行解
目标函数
linear program
simplex method
improved method of simplex method
base feasible solution
object function
