一种求解LP问题的两阶段基点迭代转移方法

A Two-step Base Point Iterating Transition Algorithm for the Linear Programming Problem

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

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 rood plex＇s basis-vertex was given. With the help of this model, a two-step Vertex Steepest Extreme Transition iteration algorithm for linear programming problem was proposed. In addition, by thi locally regularized method, the degenerated vertexes＂ iteration transition can be changed into th generate vertexes＂ iteration transition, iteration transition processes. el of sire- Direction s simplex e non-de- eliminating the negative effect of vertex degeneration on vertex