基于亏基的最陡边主元标算法  

The Deficient-basis Algorithm Based on the Most-steep-rule

作　　者：马艳琴[1] 唐风军[1] 王爱苹[1] 卜春霞[2] 

机构地区：[1]黄河科技学院电子系,河南郑州450063 [2]郑州大学数学系,河南郑州450001

出　　处：《数学的实践与认识》2016年第17期20-25,共6页Mathematics in Practice and Theory

基　　金：河南省科技厅基础与前沿技术研究资助项目(132300410217)

摘　　要：在最陡边规则的基础上建立了新的主元标规则,并将其应用到亏基情形,在亏基的框架下建立了一个新的求对偶可行基的算法,数值结果表明,新算法能够减少迭代次数,算法效率较高,并且对于大规模问题的求解具有潜在优势,进一步表明了最陡边主元规则的可行性和有效性.This paper offers a new pivot index based on the most-steep-rule.The paper combines the most-steep-rule algorithm and deficient-basis algorithm to bring the advantages of the two types of algorithms into full play.Our numerical results show that the deficient basis and the most-steep-rule can overcome the influence of the degradation and reduce the total iterations effectively,its efficiency is far superior to the traditional deficient-basis dual algorithm.So the most steep rule is a very attractive new approach.

关 键 词：亏基 退化 最陡边 主元标 

分 类 号：O221.1[理学—运筹学与控制论]