摘要
In this paper, a hybrid method for linear programming is established. Itssearch direction is defined as a combination of two directions in simplex method and affinescaling interior point method. The method is Proven to have some promising convergenceproperties. The relation among the new method, the simplex method and the affine-scalinginterior point method is discussed.
In this paper, a hybrid method for linear programming is established. Itssearch direction is defined as a combination of two directions in simplex method and affinescaling interior point method. The method is Proven to have some promising convergenceproperties. The relation among the new method, the simplex method and the affine-scalinginterior point method is discussed.
