【摘要】 利用线性规划的线性、几何平面这一两面性结构特点,定义了LP问题的一种特殊基点转移矩阵及其转移运算,并建立了单纯形基点的定向迭代转移模型,从而提出了一种求解LP问题的两阶段基点定向转移搜索方法.另外,借助新提出的可行域局部ε-正则化方法,将退化基点迭代转移转化为非退化基点迭代转移,彻底消除了基点退化对极点转移搜索过程的不利影响.更多还原

【Abstract】 Based on the linear and geometric-plane features of linear programming,a special matrix was defined together with a transferring operation.A directionally iterating and transferring model of simplex’s basis-vertex was given.With the help of this model,a two-step Vertex Steepest Extreme Direction Transition iteration algorithm for linear programming problem was proposed.In addition,by this simplex locally regularized method,the degenerated vertexes’ iteration transition can be changed into the non-degenerate vertexes’ iteration transition,thus eliminating the negative effect of vertex degeneration on vertex iteration transition processes.更多还原