摘要
自从L.G.Khachian(1979)提出求解线性规划的多项式算法以来,已有许多学者对其进行了改进,并将其推广到了带约束或无约束的非线性规划问题,得到了一些深切(Deep Cut)方法.对这些方法进行总结并做了一些数值实验,认为对非线性问题来讲这些深切改进并不比原始的中心切(center cut)有效.事实上,这些深切方法并没有找到有效的线性搜索方向,也没有达到深切的目的.关于线性规划的研究。
In this paper, a modification of the ellipsoid method for the convex unconstrained prog-ramming using BPGS method is first given. Then this method is applied to an uncons-trained model of linear programming. Thus, a new polynomial-time algorithm for linearprogramming is obtained. The advantages of this new algorithm are also analyzed. Final-ly some numerical results are given and the new algorihm is compared with other four me-thods.
出处
《数值计算与计算机应用》
CSCD
北大核心
1993年第4期252-264,共13页
Journal on Numerical Methods and Computer Applications
基金
国家自然科学基金
