摘要
提出一个求解线性规划基本可行解的旋转法。该方法不需要引入任何人工变量以及辅助规划,从任意一个基本解(即非可行解,又非正则解)出发,通过适当的旋转变换使得基本解的负分量的个数逐步减少,最后得到一个基本可行解。
A Pivotal method for achieving a basic feasible solution of a linear programming is presented in this paper. The method need not introducing any artificial variables or auxiliary programming, begin with any basic solution（ either feasible nor regular） , through some proper pivotal transformations reduce the number of negative components of basic solution one after another and finally a basic feasible solution is obtained.
出处
《大连大学学报》
2009年第3期13-14,共2页
Journal of Dalian University
关键词
线性规划
旋转变换法
基本可行解
两阶段法
Linear programming
Pivotal method
Basic feasible solution
Two - phase method
